Prove that if p is prime and 0 < k < p, then gcd(k, p) = 1.

Question:

Prove that if p is prime and 0 < k < p, then gcd(k, p) = 1.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: