Smallest Fermat Pseudoprime to Bases 2, 3 and 5
Jump to navigation
Jump to search
Theorem
The smallest Fermat pseudoprime to bases $2$, $3$ and $5$ is $1729$.
Proof
This theorem requires a proof. In particular: We have the list of Poulet numbers and Fermat pseudoprimes base $3$, but not of base $5$. Once we get that list, we can find the numbers on the list for both. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Sources
- July 1980: Carl Pomerance, J.L. Selfridge and Samuel S. Wagstaff, Jr.: The Pseudoprimes to $25 \cdot 10^9$ (Math. Comp. Vol. 35, no. 151: pp. 1003 – 1026) www.jstor.org/stable/2006210
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $1729$