A curious question recently crossed my mind. And that is can we construct decimal numbers of the form $$\text{"a.bcdefghij..."}$$ where each letter represents a digit $0-9$ (the number may or may not be rational) so that it equals a continued fraction of the form $$a+\cfrac{1}{b+\cfrac{1}{c+\cfrac{1}{d+\cfrac{1}{e+\ddots}}}}$$

For example I found that


Experimenting a bit, we see we can certainly construct infinitely many numbers that are close solutions, but how can we make them the most efficient? To clarify, we prefer not to go too deeply nested into the continued fraction to make the previous digits work, because then we have to make those new digits work. So some questions are:

~What algorithm will construct such numbers?
~Does that algorithm construct numbers that are “efficient” as described above? Is there one number that is the "most efficient"?
~Does an exact non-repeating rational example exist?

  • 2
    $\begingroup$ Duplicate unanswered question: math.stackexchange.com/q/2044747/527345. $\endgroup$ – noedne Apr 13 '18 at 3:43
  • 1
    $\begingroup$ zeros do usually not occur in a continued fraction, except in the first entry. Nevertheless, a good example. $\endgroup$ – Peter Apr 13 '18 at 13:28
  • $\begingroup$ Very interesting! $(+1)$ $\endgroup$ – Feeds Apr 13 '18 at 13:36
  • 1
    $\begingroup$ Trott Constant $\endgroup$ – Ed Pegg Jul 17 '18 at 15:39

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.