Question: Prove that if a prime number p = 4n + 1, then if we denote N = (2n)!, then N^2 1 mod p Hint: Use

Prove that if a prime number p = 4n + 1, then if we denote N = (2n)!, then N^2 1 mod p

Hint: Use the fact that 1 2 . . .(2n) (2n + 1). . .(4n) = (4n)! 1 mod p and then rewrite numbers 4n, 4n 1, . . . , 2n + 1 as smaller remainders by mod 4n + 1.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!