From: "bhelmes_1" <bhelmes@...
> A beautifull evening,
> i have found a fast test to prove, if p of a certain kind is a prime
> number or not. The test needs only one Fermat-test.
> I hope that you will enjoy it:
> Please let me know, if the test is well proved.
You do not prove this:
If a^[(p-1)/3]=x mod p or a^[(p-1)/3]=x^2 mod p, then there are exactly (p-1)/2
There are, AFAIK, no known pseudoprimes that would fail your test,
but that's true about pseudoprimes on most non-linear functions.
That doesn't mean they don't exist though.
() ASCII ribbon campaign () Hopeless ribbon campaign
/\ against HTML mail /\ against gratuitous bloodshed
[stolen with permission from Daniel B. Cristofani]
Start your day with Yahoo! - Make it your home page!