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

Chapter 5, Problem 14RQ

(choose chapter or problem)

Get Unlimited Answers
QUESTION:

Problem 14RQ

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

Questions & Answers

QUESTION:

Problem 14RQ

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

ANSWER:

SOLUTION

Step1

We have to prove

If  is a prime number then n is prime .

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back