Let p be a prime number and k be a positive integer. If p divides k², then which of these is DEFINITELY divisible by p?
Competency-Based Questions (CBQ) · Question 21 of 87
Let p be a prime number and k be a positive integer. If p divides k², then which of these is DEFINITELY divisible by p?
(A) only
(B) only and
- Correct answer
(C) only and
(D) all and
Step 1 — use Theorem 1.2.
We are told is prime and . Theorem 1.2 says exactly:
If a prime divides , then divides .
So
Step 2 — test each expression in turn.
— this is Step 1. Divisible by ✓
— since , write . Then , a multiple of ✓
— , again a multiple of ✓
— this need not even be a whole number. Take and : then , which is not an integer, so asking whether divides it does not make sense.
Even when it is an integer, it can fail: with and , happens to work — but with and , , and 2 does not divide 1.
So is not definitely divisible by .
Step 3 — collect the results.
, and are all definitely divisible by ; is not.
The general principle. Once divides , it divides every multiple of — and and are both multiples of . Division is what breaks the guarantee, because dividing can remove the very factor of you were relying on.
