Re: Frobenius, so good?!

From: Mike Amling (nospam_at_nospam.com)
Date: 12/30/04

  • Next message: Mok-Kong Shen: "Help needed for a sorting code in the literature" 
    Date: Thu, 30 Dec 2004 17:23:13 GMT

    Cristiano wrote:
    > I tested many small numbers (<2^32) and many 512 to 1024-bit numbers using
    > the frobenius test
    > http://cs-people.bu.edu/coldfury/frobenius.c
    > with 1 iteration.
    > I still haven't seen a single failure.
    > I'm happy of that, but it seems a bit strange because it is said that the
    > probability of error in declaring a number "prime" is less than 1/7710, so,
    > occasionally, I should see a failure.
    > Do I miss something?

       It doesn't say how much less than 1/7710. It could be much less than
    1/7710.

    --Mike Amling

  • Next message: Mok-Kong Shen: "Help needed for a sorting code in the literature"
    • Quantcast