doc: explain method.

crhallberg · crhallberg · commit 030a0fde9f18 · 2025-12-03T18:58:11.000-05:00
diff --git a/Project-Euler/Problem005.js b/Project-Euler/Problem005.js
@@ -4,9 +4,11 @@ import { PrimeFactors } from '../Maths/PrimeFactors.js'
  * Smallest Multiple
  * @link https://projecteuler.net/problem=5
  *
- * 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
+ * 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
  *
- * What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?
+ * Method: unique factorization
+ * @link https://en.wikipedia.org/wiki/Least_common_multiple#Using_prime_factorization
+ * The method used below calculates the Least Common Multiple (LCM) by multiplying the largest powers of the prime factors of the divisors. For example, 8 is the LCM of 2, 4, and 8. The prime factors of these numbers are 2^1, 2^2, and 2^3. We can discard 2^1 and 2^2 since 2^3 is the largest power of 2, leaving us with a result of 2^3 (8).
  */
 
 export function findSmallestMultiple(maxDivisor) {

Original file line number	Diff line number	Diff line change
`@@ -4,9 +4,11 @@ import { PrimeFactors } from '../Maths/PrimeFactors.js'`
`4`	`4`	`* Smallest Multiple`
`5`	`5`	`* @link https://projecteuler.net/problem=5`
`6`	`6`	`*`
`7`		`- * 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.`
	`7`	`+ * 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?`
`8`	`8`	`*`
`9`		`- * What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?`
	`9`	`+ * Method: unique factorization`
	`10`	`+ * @link https://en.wikipedia.org/wiki/Least_common_multiple#Using_prime_factorization`
	`11`	`+ * The method used below calculates the Least Common Multiple (LCM) by multiplying the largest powers of the prime factors of the divisors. For example, 8 is the LCM of 2, 4, and 8. The prime factors of these numbers are 2^1, 2^2, and 2^3. We can discard 2^1 and 2^2 since 2^3 is the largest power of 2, leaving us with a result of 2^3 (8).`
`10`	`12`	`*/`
`11`	`13`
`12`	`14`	`export function findSmallestMultiple(maxDivisor) {`