Join 60,000+ competitive exam aspirants
Find the least number which when divided by 5, 6, 3 and 4 leaves a remainder 2, but when divided by 7 leaves no remainder. 2660
168
147
198
182
182
To find the number, calculate the Least Common Multiple (LCM) of 5, 6, 3, and 4, which is 60. The number must be of the form 60k + 2, and since it must be divisible by 7, testing values for k reveals that for k=3, 60(3) + 2 equals 182, which is perfectly divisible by 7.
To find the number, calculate the Least Common Multiple (LCM) of 5, 6, 3, and 4, which is 60. The number must be of the form 60k + 2, and since it must be divisible by 7, testing values for k reveals that for k=3, 60(3) + 2 equals 182, which is perfectly divisible by 7.
The concept of divisibility rules is foundational to the Indian Statistical Service (ISS) and various competitive aptitude syllabi, tracing back to ancient Indian mathematical treatises like the Aryabhatiya by Aryabhata, which formalized early number theory.
LCM of 3, 4, 5, 6 is 60 as 60 is the smallest multiple divisible by these integers.
A number leaving a constant remainder 'r' follows the form (LCM * k) + r.
Divisibility by 7 requires (60k + 2) mod 7 = 0, which simplifies to (4k + 2) mod 7 = 0.
For k=3: 60*3 + 2 = 182; 182/7 = 26, confirming divisibility.
Option A (168): 168 is divisible by 7 but leaves a remainder of 3 when divided by 5.
Option B (147): 147 is divisible by 7 but does not satisfy the remainder conditions for the other divisors.
Option C (198): 198 divided by 7 leaves a remainder of 2, failing the divisibility criteria.
D is correct тАФ 182 is the smallest integer that leaves a remainder of 2 when divided by 5, 6, 3, and 4, and is fully divisible by 7.
Mastering LCM and HCF is critical for speed in Data Interpretation (DI) sections of bank exams, as they frequently appear in time-and-work and circular motion problems.