filifa
/
eulerbooks
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 1 Wiki Activity

add relevant sequence

This commit is contained in:
filifa 2025-07-19 00:59:39 -04:00
parent 895489ec84
commit 3f42328cb3
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
notebooks/problem0005.ipynb
View File

@ -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)"
]
}
],