Conjecture on Euler liars and Carmichael or Sophie Germain pseudoprimes
Let be an odd squarefree composite integer, and let Euler liars in mean the elements satisfying the Euler probable-prime congruence . Euler-liar count conjecture. If has Euler liars in , then is a Carmichael number; and if it has Euler liars in , then is either a Carmichael number or a Sophie Germain pseudoprime. The claim proposes a classification of odd squarefree composites with especially many Euler liars; its resolution is left as future work in the source.
References
Primary source
Alejandra Alcantarilla Sánchez, Jolijn Cottaar, Tanja Lange and Benne de Weger, “Ours go to 211: Euler pseudoprimes to 47 prime bases (from Carmichael numbers)”, arXiv:2602.21840 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.