On generalized Thabit numbers (p+1)pa-1 in the k-Lucas sequence
Abstract
Let k 2 and \Ln(k)\n≥ 2-k be the sequence of k-Lucas numbers whose first k terms are 0,…,0,2,1 and each term afterwards is the sum of the preceding k terms. In this paper, we solve the Diophantine equation Ln(k)=(p+1)pa-1, for a Mersenne or Fermat prime p=2 1, and positive integers n 2, k 2, a 1 and 1.
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.