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.
Lavi said:
1 decade ago
Oh, its simple one. You have to check only options. As question said when divided by 9 leaves no remainder. Means you have to check the divisibility of 9.
Bujji said:
1 decade ago
Simply divide the options with 9 and which option whose remainder is 0 it is the answer.
Priyanka Mishra said:
1 decade ago
@Kranthi you can check from the options by dividing the number by 5, 6, 7, 8 and find if the required remainder is coming or not.
Kranthi said:
1 decade ago
If all the options divided by 9 then what we have to choose?
Rd sharma said:
1 decade ago
In question when number is divided by 9 no reminder. If reminder is 2 then how can solve this question. Please reply anyone.
Ramya said:
1 decade ago
Why we are using variable k?
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers