Prove that for every prime p and for all natural numbers a,
(a) gcd(p, a) = p iff p divides a.
(b) gcd(p, a) = 1 iff p does not divide a.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.