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

  • Thread starter Thread starter numberthree
  • Start date Start date
  • Tags Tags
    Algebra
Click For Summary

Homework Help Overview

The discussion revolves around proving a statement related to the primality of the numbers 2n-1 and 2n+1 for n greater than 2. The original poster seeks to establish that if one of these numbers is prime, then the other must not be prime.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants explore the implications of assuming one of the numbers is prime and attempt to show that the other is not. There are discussions about specific cases, such as when n is odd or even, and whether these cases affect the primality of the numbers involved.

Discussion Status

Some participants have suggested using mathematical induction as a potential approach, with a base case provided. Others express uncertainty about how to start or the correctness of their reasoning, indicating a mix of exploration and questioning of assumptions.

Contextual Notes

There is mention of specific conditions under which 2n-1 and 2n+1 are prime, particularly focusing on the parity of n. The original poster's inquiry is framed within the constraints of a homework assignment, which may impose specific methods or approaches to be used.

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
What have you tried?
 
I don't even know how to start.
 
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 2^3-1 = 8 - 1 = 7 is prime and 2^3 + 1 = 9 is not since 9 = 3 \cdot 3.

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

Similar threads

  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
6
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K