Let x be the least number divisible by 13 such that when x is divided by 4 5 6 7 8 and 12 the remain...........

Quantitative Aptitude (CPO) Number System

Let x be the least number divisible by 13, such that when x is divided by 4, 5, 6, 7, 8 and 12, the remainder in each case is 2. The sum

of the digits of x is:

This questions was previously asked in

SSC CPO 12th Dec 2019 Shift-1

View All SSCCPO Previous Year Papers

छोटे Courses बड़े Results

Master Number System

Prepare through Micro-courses

Try Now

Explanation:

Correct option 3: 11

LCM = 2x2x2 x 3 x 5 x 7 = 840
Let (840k + 2) be divisible by 13, then
Quotient = 64k and Remainder = (8k + 2)
Put k = 1, 2, 3, 4...
So, put k = 3
Remainder = (8 x 3 + 2) = 26
⇒26/13 = 2
Now,
⇒ 840k + 2
⇒ 840 x 3 + 2
=2520 + 2
⇒2522
Sum of digit of 2522 = 2 +5+2+2=11