An algorithm of infinite sums representations and Tasoev continued fractions (Q5315438)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2203637
Language Label Description Also known as
default for all languages
No label defined
    English
    An algorithm of infinite sums representations and Tasoev continued fractions
    scientific article; zbMATH DE number 2203637

      Statements

      An algorithm of infinite sums representations and Tasoev continued fractions (English)
      0 references
      0 references
      8 September 2005
      0 references
      continued fractions
      0 references
      value of convergent continued fraction
      0 references
      An algorithm for converting a convergent continued fraction \[ \frac 1{a_1}\,{\quad\atop +}\,K_{k=2}^\infty\frac{\varepsilon_k}{a_k};\quad\varepsilon_k\in\{-1,1\},\quad a_k\in\mathbb N \] to a ratio of two convergent series is presented. The idea is to choose a series \(\sum_{n=0}^\infty c_n\). The algorithm then produces a series \(\sum_{n=0}^\infty c_n'\) so that \[ \frac 1{a_1}\,{\quad\atop +}\, K\,\frac {\varepsilon_k}{a_k}=\frac{\sum_{n=0}^\infty c_n'}{\sum_{n=0}^\infty c_n} \] when the two series converge. In fortunate cases a wise choice of \(\sum c_n\) gives a recognizable \(\sum c_n'\), and the value of the continued fraction is found explicitly. In some examples the author applies the algorithm to continued fractions of the form \[ [0;\,\overline{ur^k-1,\,1,\,vs^k-1}]_{k=1}^\infty], \quad [0;\,\overline{ur^{2k-1}-1,\,1,\,vs^{2k-1}-1,\,ur^{2k},\,vs^{2k}}]_{k=1}^\infty \] and related expressions.
      0 references

      Identifiers