On the Shorey-Tijdeman Diophantine equation involving terms of Lucas sequences
Abstract
Let r 1 be an integer and U:=\Un\n 0 be the Lucas sequence given by U0=0,~U1=1, and Un+2=rUn+1+Un for n 0. In this paper, we explain how to find all the solutions of the Diophantine equation, AUn+BUm=CUn1+DUm1, in integers r 1, 0 m<n,~0 m1<n1, AUn CUn1, where A,B,C,D are given integers with A 0,~B 0, m,n,m1,n1 are nonnegative integer unknowns and r is also unknown.
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.