Suppose that 2n-1 = 1 (mod n). Is n necessarily prime?
Step 2 of 4
We have to prove
If is a prime number then n is prime .
Or we have to prove if n is a composite number then is also a composite number.
Textbook: Discrete Mathematics and Its Applications
Author: Kenneth Rosen
Since the solution to 14RQ from 4.R chapter was answered, more than 254 students have viewed the full step-by-step answer. The answer to “Suppose that 2n-1 = 1 (mod n). Is n necessarily prime?” is broken down into a number of easy to follow steps, and 11 words. The full step-by-step solution to problem: 14RQ from chapter: 4.R was answered by , our top Math solution expert on 06/21/17, 07:45AM. This full solution covers the following key subjects: mod, necessarily, prime, suppose. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7.