Let p be a prime and a an integer. If p divides a2, then p divides a
Proof. Given that
p divides
a2, so that means that:
p∣a2.
Each integer can be written as a unique prime factorization. Therefore:
a=i=1∏npimi.
This means that:
p∣(i=1∏npimi)2⟺p∣i=1∏npi2mi
and
p=pi for some
i∈{1,2,…,n} as
p is prime. Therefore:
p∣i=1∏npimi⟺p∣a,
which concludes the proof.