Re: Towards a Formula for Primes



In article <1178470327.759065.292100@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
"charleswehner@xxxxxxxxxxx" <charleswehner@xxxxxxxxxxx> wrote:

Perhaps within this concept lurks the narrow gateway - the key - to
entering into the solving of the problem of finding a test of, or
formula for, primes.

The problem of finding a test for primes was solved by Euclid.

The problem of finding an *efficient* test for primes, well,
that one is still open - but I'd be more confident of your chances
if I thought you knew anything about the progress that has been
made on that problem over the last two thousand years, and
especially over the last 25 years or so. Are you familiar with,
say, the Adleman-Pomerance-Rumely-Cohen-Lenstra method?
Do you know how good it is? Do you have any reason to believe
that your concept will lead to anything better?

--
Gerry Myerson (gerry@xxxxxxxxxxxxxxx) (i -> u for email)
.



Relevant Pages

  • Re: Towards a Formula for Primes
    ... > entering into the solving of the problem of finding a test of, ... The problem of finding a test for primes was solved by Euclid. ... "Home taping is killing big business profits. ...
    (sci.math)
  • Re: Factoring question
    ... now have a system of equations in two unknowns - namely n = pq ... or one of eight cases not the product of two primes. ... enough to find p and q (even though factoring is slower than solving a ...
    (sci.math)
  • Re: integer points on hyperbola
    ... Gerry Myerson wrote: ... we can ask for the "expected" number of primes. ... That turns out to be infinite but very slowly growing. ... A sequence of smallish numbers is much more likely to contain ...
    (sci.math)
  • Re: twin prime conjecture
    ... I was enjoying it. ... The argument on twin primes depends on viewing twin primes as two ... Gerry Myerson ...
    (sci.math)
  • Re: Towards a Formula for Primes
    ... On May 7, 6:26 pm, Gerry Myerson ... You say your concept may be the key to finding a test for primes. ... There is no trick to producing new primes. ... Every number in this sequence "delivers" a new prime. ...
    (sci.math)