The Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)
type: Item
instance of: scholarly article
title: The Diophantine equations \(P_n^x+P_{n+1}^y=P_m^x\) or \(P_n^y+P_{n+1}^x=P_m^x\)
zbMATH Open document ID: 1517.11010
author: Bernadette Faye
author: Florian Luca
author: Salah Eddine Rihane
author: Alain Togbé
published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM
publication date: 2023-05-16T00:00:00Z
review text: Let \( (P_n)_{n\ge 0} \) be the Pell sequence defined by the binary recurrence relation: \( P_0=0 \), \( P_1=1 \), and \( P_{n+2}=2P_{n+1}+P_n \) for all \( n\ge 0 \). In the paper under review, the authors prove the following theorem, which is the main result in the paper. \textbf{Theorem 1.} The only solution in positive integers \( (n,m,x,y) \) of either the equations \[ P_n^{x}+P_{n+1}^{y}=P_m^{x}\text{ or }P_n^{y}+P_{n+1}^{x}=P_m^{x}, \] is \( (n,m,x,y)=(1,3,1,2) \), for which \( 1+2^2=5=P_3 \). The proof of Theorem 1 follows from a clever combination of techniques in Diophantine number theory, the usual properties of the Pell sequence, Carmichael's theorem on primitive divisors for Lucas sequences, Baker's theory for nonzero lower bounds for linear forms in logarithms of algebraic numbers, both complex and \(p\)-adic, reduction techniques involving the theory of continued fractions, as well as the LLL algorithm. All computations are done with the aid of a computer program in \texttt{Mathematica}.
reviewed by: Mahadi Ddamulira
Mathematics Subject Classification ID: 11B39
Mathematics Subject Classification ID: 11D99
Mathematics Subject Classification ID: 11J86
zbMATH DE Number: 7686519
zbMATH Keywords: Pell numbers
zbMATH Keywords: linear form in logarithms
zbMATH Keywords: reduction method
MaRDI profile type: MaRDI publication profile
cites work: Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
cites work: Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
cites work: Number Theory
cites work: Q5060324
cites work: Linear combinations of factorials and \(S\)-units in a binary recurrence sequence
cites work: On the Diophantine equation \(F_n^x+F_{n+1}^x=F_m^y\)
cites work: Linear forms in two logarithms and interpolation determinants
cites work: An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
cites work: On the sum of powers of two consecutive Fibonacci numbers
cites work: An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
cites work: Primary cyclotomic units and a proof of Catalans conjecture
cites work: On the exponential Diophantine equation Pxn+Pxn+1=Pm
DOI: 10.1007/S13398-023-01425-7
Recommended article: Q4359744
Recommended article: The Diophantine equation \(F_{n}^{y} + F_{n+1}^{x} = F_{m}^{x}\)
Recommended article: The Diophantine equation x(x+1)...(x+(m-1)) + r= yn
Recommended article: The Diophantine equation \(x_1^{x_1}x_2^{x_2}\dots x_k^{x^k}=y_k^{y_k}\) (I)
Recommended article: The diophantine equation $x^{2} + D^{m} = p^{n}$
Recommended article: Q4809332
Recommended article: The Diophantine equation \((m^2+n^2)^x+(2mn)^y=(m+n)^{2z}\)
Recommended article: Q4858921
Recommended article: The Diophantine equation $X(X + 1) = Y(Y^2 + 1)$.
Recommended article: The diophantine equation \(x^2+3^m=y^n\)
description: scientific article; zbMATH DE number 7686519