본문 바로가기
KERD
논문KCI 등재

The digital root function for Fibonacci-type sequences

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

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.

Abstract

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.

참고문헌 (8)

  1. Atanassov,K.T, "An arithmetic function and some of its applications", Bulletin of Number Theory and Related Topics, 9(1), pp.18~27 (1985)
  2. Atanassov K.T, "A digit sum arithmetical function", Bulletin of Number Theory and Related Topics, 11(1), pp.37~49 (1987)
  3. Dence,Joseph B, "Elements of the Theory of Numbers", pp.83~155 (1999), Academic Press
  4. Gardiner,A, "Digital Roots,Rings and Clock Arithmetic", The Mathematical Gazette, 66(437), pp.184~188 (1982)
  5. Shannon A.G, "Generalized staggered sums", The Fibonacci Quarterly, 29(1), pp.47~51 (1991)
  6. Shannon,A.G, "Some Properties of Generalized Third Order Pell Numbers", 2008. 13th International Conference on Fibonacci Numbers and Their Applications (2008), University of Patras
  7. Shannon,A.G, "The Auxiliary Equation Associated with the Plastic Number", Notes on Number Theory & Discrete Mathematics, 12(1), pp.1~12 (2006)
  8. Shannon, A.G, "Properties of Cordonnier, Perrin and Van der Laan Numbers", International Journal of Mathematical Education in Science & Technology, 37(7), pp.825~831

관련 논문AI추천

이 간행물의 다른 논문 (12건)