Abstract
Let be the sequence of k-Fibonacci numbers recursively defined by and m be a fixed positive integer. In this work we prove that, for almost every x ϵ (0,1), the pattern k, k,..., k (comprising of m-digits) appears in the continued fraction expansion x = [0; a1,a2,. ..] with frequency where where
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
