English

Arithmetic properties of generalized Fibonacci sequences

Number Theory 2014-07-31 v1

Abstract

The generalized Fibonacci sequences are sequences {fn}\{f_n\} which satisfy the recurrence fn(s,t)=sfn1(s,t)+tfn2(s,t)f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t) (s,tZs, t \in \mathbb{Z}) with initial conditions f0(s,t)=0f_0(s, t) = 0 and f1(s,t)=1f_1(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 pp-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 nn 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 nn is an odd prime. Finally, we study the distribution of the rank over different values of ss when t=1t = -1 and suggest directions for further study involving the rank modulo prime powers of generalized Fibonacci sequences.

Keywords

Cite

@article{arxiv.1407.8086,
  title  = {Arithmetic properties of generalized Fibonacci sequences},
  author = {Soohyun Park},
  journal= {arXiv preprint arXiv:1407.8086},
  year   = {2014}
}

Comments

16 pages

R2 v1 2026-06-22T05:16:46.498Z