◀ ▲ ▶Branches / Number-theory / Proof

Proof

(related to Proposition: Co-prime Primes)

• $p$ is by hypothesis a prime, therefore it has only the divisors $1$ and $p.$
• Since by hypothesis $p\not\mid n$, the greatest common divisor equals $\gcd(p,n)=1.$
• This, by definition, means that $p$ and $n$ are co-prime.
  ∎

Thank you to the contributors under CC BY-SA 4.0!

Github:

References

Bibliography

1. Landau, Edmund: "Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927