Re: Sandwich primes!
- From: Dan <30pack@xxxxxxxxxxxxx>
- Date: Thu, 19 Jan 2006 21:55:36 EST
>>Something also interesting about this is ---
>>Where n = 2,3,4,5..n
>>(2^n -1) *2 +3 and then append 97 for each (n)
e.g.
>>(2^2-1) *2 +3 = 9 (append 97) = 997 = prime.
>>It appears on early observation for each (n) there are
>>more primes than the Mersenne's.
>>Also exponent (n) can be an odd or even integer >1 to
>>be a possible prime.
>The above is all wrong!
>It should be --
>(2^2-1) = 3 (append 97) = 397 = prime
>(2^3-1) = 7 (append 97) = 797 = prime
>(2^4-1) =15 (append 97) = 1597 = prime
>(2^5-1) =31 (append 97) = 3197 = no prime
>(2^6-1) =63 (append 97) = 6397 = prime
>etc.
>Sorry about that mistake!
>Dan
The Mersenne numbers for all (n) odd
or even with a 97 appended has (21) primes
for the first n = 1,2,3..,100 exponents
where the Mersenne primes only have (10)
for the first 25 prime exponents.
What is also interesting is 2^97-1 with
97 appended is prime.
Dan
.
- Follow-Ups:
- Re: Sandwich primes!
- From: Gerry Myerson
- Re: Sandwich primes!
- References:
- Sandwich primes!
- From: Dan
- Sandwich primes!
- Prev by Date: Re: Given the christoffel symbols (in differential geometry), can I solve for the metric
- Next by Date: Re: Quadratic extensions and squares
- Previous by thread: Re: Sandwich primes! Correction!
- Next by thread: Re: Sandwich primes!
- Index(es):
Relevant Pages
|
