Papers
Topics
Authors
Recent
Search
2000 character limit reached

Almost Repdigits in $ k-$generalized Lucas Sequences

Published 18 Jan 2023 in math.NT | (2301.07334v1)

Abstract: Let $ k \geq 2 $ and $ ( L_{n}{(k)} ){n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L{2-k}{(k)} = \cdots = L_{-1}{(k)}=0 ,$ $ L_{0}{(k,}=2,$ $ L_{1}{(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.