Before you can read a single line of the LCM page, you need to own every symbol it throws at you. Below, each one is built from nothing — plain words, then a picture, then the reason the topic can't live without it.
Look at the top row of the figure below. Starting at 0, every jump of 4 lands on a green dot. Every jump of 6 lands on a coral dot. The very first place a green dot and a coral dot stack on top of each other is 12 — the first shared landing spot.
The parent page writes 36/12=3 to check that 36 is a multiple of 12. The check is: does 12 fit into 36 a whole number of times? Yes, 3 times — so 36 really is a common multiple.
See the middle of the figure: a prime like 5 is a single solid block — you cannot break it into a rectangle of smaller equal rows. But 6can become a 2×3 rectangle, so 6 is not prime.
That word unique is a promise made by a big theorem — the Fundamental Theorem of Arithmetic: every whole number above 1 has exactly one prime recipe. No number has two different recipes. That is why comparing recipes is a safe, honest way to compare numbers.
The figure shows a factor tree for 12: keep splitting until every branch-tip is prime. The tips read 2,2,3 — that's the recipe.
Think of it as an instruction: "go through every prime, raise it to its pile-size, and multiply the whole lot." That is exactly how you rebuild a number from its recipe.
The figure below shows two piles of the same prime (one from a, one from b). For the LCM you keep the taller pile (max) — so both numbers still fit inside. For the HCF you keep the shorter pile (min) — that's all they truly share.
Why they show up: to be a multiple of a, a number must contain at leastα copies of each prime (≥). To be a divisor of a, it may contain at mostα copies (≤). That single difference — ≥ for multiples, ≤ for divisors — is why LCM uses max and HCF uses min.
Test yourself — you should answer each instantly before moving to the parent page.
A multiple of 6 is…
any number you reach by counting up in 6s: 6,12,18,24,…
A factor of 12 is…
a whole number that divides 12 with no remainder: 1,2,3,4,6,12.
Is 1 a prime number?
No — primes start at 2; 1 is excluded so recipes stay unique.
The prime factorization of 18 is…
2⋅32 (one 2, two 3s).
23 equals…
2×2×2=8.
50 equals…
1 (zero copies of 5 — an empty pile).
max(2,3) and min(2,3) are…
3 and 2.
min(α,β)+max(α,β) equals…
α+β (the two originals, nothing lost).
p∏pαp means…
multiply each prime raised to its pile-size — i.e. rebuild the number from its recipe.
"x≥α" reads…
"x is at least α" (equal or bigger).
Why does LCM take the max power?
so the result contains enough of every prime to be divisible by both numbers.
Why does HCF take the min power?
a common divisor can only use what both share — the smaller pile.
Recall One-sentence summary
A number is a recipe of primes; comparing two recipes pile-by-pile (max for "cover both" = LCM, min for "shared only" = HCF) is all the machinery the parent topic needs.