Multiplicative independence in the sequence of k-generalized Lucas numbers

Abstract

Let (Ln(k))n≥ 2-k be the sequence of k-generalized Lucas numbers for some fixed integer k 2, whose first k terms are 0,\;…\;,\;0,\;2,\;1 and each term afterward is the sum of the preceding k terms. In this paper, we find all pairs of the k-generalized Lucas numbers that are multiplicatively dependent.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…