A LLT-like test for proving the primality of Fermat numbers

2007/05/24 by Tony Reix, Reix, Tony
Mathematics · #01A55 #01A60 (Secondary) #11A51 #11B39 (Primary) 11-03 #FOS: Mathematics #History and Overview (math.HO) #Number Theory (math.NT) #math.HO #math.NT #msc:01A55 #msc:01A60 #msc:11-03 #msc:11A51 #msc:11B39

paper · pdf · doi:10.48550/arxiv.0705.3664

11 pages

arxiv created 2007/05/24 · arxiv updated 2009/12/01

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.

Related

• A new characterization of prime Fermat's numbers
• Primality tests for Fermat numbers and 2^(2k+1)±2^(k+1)+1
• Primality Tests and Prime Certificate
• A Modification of LLR
• An Extension to Fermat's Factorisation and a simple primality test