Can Mathematical Induction Prove the Primality of 2n-1 and 2n+1?

  • Thread starter Thread starter numberthree
  • Start date Start date
  • Tags Tags
    Algebra
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
5 replies · 2K views
numberthree
Messages
8
Reaction score
0

Homework Statement



Prove that if one of the numbers 2n-1 and 2n+1 is prime, n>2, then the other number is not

Homework Equations





The Attempt at a Solution

 
Physics news on Phys.org
Part 1: Pick one of the numbers, and assume it is a prime larger than 2. Then show that the other number is not prime.

Part 2: Now pick the other number, and assume it is a prime larger than 2. Then show that the other number is not prime.
 
I don't know...it the result is correct but...2^n-1 is prime when n is an odd number...not all odd number but n has to be of the odd form...and 2^n+1 is prime...when n is some even number...

can somebody tell me if it is correct...
 
Have you thought about using mathematical induction?

Set up your base case: n = 3
You will show that [tex]2^3-1 = 8 - 1 = 7[/tex] is prime and [tex]2^3 + 1 = 9[/tex] is not since [tex]9 = 3 \cdot 3[/tex].

Assume that it's true for n. Then prove the case for n + 1.