too good to be true?
Today, someone added what appears to be a new primality test for Fermat numbers:
[url]http://mersennewiki.org/index.php?title=Fermat_numbers&diff=3931&oldid=3924[/url] Doesn't that sound a bit too good to be true? 
I think TRex of this forum has claimed a similar result. Approximately half of the possible polynomials for Lucas sequence proofs give N1 tests instead of N+1 tests. This is one such choice. It looks correct, but it's no faster than Pepin's test.

[QUOTE=ixfd64]Today, someone added what appears to be a new primality test for Fermat numbers:
[/QUOTE] I'm the same Robert Gerbicz, I've added my proof for this test. [QUOTE=John Renze]but it's no faster than Pepin's test.[/QUOTE] In fact, the speed of this test is equal to the speed of the Pepin's test. 
Aww, I was hoping that it would be much faster. :(

ignorant question: Can they be used together?

[quote=jasong]Can they be used together?[/quote]No, because though each requires the same number of squarings and thus the same computation time, they start with different numbers (Gerbicz's method starts with 5, while Pepin's test starts with 3) and their steps are not identical (Gerbicz's subtracts 2 at each step; Pepin's doesn't).

All times are UTC. The time now is 06:38. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2021, Jelsoft Enterprises Ltd.