Smallest Fermat Pseudoprime to Bases 2, 3, 5 and 7
Jump to navigation
Jump to search
Theorem
The smallest Fermat pseudoprime to bases $2$, $3$, $5$ and $7$ is $29 \, 341$.
Proof
 | This theorem requires a proof. In particular: We have the list of Poulet numbers and Fermat pseudoprimes base $3$, but not of bases $5$ and $7$. Once we get those lists, we can find the numbers on the lists 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
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $29,351$