Extension of the Equation Σj=1kjFjp=Fnq to a Family of Lucas Sequences

Abstract

We solve the equation Σj=1kjUj(x,y)p=Un(x,y)q positive integers x,p,q,k,n, with y=1 and \p,q\≤11, where Um(x,y)=αm-βmα-β for α and β roots of the polynomial t2-xt+y. This generalizes existing results on similar equations, wherein the sequence was fixed as either the Fibonacci or Pell numbers. In addition, we find all solutions with k=2 and y=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.

Discussion (0)

Sign in to join the discussion.

Loading comments…