The digital root function for Fibonacci-type sequences

Publication Type:
Journal Article
Advanced Studies in Contemporary Mathematics (Kyungshang), 2011, 21 (3), pp. 251 - 254
Issue Date:
Filename Description Size
Thumbnail2011003552OK.pdf125.08 kB
Adobe PDF
Full metadata record
The base of digit roots of elements of a sequence of numbers is defined, with examples given for the Fibonacci, Lucas, Lucas-Lehmer and Euler sequences. The theory is then applied to extensions of the Pell-Padovan and Tribonacci sequences.
Please use this identifier to cite or link to this item: