From 50ab822123a767a6bb66cd614f845158464aa61d Mon Sep 17 00:00:00 2001 From: filifa Date: Sun, 25 May 2025 23:18:19 -0400 Subject: [PATCH] add relevant sequences --- notebooks/problem0048.ipynb | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/notebooks/problem0048.ipynb b/notebooks/problem0048.ipynb index d0df328..68a5f96 100644 --- a/notebooks/problem0048.ipynb +++ b/notebooks/problem0048.ipynb @@ -43,7 +43,11 @@ "$$ab \\bmod{m} = (a \\bmod{m})(b \\bmod{m}) \\bmod{m}$$\n", "The first two properties allows us to recursively break up a large power into two products (if the exponent is even) or three products (if the exponent is odd), a process known as [exponentiation by squaring](https://en.wikipedia.org/wiki/Exponentiation_by_squaring). The third property then allows us to distribute the modulus over multiplication. In tandem, these properties allow us to compute large powers with fewer multiplications, while also using less memory by keeping intermediate values small.\n", "\n", - "Interestingly, there is no known efficient algorithm for reversing this calculation, i.e. computing the [discrete logarithm](https://en.wikipedia.org/wiki/Discrete_logarithm)." + "Interestingly, there is no known efficient algorithm for reversing this calculation, i.e. computing the [discrete logarithm](https://en.wikipedia.org/wiki/Discrete_logarithm).\n", + "\n", + "## Relevant sequences\n", + "* $n^n$: [A000312](https://oeis.org/A000312)\n", + "* Partial sums of $n^n$: [A001923](https://oeis.org/A001923)" ] } ],