Arithmetic properties of generalized Fibonacci sequences

Abstract

The generalized Fibonacci sequences are sequences \fn\ which satisfy the recurrence fn(s, t) = sfn - 1(s, t) + tfn - 2(s, t) (s, t ∈ Z) with initial conditions f0(s, t) = 0 and f1(s, t) = 1. In a recent paper, Amdeberhan, Chen, Moll, and Sagan considered some arithmetic properites of the generalized Fibonacci sequence. Specifically, they considered the behavior of analogues of the p-adic valuation and the Riemann zeta function. In this paper, we resolve some conjectures which they raised relating to these topics. We also consider the rank modulo n in more depth and find an interpretation of the rank in terms of the order of an element in the multiplicative group of a finite field when n is an odd prime. Finally, we study the distribution of the rank over different values of s when t = -1 and suggest directions for further study involving the rank modulo prime powers of generalized Fibonacci sequences.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…