Re: Prime Candidates
From: Dan (30pack_at_sbcglobal.net)
Date: 06/24/04
- Next message: Martin: "Calculating Curvature"
- Previous message: flip: "Re: a simple number theory problem"
- Maybe in reply to: vernonner3voltazim: "Prime Candidates"
- Next in thread: Gerry Myerson: "Re: Prime Candidates"
- Reply: Gerry Myerson: "Re: Prime Candidates"
- Reply: Robert Israel: "Re: Prime Candidates"
- Messages sorted by: [ date ] [ thread ]
Date: Thu, 24 Jun 2004 06:20:31 +0000 (UTC)
On 23 Jun 2004, Dave Rusin wrote:
>In article <200406230121.i5N1LwY29575@proapp.mathforum.org>,
>Dan <30pack@sbcglobal.net> wrote:
>
>>Just add and keep repeating this sequence ---->oo
>>
>>7+
>> 4+2+4+2+4+6+2+6
>> +4+2+4+2+4+6+2+6
>> +4+2+4+2+4+6+2+6
>> +4.. etc.
>>
>>At any point of these summations of integers, they are either prime
>>or have prime factors =>7.
>
>Too complicated! Just add and keep repeating THIS sequence:
>41+
> 2+4+6+8+10+... etc.
>At any point of these summations of integers, they are prime.
>
>dave
>
>
>
Not snaging many primes in this range 41-41^2 (40 primes)
This range has 251 primes counting 41,
40/251 = about 16% hit rate. Not to hot! ;-)
Is 40 primes the largest known record of this type before
failing @ 41^2?
Dan
- Next message: Martin: "Calculating Curvature"
- Previous message: flip: "Re: a simple number theory problem"
- Maybe in reply to: vernonner3voltazim: "Prime Candidates"
- Next in thread: Gerry Myerson: "Re: Prime Candidates"
- Reply: Gerry Myerson: "Re: Prime Candidates"
- Reply: Robert Israel: "Re: Prime Candidates"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|