Non-Integral Value of Göbel's Sequence

Theorem

Consider Göbel's sequence defined recursively as:

$x_n = \begin{cases}

1 & : n = 0 \\ \ds \paren {1 + \sum_{k \mathop = 0}^{n - 1} {x_k}^2} / n & : n > 0 \end{cases}$


The smallest $n$ such that $x_n$ is not an integer is $43$.


Proof


This theorem requires a proof.
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

  • 1994: Richard K. Guy: Unsolved Problems in Number Theory (2nd ed.)
  • 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $43$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.