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

Discussion Forum : Problems on H.C.F and L.C.M - General Questions (Q.No. 26)
26.
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:
123
127
235
305
Answer: Option
Explanation:

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

  = H.C.F. of 1651 and 2032 = 127.

Discussion:
38 comments Page 1 of 4.

Harpreet kaur said:   3 years ago
1651 = 13 * 127.
2032 = 2 * 2 * 2 * 2 * 127.
So common is 127.
That's why H.C.f 127.
(16)

Ayushi said:   4 years ago
1st no 1657 - 6 = 1651.
2nd no 2037-5 = 2032 (now, they both get exactly divisible by greatest no.)

the short trick to find HCF: take the difference and see that difference is divisible by these 2 no.(1651 and 2032) or not.

2032 - 1651 = 381.

Factors of 381 = 1,3,127,138.

So, here the ans is 127 which is the greatest divisor of 381.
(14)

Balu said:   4 years ago
In these type of questions, just cross-check the answers.

Let the number be "X".

1657/X and 2037/X leaves remainders 6 and 5.
Then, Substitute answers in the place of X and.

1657/127 leaves remainder 6.
2037/127 leaves remainder 5.

Then the answer is 127.
(7)

Nikita said:   4 years ago
HCF = 2037-1657 = 381 and there factors answer is127.

Because we have to find greatest common factor.
(6)

Rishav said:   7 years ago
Why HCF and not LCM?

Lets see,
We have to find the greatest number which on dividing 1657 and 2037 leaves remainder 6 and 5.

Forget about 'greatest'.
we need a number 'which divides 1657' and '2037' ie, if that number is 'x', we have the expression as 1657/x with remainder 6 and 2037/x with remainder 5.

Lets write this in the division form (Dividend = quotient*divisor + remainder)
ie, 1657 = q1 * x + 6.
2037 = q2 * x + 5.

Therefore,
1651 = q1 * x.
2032 = q2 * x.

ie, 'x' (our number) is a common 'FACTOR' of 1651 & 2032 (NOT 'Multiple'). [eg. 24 = 12 *2 or 6*4 or 8*3 ... etc. here, 12 & 2, 6 &4, 8 &3 all are factors of 24 and not multiple].

So, we need common factors of 1651 & 2032 and just select the greatest among them(since the question asks for the greatest).
(3)

Jaydeep said:   3 years ago
Thank you so much for explaining the answer.
(2)

Aayushi said:   5 years ago
This method of finding HCF of two large no. is called Euclid's division lemma, you can check it further on youtube you will then be able to solve the question.
(2)

KM MANIMEGAN said:   1 decade ago
TO FIND THE HCF OF TWO NUMBERS,

DIVIDE THE BIGGER NUMBER BY SMALLER .

TAKE 2032 AND 1651, ON DIVIDING.

1651)2032( 1
1651
--------------
381
-------------
THEN DIVIDE 1651 BY 381.

381)1651(4
1524
--------------
127
--------------
THEN DIVIDE 381 BY 127.

127)381(3
381
----------
0
----------
THE DIVIDING OF BIGGER NUMBER BY SMALLER NUMBER SHOULD CONTINUE TILL WE GET REMAINDER AS ZERO.

THEN THE LAST DIVISOR IS THE H.C.F OF THE TWO GIVEN NUMBERS.
(1)

Shivam said:   9 years ago
If we divide 7 by 2 it gives a remainder of 1.

Either we add or subtract the remainder 1 from 7 the numbers obtained 8 and 6 which is divisible by 2.

How the answer come in this problem, that we have to add or subtract?

Prabhakaran said:   1 decade ago
@Thayagarajan. How we know 127 is the correct answer?, that's we need tell clearly.


Post your comments here:

Your comments will be displayed after verification.