p-Adic quotient sets: linear recurrence sequences
Abstract
Let (xn)n≥0 be a linear recurrence of order k≥2 satisfying xn=a1xn-1+a2xn-2+…+akxn-k for all integers n≥ k, where a1,…,ak,x0,…, xk-1∈ Z, with ak≠0. In [`The quotient set of k-generalised Fibonacci numbers is dense in Qp', Bull. Aust. Math. Soc. 96 (2017), 24-29], Sanna posed an open question to classify primes p for which the quotient set of (xn)n≥0 is dense in Qp. In this article, we find a sufficient condition for denseness of the quotient set of the kth-order linear recurrence (xn)n≥0 satisfying xn=a1xn-1+a2xn-2+…+akxn-k for all integers n≥ k with initial values x0=…=xk-2=0,xk-1=1, where a1,…,ak∈ Z and ak=1. We show that given a prime p, there exist infinitely many recurrence sequences of order k≥ 2 so that their quotient sets are not dense in Qp. We also study the quotient sets of linear recurrence sequences with coefficients in some arithmetic and geometric progressions.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.