Prove that if x is a nontrivial square root of 1, modulo n, then gcd (x 1,

Question:

Prove that if x is a nontrivial square root of 1, modulo n, then gcd (x –1, n) and gcd (x + 1, n) are both nontrivial divisors of n.

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

Step by Step Answer:

Related Book For  answer-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

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

Question Posted: