A summation formula involving Fibonacci digits (Q1066172): Difference between revisions

Let \(\{F_ j\}\) be the Fibonacci numbers, and expand every integer \(n\geq 0\) as \(n=\sum_{k}a_ k(n) F_ k\), where each \(a_ k(n)\) is either zero or one, and \(a_ k(n) a_{k+1}(n)=0\) for all k. Let \(s(n)=\sum_{k}a_ k(n)\) and \(S(N)=\sum_{n\leq N}s(n)\). The authors establish the asymptotic formula \[ S(N)=C N \log N+N G(c_ 1 \log N)+o(\log N), \] where C and \(c_ 1\) are explicitly given constants, and G is shown to be continuous and nowhere differentiable; furthermore, it is periodic with period one. A similar result is known for sums of q-adic digits of the integers, when q itself is an integer.