The primary pretenders

DOI10.4064/AA-78-4-307-313zbMATH Open0863.11005arXivmath/0207180OpenAlexW2964274455WikidataQ64013269 ScholiaQ64013269MaRDI QIDQ4896091FDOQ4896091

Authors: Richard K. Guy, W. A. Schneeberger, N. J. A. Sloane, J. H. Conway 

Publication date: 21 November 1996

Published in: Acta Arithmetica (Search for Journal in Brave)

Abstract: We call a composite number q such that there exists a positive integer b with b^p == b (mod q) a prime pretender to base b. The least prime pretender to base b is the primary pretender q_b. It is shown that there are only 132 distinct primary pretenders, and that q_b is a periodic function of b whose period is the 122-digit number 19568584333460072587245340037736278982017213829337604336734362- 294738647777395483196097971852999259921329236506842360439300.

Full work available at URL: https://arxiv.org/abs/math/0207180

Recommendations

• Practical pretenders
• Prior's individuals
• On the primitives
• scientific article; zbMATH DE number 3882596
• The Powers That Be
• Almost primary ideals
• scientific article; zbMATH DE number 4108946
• THE PSEUDOPOWER DICHOTOMY
• scientific article; zbMATH DE number 92419

zbMATH Keywords

Carmichael numberspseudoprimesprimary pretendersprime pretenders

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Factorization; primality (11A51)

Cited In (4)

• Some thoughts on pseudoprimes
• Title not available (Why is that?)
• Practical pretenders
• The On-Line Encyclopedia of Integer Sequences

This page was built for publication: The primary pretenders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896091)