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 6 of 9.
Vinay said:
10 years ago
Yes if there was no option for how to find k. I can also go with @Mukul.
Sags. said:
9 years ago
Why are we using variable 'K'? Please tell the method not shortcut.
Iswaryalakshmi said:
1 decade ago
If they don't give options how can I get 'k' value? Please explain.
Satheesh said:
1 decade ago
Divide each answer by 9 which one has no reminder that's answer.
Kranthi said:
1 decade ago
If all the options divided by 9 then what we have to choose?
Sana said:
8 years ago
Very clear and effective explanation. Thanks a lot @Suchita.
Akshay said:
8 years ago
How did you get that the req number is of the form 840k+ 3?
Rupam Gupta said:
8 years ago
Explanation of the answer is very helpful, Thank You all.
Mukul said:
10 years ago
What if there was no option for and, then how to find k?
Saurabh agrawal said:
1 decade ago
Suchita's trick is great. Very short and productive.
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers