‹
🧮
LCM & HCF
· Formula🧮 Formula Reference Sheet
HCF: largest number dividing both LCM: smallest number divisible by both For a, b: LCM × HCF = a × b Euclid: HCF(a,b) = HCF(b, a mod b) Use: 12=2²·3, 18=2·3² → HCF=2·3=6, LCM=2²·3²=36
⚡ Example per formula
HCF: largest number dividing both
↳HCF(24, 36) = 12
LCM: smallest number divisible by both
↳LCM(4, 6) = 12
For a, b: LCM × HCF = a × b
↳HCF(24, 36) = 12
Euclid: HCF(a,b) = HCF(b, a mod b)
↳HCF(24, 36) = 12
Use: 12=2²·3, 18=2·3² → HCF=2·3=6, LCM=2²·3²=36
↳HCF(24, 36) = 12
✏️
Practice Exercises →
5 graded problems · AI checks each step