Extension of the equation \(\sum^k_{j=1} j F_j^p = F_n^p\) to a family of Lucas sequences (Q6604038)

From MaRDI portal





scientific article; zbMATH DE number 7912378
Language Label Description Also known as
default for all languages
No label defined
    English
    Extension of the equation \(\sum^k_{j=1} j F_j^p = F_n^p\) to a family of Lucas sequences
    scientific article; zbMATH DE number 7912378

      Statements

      0 references
      0 references
      0 references
      0 references
      12 September 2024
      0 references
      Let \( x \) and \( y \) be integers. Define the Lucas sequence of the first kind, \( \{U_n(x,y)\}_{n\in \mathbb{Z}} \) by the linear recurrence relation: \( U_0(x,y)=0 \), \( U_1(x,y)=1 \), and \( U_{n+1}(x,y)=xU_n(x,y)-yU_{n-1}(x,y) \) for all \( n\ge 1 \). In the paper under review, the authors prove the following theorem, which is the main result in the paper.\N\NTheorem. The only solutions to the Diophantine equation \( 1+2x^{p}=U_n(x,y)^{q} \) in positive integers \( n,p,q,x, \) and with \( y=\pm 1 \) are:\N\begin{align*}\N(n,p,q,x,y)=(4,p,1,1,-1), (1+2^{p+1}, p, 1,2,1), (3,2,2,2,1), (3,1,1,2,-1), ~ \text{and} ~ (5,3,1,3,1).\N\end{align*}\NMoreover, suppose that \( n,k, p,q,x \) are positive integers with \( \max\{p,q\}\le 11 \), \( k\ge 3 \), and that \( y=\pm 1 \), with \( x\ge 2 \) when \( y=-1 \) and \( x\ge 3 \) when \( y=1 \). Then, the Diophantine equation\N\begin{align*}\N\sum_{j=1}^{k}jU_j(x,y)^{p}=U_n(x,y)^{q},\N\end{align*}\Nhas no solutions.
      0 references

      Identifiers