If p Is Prime And p∤a, Then gcd(p, a) = 1

If \(p\), then is only hs two divisor, 1 and \(p\). This means the greatest common divisor of \(p\) and an integer \(a\) is either \(p\) or 1. If \(p \nmid a\), then there greatest common divisor can only be 1.

$$ \gcd(p, a) = 1 $$

Styles

(uses cookies)