Re: The "little dead man" theorem

On Sat, 2006-09-02 at 13:26 -0700, vincent64@xxxxxxxxx wrote:
JeffCameron wrote:
Hmm... that is interesting. Do you think that finding the zeros will
be easy to do? I expect that trying to find the zeros of g will turn
out to be equivalent to some known unsolved problem.

Jeff Cameron

Maybe there is an iterative algorithm that, given a seed or starting
point x, would be able to find the prime number (that is root of g(z))
closest to x. The algorithm might no be practical to find all primes,
but possibly of some use to identify very large primes.

The question is, would it be more efficient to factor 10**20
consecutive numbers near 10**23 to (maybe!) identify a prime near
10**23, or use the iterative algorithm in question with seed = 10**23.

Definitely the latter.
You could just use trial division on oodles of numbers near 10^23.
It would take a little while.

Alternatively, there a number of existing algorithms which will
determine primality for numbers of the order of 10^23 rather swiftly.

10^23 is not considered "large".

--
Jeremy Boden


.

Relevant Pages

  • Re: The "little dead man" theorem
    ... I expect that trying to find the zeros of g will turn ... out to be equivalent to some known unsolved problem. ... Maybe there is an iterative algorithm that, ... even thought it is a continuous function, it has quite a wild behavior ...
    (sci.math)
  • Re: The "little dead man" theorem
    ... Hmm... ... I expect that trying to find the zeros of g will turn ... out to be equivalent to some known unsolved problem. ... Jeff Cameron ...
    (sci.math)
  • Re: Need Ideas!!
    ... The Remez exchange algorithm allows minimax solutions to approximation ... Digital filter design is one of the applications. ... the stop band (so all the zeros in the stop band are double zeros). ...
    (comp.dsp)
  • Re: DES.CreateEncryptor() Question
    ... half your key will be zeros for most string ... You can check the BlockSize property on the base algorithm ... On the other hand, if you want to create keys from password strings, rather ... like the RandomNumberGenerator class (both these classes are also in the ...
    (microsoft.public.dotnet.languages.vb)
  • Re: Algorithm to determine matrix similarity
    ... then an algorithm to find such an S would be an algorithm to ... is a well known unsolved problem. ... That the efficient graph isomorphism problem is unsolved ... reasonable time 400K little graphs up to isomorphism. ...
    (sci.math)