2000 character limit reached
Multiplicative independence in the sequence of $k$-generalized Lucas numbers
Published 23 Nov 2023 in math.NT | (2311.14001v1)
Abstract: Let $(L_n{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.