k-Pell-Lucas numbers as Product of Two Repdigits
Abstract
For any integer k ≥ 2, let \Qn(k) \n ≥ -(k-2) denote the k-generalized Pell-Lucas sequence which starts with 0, … ,2,2(k terms) where each next term is the sum of the k preceding terms. In this paper, we find all the k-generalized Pell-Lucas numbers that are the product of two repdigits. This generalizes a result of Erduvan and Keskin Erduvan1 regarding repdigits of Pell-Lucas numbers.
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.