The ones who are crazy enough to think they can change the world are the ones who do.- Steve Jobs
11. If the product 3252 * 9P2 is divisible by 12, the value of P is:
Option: D
split 12 into co-primes
i.e. 12 = 3 x 4, 3 & 4 are co-primes
the number should be divisible by both 3 & 4. Clearly the number 3252 is divisible by 4
so 9P2 must be divisible by 3
so (9 + P + 2) = 11 + P, least value of P is 1
the number 12 is divisible by 3
i.e. value of P = 1
12. If the number 4#4 is divisible by 6, then the value of # is:
Option: A
split 6 into co-primes
i.e. 6 = 2 x 3,2 & 3 are co-primes
the number should be divisible by both 2 & 3. clearly the number 4#4 is divisible by 2
(4 + # + 4) = 8 + #, which is divisible by 3
the least value of # is 1,such that the number is divisible by 3
the value of X = 1
13. Which of the following numbers is divisible by 24?
Option: B
split 24 into co-primes
i.e. 24 = 3x8, 3 & 8 are co-primes
the number should be divisible by both 3 & 8
(3 + 1 + 2 + 5 + 7 + 3 + 6) = 27, which is divisible by 3
last three digits 736 is also divisible by 8
3125736 is divisible by 24
14. How many of the following numbers are divisible by 132?264, 396, 462, 792, 968, 2178, 5184, 6336
Option: C
split 132 into co-primes
i.e. 132 = 3x4x11, 3,4 & 11 are co-primes
the number must divisible by 3, 4 & 11
968 not divisible by 3
462 & 2178 not divisible by 4
5184 not divisible by 11
264, 396, 792, 6336 are divisible by 3, 4 & 11
so total numbers divisible by 3, 4 & 11 are 4
15. 476XY0 is divisible by both 3 & 11. The non-zero digits in the hundred's and ten's places are respectively:
Option: C
the number must be divisible by both 3 & 11
(4 + 7 + 6 + X + Y + 0) = X + Y + 17, which is divisible by 3
(0 + X + 7) - (Y + 6 + 4) = X - Y - 3, which is divisible by 11
take X + Y + 17 as equation 1
take X - Y - 3 as equation 2
solving two equations we get respective values of X & Y
after solving the value of X = 8 and Y = 5
We may make mistakes(spelling, program bug, typing mistake and etc.), So we have this container to collect mistakes. We highly respect your findings.
© Copyright 2019