On the Diophantine equation P_m=P_n^x+P_n+1x with Padovan numbers
Let \( \{P_n\}_{n\ge 0} \) be the sequence of \textit{Padovan numbers} given by the three term linear recurrence: \( P_0=0, P_1=P_2=1 \), and \( P_{n+3}=P_{n+1}+P_{n} \) for all \( n\ge 0 \). In the paper under review, the authors study the Diophantine equation \[ P_m=P_n^{x}+P_{n+1}^{x}, \tag{1} \] in nonnegative integers \( (m,n,x) \). In their study, the authors first classify the solutions: \( (m,n,x)\in \{(3,0,x), (5,2,x), (5,n,0), (n+3,n,1)\} \) as the trivial solutions to the Diophantine equation (1). The nontrivial solutions are classified in the following theorem, which is the main result in the paper. Theorem 1. All nontrivial solutions of the Diophantine equation (1) in nonnegative integers \( (m,n,x) \) are: \( (m,n,x)\in \{(8,3,2), (10,3,3), (12,4,3), (17,3,6)\} \). The proof of Theorem 1 follows from a clever combination of techniques in Diophantine number theory, the usual properties of the Padovan sequence, the theory of nonzero lower bounds for linear forms in logarithms of algebraic numbers, as well as the reduction procedure involving the theory of continued fractions. All numerical computations are done with the aid of a computer program in \texttt{Mathematica}.
- Pillai's problem with Padovan numbers and powers of two
- Powers of two as sums of two Padovan numbers
- Fibonacci numbers as sums of two Padovan numbers
- Pillai's problem with the Fibonacci and Padovan sequences
- On an exponential Diophantine equation involving powers of consecutive terms of the Padovan sequence
- An explicit lower bound for a homogeneous rational linear form in logarithms of algebraic numbers. II
- An exponential Diophantine equation related to powers of two consecutive Fibonacci numbers
- An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers
- An exponential Diophantine equation related to the sum of powers of two consecutive k-generalized Fibonacci numbers
- Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
- scientific article; zbMATH DE number 3979149 (Why is no real title available?)
- scientific article; zbMATH DE number 1215558 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Linear combinations of factorials and S-units in a binary recurrence sequence
- On the exponential Diophantine equation Pxn+Pxn+1=Pm
- Powers of two as sums of two k-Fibonacci numbers
- Powers of two as sums of two Padovan numbers
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
- On the \(x\)-coordinates of Pell equations that are sums of two Padovan numbers
- Fibonacci numbers as sums of two Padovan numbers
- On an exponential Diophantine equation involving powers of consecutive terms of the Padovan sequence
- Pillai's problem with the Fibonacci and Padovan sequences
- Pillai's problem with Padovan numbers and powers of two
- On the problem of Pillai with Padovan numbers and powers of 3
- Powers of two as sums of two Padovan numbers
- Common values of Padovan and Perrin sequences
- Padovan squares which are again Padovan
- A Diophantine equation involving Padovan numbers
This page was built for publication: On the Diophantine equation \(P_m=P_n^x+P_{n+1}^x\) with Padovan numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116817)
