Extension of the equation ^k_j=1 j F_j^p = F_n^p to a family of Lucas sequences
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.
- Solutions of some Diophantine equations in terms of generalized Fibonacci and Lucas numbers
- The complete solution of the Diophantine equation \(\left(F_{n+1}^{(k)}\right)^x - \left(F_{n-1}^{(k)}\right)^x = F_m^{(k)}\)
- The Diophantine equation \(\sum_{j=1}^k jF_j^p=L_n^q\)
- On the solutions of the Lucas sequence equation \(\pm\frac{1}{V_n(P_2, Q_2)} = \sum_{k=1}^\infty\frac{U_{k-1}(P_1,Q_1)}{x^k}\)
- On generalized Fibonacci and Lucas numbers of the form \(wkx^{2} \pm 1\)
- Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
- scientific article; zbMATH DE number 1992399 (Why is no real title available?)
- Integer Sequences
- On a conjecture of Schäffer concerning the equation \(1^k + \ldots + x^k = y^n\)
- On a Diophantine equation involving powers of Fibonacci numbers
- On the Diophantine equation $1^k+2^k+\dotsb+x^k=y^n$
- On the Diophantine equation \(\sum_{j=1}^kjF_j^p=F_n^q\).
- On the Diophantine equation \(\sum_{j=1}^kjP_j^p=P_n^q\)
- On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)
- The p-adic valuation of Lucas sequences
- The Diophantine equation \(\sum_{j=1}^k jF_j^p=L_n^q\)
- The equation \(1^p+2^p+3^p+\ldots+n^p=m^q\)
This page was built for publication: Extension of the equation \(\sum^k_{j=1} j F_j^p = F_n^p\) to a family of Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604038)
