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. 4)
4.
Let N be the greatest number that will divide 1305, 4665 and 6905, leaving the same remainder in each case. Then sum of the digits in N is:
Answer: Option
Explanation:
N = H.C.F. of (4665 - 1305), (6905 - 4665) and (6905 - 1305)
= H.C.F. of 3360, 2240 and 5600 = 1120.
Sum of digits in N = ( 1 + 1 + 2 + 0 ) = 4
Discussion:
158 comments Page 13 of 16.
Debita said:
9 years ago
@Srinivas.
Thanks, this is the perfect explanation like a true mathematician.
Thanks, this is the perfect explanation like a true mathematician.
Bunny said:
9 years ago
Why should we subtract before finding out the HCF? can anybody tell me?
Shreya said:
9 years ago
Thank you @Harish.
Tushar said:
9 years ago
@All.
Whenever we see highest, greatest, largest, etc -> this kind words in question, then take HCF.
And whenever we see smallest, lowest, etc -> this kind of words in question, then take LCM.
Whenever we see highest, greatest, largest, etc -> this kind words in question, then take HCF.
And whenever we see smallest, lowest, etc -> this kind of words in question, then take LCM.
Mounika said:
9 years ago
Thank you all for explaining it.
Mounika said:
9 years ago
Thanks for Excellent explanation @Suraj.
Supriya said:
9 years ago
Thanks @Priya.
Hanumant said:
9 years ago
Thank you all for explaining it.
Shirish said:
9 years ago
Thanks to all for the correct explanation.
Diya said:
8 years ago
Thanks @Prakash.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers