Aptitude - Problems on H.C.F and L.C.M - Discussion

Division Method: Suppose we have to find the H.C.F. of two given numbers, divide the larger by the smaller one. Now, divide the divisor by the remainder. Repeat the process of dividing the preceding number by the remainder last obtained till zero is obtained as remainder. The last divisor is required H.C.F.

ans...

Required number = H.C.F. of (1657 - 6) and (2037 - 5)

= H.C.F. of 1651 and 2032
let devide the greater no with smaller one means
2030/1651=381
then,1651/381=127
then,381/127=0

so the
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:127

Plz explain all

HCF explain please.

H.C.F of 1651 and 2032, Explain please.

I need the calculation process for finding hcf.

@Ramesh

It is better explained in the following link...check it out

http://www.ilovemaths.com/1lcmandhcf.asp

H.C.F of 1651 and 2032, Explain please.

HCF explain please.

HCF Explain & give me some examples please.

H.C.F example please