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. 14)
14.
The least number which when divided by 5, 6 , 7 and 8 leaves a remainder 3, but when divided by 9 leaves no remainder, is:
Answer: Option
Explanation:
L.C.M. of 5, 6, 7, 8 = 840.
Required number is of the form 840k + 3
Least value of k for which (840k + 3) is divisible by 9 is k = 2.
Required number = (840 x 2 + 3) = 1683.
Discussion:
86 comments Page 9 of 9.
Emu said:
1 decade ago
suchita it"s working.........
Priya said:
1 decade ago
nice Suchita ......it was nice
Suchita said:
1 decade ago
hey.....just add the digits of given options as
1+6+8+3=18 the answer is that which can be divided by 9.
remaining numbers can't divide by 9.
1+6+8+3=18 the answer is that which can be divided by 9.
remaining numbers can't divide by 9.
Sundar said:
1 decade ago
Let (840k + 3) = 1683 [ 1683 taken from Option B]
Therefore, k = (1683-3)/840
k = 1680/840
k = 2.
Note: (840k + 3) should be divisible by 9 if we substitute k = 2.
Therefore, k = (1683-3)/840
k = 1680/840
k = 2.
Note: (840k + 3) should be divisible by 9 if we substitute k = 2.
Chinmaya said:
1 decade ago
How you will get 2 ?
Rupesh said:
2 decades ago
All thing I understand but how this value of k is taken 2 can som one explain me.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers