Solution
Is the Reason true?
Yes — it is Theorem 1.2 of this chapter, word for word:
If p is prime and p divides a2, then p divides a.
R is true.
Is the Assertion true?
It claims: if p∣a2 then p2∣a2. Follow it through.
Step 1. We are given p∣a2. By Theorem 1.2 (which is exactly what R supplies),
p∣a
Step 2. So a can be written as
a=pkfor some integer k
Step 3. Square both sides:
a2=(pk)2=p2k2
Step 4. The right-hand side is p2 times a whole number, so
p2∣a2
A is true.
A worked example. Take p=3 and a2=36. Then 3∣36, and indeed a=6 is divisible by 3, and 9∣36 as the Assertion predicts.
Does R explain A?
Yes, and it is the essential step. Without Theorem 1.2 you could not get from "p divides a2" to "p divides a", and the whole argument would stall at Step 1. R is precisely the tool that makes Step 1 legal.
(A) Both A and R are true and R is the correct explanation of A