Editing Primality test (section)

=== Baillie–PSW primality test ===
The [[Baillie–PSW primality test]] is a probabilistic primality test that combines a Fermat or Miller–Rabin test with a [[Lucas pseudoprime|Lucas probable prime]] test to get a primality test that has no known counterexamples. That is, there are no known composite ''n'' for which this test reports that ''n'' is probably prime.<ref name="lpsp">{{cite journal |last1=Baillie |first1=Robert |last2=Wagstaff |first2=Samuel S. Jr. |author2-link=Samuel S. Wagstaff Jr. |date=October 1980 |title=Lucas Pseudoprimes |journal=Mathematics of Computation |volume=35 |issue=152 |pages=1391–1417 |url=https://mpqs.free.fr/LucasPseudoprimes.pdf |mr=583518 |doi=10.1090/S0025-5718-1980-0583518-6 |doi-access=free}}</ref><ref name=bpsw2>{{cite journal |last1=Baillie |first1=Robert |last2=Fiori |first2=Andrew |last3=Wagstaff |first3=Samuel S. Jr. |author3-link=Samuel S. Wagstaff Jr. |date=July 2021 |title=Strengthening the Baillie-PSW Primality Test |journal=Mathematics of Computation |volume=90 |issue=330 |pages=1931–1955 |doi=10.1090/mcom/3616 |arxiv=2006.14425 |s2cid=220055722}}</ref> It has been shown that there are no counterexamples for ''n'' <math> < 2^{64}</math>.