A LLT-like test for proving the primality of Fermat numbers
Tony Reix
TL;DR
This paper introduces a new primality test for Fermat numbers inspired by LLT, utilizing Lucas Sequences and Lehmer's method to establish a more effective proof technique.
Contribution
It presents a novel LLT-like primality test specifically designed for Fermat numbers, combining Lucas Sequences with Lehmer's approach.
Findings
The test successfully proves the primality of certain Fermat numbers.
It offers a new method that could improve efficiency over existing tests.
The approach bridges classical number theory with modern primality testing techniques.
Abstract
This paper provides a proof of a LLT-like test for Fermat numbers, based on the properties of Lucas Sequences and on the method of Lehmer.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Chaos-based Image/Signal Encryption · History and Theory of Mathematics