Common terms of generalized Pell and Narayana's cows sequences

Abstract

For an integer k ≥ 2, let \ Pn(k) \n be the k-generalized Pell sequence which starts with 0, …,0,1(k terms) and each term afterwards is the sum of k preceding terms. In this paper, we find all the solutions of the Diophantine equation Pn(k) = Nm in non-negative integers (n, k, m) with k ≥ 2, where \ Nm \m is the Narayana's cows sequence. Our approach utilizes the lower bounds for linear forms in logarithms of algebraic numbers established by Matveev, along with key insights from the theory of continued fractions.

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…