On Wagstaff primes in the k-Lucas number sequence
Abstract
A Wagstaff prime is a prime number of the form (2p+1)/3, where p is an odd prime. Let (Ln(k))n≥ 2-k be the k-Lucas number sequence defined by the recurrence relation Ln(k) = Ln-1(k) + ·s + Ln-k(k), for all n 2, with initial terms \( L0(k) = 2 \) and \( L1(k) = 1 \) for all \( k 2 \), and \( L2-k(k) = ·s = L-1(k) = 0 \) for \( k 3 \). In this paper, we show that the only solutions to the Diophantine equation Ln(k) = (2p+1)/3 are (n,k,p)∈\(5,2,5),(6,4,7)\ \(2,k,3):k 2\. We use linear forms in logarithms and the LLL reduction method to prove our result.
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.