On a problem of Pillai involving S-units and Lucas numbers
Abstract
Let \Ln\n≥ 0 be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation Ln-2x3y=c, for n,x,y∈ Z0. We treat the cases c∈ -N, c=0 and c∈ N independently. In the cases that c∈ N and c∈ -N, we find all integers c such that the Diophantine equation has at least three solutions. These cases are treated independently since we employ quite different techniques in proving the two cases.
0
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.