Almost Repdigits in k-generalized Lucas Sequences
Abstract
Let k ≥ 2 and ( Ln(k) )n ≥ 2-k be the k-generalized Lucas sequence with initial condition L2-k(k) = ·s = L-1(k)=0 , L0(k,=2, L1(k)=1 and each term afterwards is the sum of the k preceding terms. A positive integer is an almost repdigit if its digits are all equal except for at most one digit. In this paper, we work on the problem of determining all terms of k-generalized Lucas sequences which are almost repdigits. In particular, we find all k-generalized Lucas numbers which are powers of 10 as a special case of almost repdigits.
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.