- #1
Char. Limit
Gold Member
- 1,222
- 22
First, remember that the OP is new to pure number theory.
We all know that not every number that follows the formula 2n-1 is prime. My question is, without using trial and error, how would you prove or disprove this statement?
"All numbers that obey the formula 2n-1, when n is a real integer number greater than 1, are prime."
We all know that not every number that follows the formula 2n-1 is prime. My question is, without using trial and error, how would you prove or disprove this statement?
"All numbers that obey the formula 2n-1, when n is a real integer number greater than 1, are prime."