# Show that if 2n- 1 is prime, then n is prime. [Hint: Use

## Problem 19E Chapter 4.3

Discrete Mathematics and Its Applications | 7th Edition

• 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

4 5 0 410 Reviews
11
5
Problem 19E

Show that if 2n- 1 is prime, then n is prime. [Hint: Use the identity 2ab- 1 = (2a - 1). (2a(b-2+......+2a+1).]

Step-by-Step Solution:

Step 1</p>

We have to show that if is  prime then  n is prime.

Step 2 of 2

#### Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

Show that if 2n- 1 is prime, then n is prime. [Hint: Use

×
Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.3 - Problem 19e

Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 4.3 - Problem 19e

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help

Having trouble accessing your account? Let us help you, contact support at +1(510) 944-1054 or support@studysoup.com

Password Reset Request Sent An email has been sent to the email address associated to your account. Follow the link in the email to reset your password. If you're having trouble finding our email please check your spam folder
Already have an Account? Is already in use