Find the greatest number of five digits which when divided by 3. 5. 8. 12 have 2 as remainder :
Find the greatest number of five digits which when divided by 3. 5. 8. 12 have 2 as remainder : 1). 99999 2). 99958 3). 99960 4). 99962
SSC CGL Books
2 answers
Answered by
Guest on
2018-01-20 03:45:01 | Votes
2 |
#
is option 4 is the correct answer am i right
Join Telegram Group
Answered by
Guest on
2018-04-09 19:25:34 | Votes
0 |
#
Using Rule 4,
The greatest number of five digits
is 99999.
LCM of 3, 5, 8 and 12
LCM = 2 × 2 × 3 × 5 × 2 = 120
After dividing 99999 by 120, we
get 39 as remainder
99999 – 39 = 99960
= (833 × 120)
99960 is the greatest five digit
number divisible by the given divisors.
In order to get 2 as remainder in
each case we will simply add 2
to 99960.
Greatest number
= 99960 + 2 = 99962
Other Questions
1. The largest number of five digits which, when divided by 10, 24, 30, or 36 leaves the same remainder 10 in each case, is :
2. 84 Maths books, 90 Physics books and 120 Chemistry books have to be stacked topicwlse. How many books will be there in each stack so that each stack will have the same height too
3. A number x is divisible by 7. When this number is divided by 8, 12 and 16. It leaves a remainder 3 in each case. The least value of x is:
4. The HCF of two numbers 12906 and 14818 is 478. Their LCM is
5. What is the least number which when divided by the numbers 3, 5, 6, 8, 10 and 12 leaves in each case a remainder 2 but when divided by 13 leaves no remainder
6. Three men etcp off together from the same spot. Their steps measure 63 cm. 70 cm and 77 cm respectively. The minimum distance each should cover so that all can cover the distance in complete steps is
7. Two numbers are in the ratio 3:4. Their L.C.M. is 84. The greater number is
8. The number of pair of positive integers whose sum is 99 and HCF is 9 is
9. The product of two numbers is 4107. If the H.C.F. of the numbers is 37, the greater number is
10. The H.C.F. and L.C.M. of two 2- digit numbers are 16 and 480 respectively. The numbers are :