


Method and examples


HCF_LCM 



Problem 8 of 11 


8. The greatest no that will divide , , leaving respectively , , as remainder.










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 
8. The greatest no that will divide 290 , 460 , 552 leaving respectively 4 , 5 , 6 as remainder.
The number divides 290 and leaves 4 as remainder `:.` The number exactly divides 290  4 = 286
The number divides 460 and leaves 5 as remainder `:.` The number exactly divides 460  5 = 455
The number divides 552 and leaves 6 as remainder `:.` The number exactly divides 552  6 = 546
Now, we have to find HCF of `286, 455, 546`
Find HCF of (286,455)
    
 286             
 
                    
 
                          
 
                                
 
                                    
            
HCF of (286, 455) = 13
Now find HCF of (13,546)
HCF of (13, 546) = 13
`:.` HCF of given numbers (286,455,546) = 13
`:.` Required number = HCF of `286, 455, 546 = 13`.







