Extension of the equation ^k_j=1 j F_j^p = F_n^p to a family of Lucas sequences

MaRDI QIDQ6604038FDOQ6604038

Authors: Simon Earp-Lynch, Omar Kihel, P. Pongsumpun 

Publication date: 12 September 2024

Published in: The Fibonacci Quarterly (Search for Journal in Brave)

Recommendations

• 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\)

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Exponential Diophantine equations (11D61)

Cites Work

• On a conjecture of Schäffer concerning the equation \(1^k + \ldots + x^k = y^n\)
• Existence of primitive divisors of Lucas and Lehmer numbers (with an appendix by M. Mignotte)
• Title not available (Why is that?)
• On the Diophantine equation $1^k+2^k+\dotsb+x^k=y^n$
• The equation \(1^p+2^p+3^p+\ldots+n^p=m^q\)
• On the equation \(\sum_{j = 1}^k j F_j^p = F_n^q\)
• The \(p\)-adic valuation of Lucas sequences
• On a Diophantine equation involving powers of Fibonacci numbers
• 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\)
• The Diophantine equation \(\sum_{j=1}^k jF_j^p=L_n^q\)
• Integer Sequences

Cited In (1)

• 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}\)

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)