


Method and examples


HCF_LCM 



Problem 3 of 11 


3. Find the smallest no exactly divisible by .










Solution 
Solution provided by AtoZmath.com


Want to know about

This is demo example. Please click on Find button and solution will be displayed in Solution tab (step by step)
HCF_LCM 
3. Find the smallest no exactly divisible by 12,15,20,27 .
`"Required number" = "LCM of " 12,15,20,27 = 540`.
2  12   15   20   27  2  6   15   10   27  3  3   15   5   27  3  1   5   5   9  3  1   5   5   3  5  1   5   5   1   1   1   1   1 
LCM of 12,15,20,27 = 2 × 2 × 3 × 3 × 3 × 5 = 540







