scientific article; zbMATH DE number 3775617

From MaRDI portal
Publication:3955424





Let \(F_n\) and \(L_n\) be the \(n\)-th Fibonacci and Lucas number, respectively, and let \(k\) and \(\alpha\) be positive integers. The authors characterize, by numerical calculation, the fractions which can be approximated by sums \(\sum 10^{-k(i+1)} F_{\alpha,i}\). The forms of these fractions are a little difficult. Using Binet's formula, one can exactly prove that \[ \sum_{i=1}^n 10^{-k(i+1)} F_{\alpha,i} = F_\alpha/\left(10^{2k} - 10^k L_\alpha + (-1)^\alpha\right) \] if the sum is convergent, which is equivalent to the authors' result but it is less difficult.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3955424)