To prove a number is divisible by 36, which pair of divisibility tests is enough?
ABy 6 and by 12
BBy 3 and by 12
CBy 2 and by 18
DBy 4 and by 9
Answer & Solution
Correct answer: D. By 4 and by 9
1. Split 36 into 4 x 9, where 4 = 2 squared and 9 = 3 squared hold the full prime powers.
2. A number divisible by both 4 and 9 is divisible by 36.
3. Pairs like 3 and 12 or 2 and 18 share factors and are not sufficient.
_Source: Wikipedia, Divisibility rule, section Composite divisors_
Keep practising Divisibility Rule
Browse all Divisibility Rule questions for CTET, or explore more Mathematics topics.
Related questions
The common divisors of two numbers are exactly the divisors of what?What is the highest number that divides both 48 and 180?Using the highest prime powers, what is the lcm of 48 and 180?Find gcd(17, 0), the greatest common divisor.Which of these pairs of numbers is coprime?Two numbers are coprime when their greatest common divisor equals what?The greatest common divisor of two numbers is the greatest positive integer that does whatThe sum of the proper divisors of a number is known by which name?