Re: Old question: looking for prime number list > 1,000,000

On 1 Jan 2006 10:32:10 -0800, "rich burge" <r3769@xxxxxxx> wrote:

>
>quasi wrote:
>> On 31 Dec 2005 15:00:47 -0800, "rich burge" <r3769@xxxxxxx> wrote:
>>
>> >
>> >Robert Israel wrote:
>> >> In article <1135797694.699111.277250@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
>> >> Christian Drewing <christian.drewing@xxxxxxxxxxxxxx> wrote:
>> >>
>> >> >I spent hours on Google but I couldnt find a list with prime numbers >
>> >> >1,000,000.
>> >> >So is there a list with all known prime numbers on the net? Clearly
>> >> >written, not in powers of 2.
>> >>
>> >> What counts as a "known" prime number? Is 156593416582327342765171
>> >> known? I guess it is now, but it wasn't 5 minutes ago.
>> >
>> >I would say the is prime above is "known" if one can produce the n s.t.
>> >p_n=156..171.
>>
>> I would guess that for the largest known primes p, the corresponding n
>> is not known, so requiring n to be known is a pretty strong
>> requirement.
>
>Yes. Certificates are better, I suppose.
>
>>
>> Besides, even if n is specified, how would you verify it without
>> listing all the primes up to and including p? Is there any known
>> algorithm, short of an exhaustive search, which for a given n, can
>> produce p_n?
>>
>
>For small enough n, yes. See:
>
>http://groups.google.com/group/sci.math/msg/86de57b5c6ef42a2?dmode=source
>
>Rich

Hmmm ...

It seems like you would need very, very acccurate bounds for pi(x).

I don't follow the idea exactly.

Also, what is Rosser-Schoenfeld?

quasi
.

Relevant Pages

  • Re: Old question: looking for prime number list > 1,000,000
    ... quasi wrote: ... >>Robert Israel wrote: ... > I would guess that for the largest known primes p, ... so requiring n to be known is a pretty strong ...
    (sci.math)
  • Re: Self Study problem help - Group theory
    ... How about using for generators where p ranges over all primes ... Is this subgroup proper? ... Prev by Date: ...
    (sci.math)
  • Re: Alternative Goldbach?
    ... >c) Comb Alt. ... Prev by Date: ...
    (sci.math)
  • Re: Prime Sums In A Grid
    ... quasi wrote: ... Phil has told you where he thinks you'll find an answer. ... Find a set of primes that sum to the n/2. ... Arrange the n*n integers so that they sum to the primes in 2. ...
    (sci.math)
  • Re: 3^n and primes
    ... this happens if m divides p or q. ... primes, but not necessarily primes. ... Actually m is an "Euler probable prime to base 3" if either ... Of the exceptions quasi found, the only one that doesn't correspond ...
    (sci.math)