Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)
From MaRDI portal
Publication:1692331
DOI10.1007/s00605-017-1121-3zbMath1440.11041arXiv1604.04720OpenAlexW2964300449MaRDI QIDQ1692331
Publication date: 26 January 2018
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04720
Computer solution of Diophantine equations (11Y50) Exponential Diophantine equations (11D61) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (10)
ON SOLUTIONS OF THE DIOPHANTINE EQUATION ⋮ Sums of \(S\)-units in sum of terms of recurrence sequences ⋮ On a variant of Pillai’s problem with binary recurrences and S-units ⋮ On the nonnegative integer solutions to the equation \(F_n \pm F_m = y^a\) ⋮ ON SOLUTIONS OF THE DIOPHANTINE EQUATION Fn1 + Fn2 + Fn3 + Fn4 = 2^a ⋮ On prime factors of the sum of two k-Fibonacci numbers ⋮ Linear combinations of prime powers in sums of terms of binary recurrence sequences ⋮ On solutions of the Diophantine equation \(F_n-F_m=3^a\) ⋮ Nonnegative integer solutions of the equationFn ⋮ Prime powers in sums of terms of binary recurrence sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(p\)-adic logarithmic forms and a problem of Erdős
- Solving exponential diophantine equations using lattice basis reduction algorithms
- On the sum of powers of two consecutive Fibonacci numbers
- Factoring polynomials with rational coefficients
- Effective lower bound for the \(p\)-adic distance between powers of algebraic numbers
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. II
- Linear combinations of prime powers in binary recurrence sequences
- Products of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
- p-adic logarithmic forms and group varieties II
- Arithmetical study of recurrence sequences
- On The diophantine equationFn+Fm=2a
- Powers of two as sums of two k-Fibonacci numbers
- On two theorems of Gelfond and some of their applications
- THE EQUATIONS 3x2−2 = y2 AND 8x2−7 = z2
This page was built for publication: Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\)