![]() |
![]() |
#1 |
Feb 2004
France
24×59 Posts |
![]()
Hi,
I have built the proof of 2 new Primality tests for Fermat numbers. (Don't expect them to reduce the time needed by the Pepin' test ...) Why posting a test for Fermat numbers here ? Because it is a first step in a more global work I'm working on dealing with Lucas Sequences. I hope I will be able in the future to provide new useful theorems (and probably new conjectures) dealing with Mersenne and Fermat numbers. Think about my guess at the end of the document, dealing with what I call "fixed point". I've asked xyzzy (administrator) to host my document (.pdf) and to provide the link in this thread. Just wait xyzzy is available. Thanks xyzzy. Let me know if my proof is correct ... Tony |
![]() |
![]() |
![]() |
#2 |
Feb 2004
France
24×59 Posts |
![]()
Hi, Finally, the .pdf file is attached to this post. Tony
|
![]() |
![]() |
![]() |
#3 |
Feb 2004
France
24·59 Posts |
![]()
Hi,
I've done 3 small modifications: 1) page 1 in the introduction: I say this also proves the Pepin's Test, with k=3 . 2) page 2 I've replaced the use of Pepin's test by the Euler congruence for quadratic residues. 3) page 4 I show that the Theorem 1 does prove the Pepin's test for k=3 . Tony |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Pépin tests of Fermat numbers beyond F24 | ewmayer | Computer Science & Computational Number Theory | 89 | 2023-06-02 22:21 |
Use Pepin's Tests for proving primality of Mersenne numbers ? | T.Rex | Math | 12 | 2016-04-03 22:27 |
What are the Primality Tests ( not factoring! ) for Fermat Numbers? | Erasmus | Math | 46 | 2014-08-08 20:05 |
Proof of Primality Test for Fermat Numbers | princeps | Math | 15 | 2012-04-02 21:49 |
The fastest primality test for Fermat numbers. | Arkadiusz | Math | 6 | 2011-04-05 19:39 |