Re: interview question on primes

On Feb 25, 8:13 pm, "1787" <nob...@xxxxxxxx> wrote:
The useful answer then would
be to suggest algorithms that will actually find the primes for values of A
and B appropriate to their absolute and relative magnitudes.


Can you explain this approach or give me a URL for
further reference?

.

Relevant Pages

  • Re: interview question on primes
    ... and B appropriate to their absolute and relative magnitudes. ... components of actually finding the desired primes. ... be as insightful to an interviewer as the answers he or she provides. ... pseudo-prime checking function with brute force used only for checking ...
    (sci.math)
  • Re: SF: Back to theory
    ... >> f and g are generated exactly the same way in the algorithms that try ... Let T = the product of the primes in S. ... variety of prime factors, this one stuffs a variety of primes into T ... algorithm beat random-gcd 456 of 561 factoring cases ...
    (sci.math)
  • Re: Factoring problem and the SFT
    ... you and Nora _both_ lying to James about this, ... of 20-bit primes, and toward the end cut that to 15-bit primes as the ... algorithms got ever more expensive to try). ... The set of all integers divisible by 101 is infinite. ...
    (sci.math)
  • Re: SF: Back to theory
    ... >> f and g are generated exactly the same way in the algorithms that try ... Let T = the product of the primes in S. ... variety of prime factors, this one stuffs a variety of primes into T ... algorithm beat random-gcd 456 of 561 factoring cases ...
    (sci.crypt)
  • Re: Confusing performance results for prime
    ... > various data structures to cache primes and the like. ... > If you want to test primality quickly, using the sieve of erotosthenes ... > better is to use Miller-Rabin pseudoprimality tests (well, ... understand algorithms. ...
    (comp.lang.python)
Loading