On a modification of the Lucas primality test

DOI10.1134/s1995080223070193OpenAlexW4388000982MaRDI QIDQ6059293

Sh. T. Ishmukhametov, N. Antonov, B. G. Mubarakov

Publication date: 2 November 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223070193

zbMATH Keywords

probabilistic algorithmsFibonacci seriesprimality provingpseudoprimesMiller-Rabin primality testLucas algorithmWall-Sun-Sun hypothesis

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Factorization; primality (11A51) Primality (11Y11)

Cites Work

• Unnamed Item
• Probabilistic algorithm for testing primality
• Primality testing with Gaussian periods
• PRIMES is in P
• On the number of primality witnesses of composite integers
• A new primality test for natural integers
• An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach
• Frobenius pseudoprimes
• Strong pseudoprimes to twelve prime bases
• Strong pseudoprimes to the first eight prime bases
• On Strong Pseudoprimes to Several Bases
• On a combined primality test

This page was built for publication: On a modification of the Lucas primality test