Problem 14RQ

Suppose that 2n-1 = 1 (mod n). Is n necessarily prime?

SOLUTION

Step1

We have to prove

If is a prime number then n is prime .

×

Log in to StudySoup

Get Full Access to
Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.r - Problem 14rq

Join StudySoup for FREE

ISBN: 9780073383095
37

Discrete Mathematics and Its Applications | 7th Edition

- Textbook Solutions
- 2901 Step-by-step solutions solved by professors and subject experts
- Get 24/7 help from StudySoup virtual teaching assistants

Discrete Mathematics and Its Applications | 7th Edition

Get Full Solutions
20

2

Problem 14RQ

Problem 14RQ

Suppose that 2n-1 = 1 (mod n). Is n necessarily prime?

Step-by-Step Solution:
##### Textbook: Discrete Mathematics and Its Applications

##### Edition: 7

##### Author: Kenneth Rosen

##### ISBN: 9780073383095

Step 1 of 4

SOLUTION

Step1

We have to prove

If is a prime number then n is prime .

Step 2 of 4
###### Chapter 4.R, Problem 14RQ is Solved

View Full Solution

Step 3 of 4

Since the solution to 14RQ from 4.R chapter was answered, more than 399 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.

Unlock Textbook Solution

Enter your email below to unlock your **verified solution** to:

Suppose that 2n-1 = 1 (mod n). Is n necessarily prime?