From 3f42328cb33b755d58d5a15d3673d72c805fb5f5 Mon Sep 17 00:00:00 2001 From: filifa Date: Sat, 19 Jul 2025 00:59:39 -0400 Subject: [PATCH] add relevant sequence --- notebooks/problem0005.ipynb | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/notebooks/problem0005.ipynb b/notebooks/problem0005.ipynb index 5a3adf4..ecc1c95 100644 --- a/notebooks/problem0005.ipynb +++ b/notebooks/problem0005.ipynb @@ -46,7 +46,10 @@ "$$\\mathrm{lcm}(m,n) = \\frac{mn}{\\gcd(m,n)}$$\n", "where $\\gcd$ is the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor). The [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm) gives an efficient method for calculating the GCD.\n", "\n", - "This formula is only defined for two numbers, but if we want to find an LCM of a set of three or more numbers, we can simply find the LCM of any two numbers in the set, then proceed to find the LCM of that value and another number from the set, repeating until we have used each number. For example, to find the LCM of 5, 8, and 14, you can first find the LCM of 5 and 8 using the above formula (40), then find the LCM of 40 and 14 (280)." + "This formula is only defined for two numbers, but if we want to find an LCM of a set of three or more numbers, we can simply find the LCM of any two numbers in the set, then proceed to find the LCM of that value and another number from the set, repeating until we have used each number. For example, to find the LCM of 5, 8, and 14, you can first find the LCM of 5 and 8 using the above formula (40), then find the LCM of 40 and 14 (280).\n", + "\n", + "## Relevant sequences\n", + "* Least common multiple of $1,2,\\ldots,n$: [A003418](https://oeis.org/A003418)" ] } ],