diff options
| author | Paul Duncan <pabs@pablotron.org> | 2026-01-02 18:35:32 -0500 |
|---|---|---|
| committer | Paul Duncan <pabs@pablotron.org> | 2026-01-02 18:35:32 -0500 |
| commit | cb58655bf0ed758716d33bc2b736b8bad2843dd9 (patch) | |
| tree | c842ffacabf9f2d8568bc7cee8d298afad783256 | |
| parent | 864dbfe3214b43292789bf175e51996637d98b31 (diff) | |
| download | pablotron.org-cb58655bf0ed758716d33bc2b736b8bad2843dd9.tar.xz pablotron.org-cb58655bf0ed758716d33bc2b736b8bad2843dd9.zip | |
content/posts/2026-01-02-new-years-primality-testing-by-hand.md: fix "further reading" header, add " (Wikipedia)" to link tooltips, add link to sympy
| -rw-r--r-- | content/posts/2026-01-02-new-years-primality-testing-by-hand.md | 30 |
1 files changed, 16 insertions, 14 deletions
diff --git a/content/posts/2026-01-02-new-years-primality-testing-by-hand.md b/content/posts/2026-01-02-new-years-primality-testing-by-hand.md index 586ffbc..502b850 100644 --- a/content/posts/2026-01-02-new-years-primality-testing-by-hand.md +++ b/content/posts/2026-01-02-new-years-primality-testing-by-hand.md @@ -56,7 +56,7 @@ brief arithmetic. I chose the latter: 1013 does not have any odd prime factors in the range \[3,√1013\], so it must be prime. -Let's check our work: +Let's check our work with [SymPy][]: ```python >>> import sympy @@ -67,33 +67,35 @@ True Success! -Further reading: +### Further Reading - [Integer factorization][] - [Primality test][] - [Sieve of Eratosthenes][] [fundamental theorem of arithmetic]: https://en.wikipedia.org/wiki/Fundamental_theorem_of_arithmetic - "Fundamental Theorem of Arithmetic" + "Fundamental Theorem of Arithmetic (Wikipedia)" [divisibility rules]: https://en.wikipedia.org/wiki/Divisibility_rule - "shorthand rules for determining if one number divides another" + "shorthand rules for determining if one number divides another (Wikipedia)" [11]: https://en.wikipedia.org/wiki/Divisibility_rule#11 - "divisibility rules for 11" + "divisibility rules for 11 (Wikipedia)" [13]: https://en.wikipedia.org/wiki/Divisibility_rule#13 - "divisibility rules for 13" + "divisibility rules for 13 (Wikipedia)" [17]: https://en.wikipedia.org/wiki/Divisibility_rule#17 - "divisibility rules for 17" + "divisibility rules for 17 (Wikipedia)" [19]: https://en.wikipedia.org/wiki/Divisibility_rule#19 - "divisibility rules for 19" + "divisibility rules for 19 (Wikipedia)" [23]: https://en.wikipedia.org/wiki/Divisibility_rule#23 - "divisibility rules for 23" + "divisibility rules for 23 (Wikipedia)" [29]: https://en.wikipedia.org/wiki/Divisibility_rule#29 - "divisibility rules for 29" + "divisibility rules for 29 (Wikipedia)" [euclidean algorithm]: https://en.wikipedia.org/wiki/Euclidean_algorithm - "Euclidean Algorithm" + "Euclidean Algorithm (Wikipedia)" [integer factorization]: https://en.wikipedia.org/wiki/Integer_factorization - "Integer factorization" + "Integer factorization (Wikipedia)" [primality test]: https://en.wikipedia.org/wiki/Primality_test - "Primality test" + "Primality test (Wikipedia)" [sieve of eratosthenes]: https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes - "Sieve of Eratosthenes" + "Sieve of Eratosthenes (Wikipedia)" +[sympy]: https://sympy.org/ + "Python library for symbolic mathematics." |