Smallest Sequence of 5 Consecutive Numbers which are Happy
Jump to navigation
Jump to search
Theorem
The smallest sequence of $5$ consecutive integers all of which are happy numbers is:
- $44 \, 488, 44 \, 489, 44 \, 490, 44 \, 491, 44 \, 492$
Proof
 | This theorem requires a proof. In particular: Exhaustive enumeration? I'm afraid recreational mathematics of this kind bores me. 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): $44,488$