Solving exponential diophantine equations using lattice basis reduction algorithms

From MaRDI portal
Publication:579297

DOI10.1016/0022-314X(87)90088-6zbMath0625.10013MaRDI QIDQ579297

Benjamin M. M. de Weger

Publication date: 1987

Published in: Journal of Number Theory (Search for Journal in Brave)




Related Items

On the OesterlĂ©-Masser conjecture, ON THE DIOPHANTINE EQUATION, On the generalized Pillai equation \(\pm a^{x}\pm b^{y}=c\), Matrix decompositions using displacement rank and classes of commutative matrix algebras, Solving norm form equations via lattice basis reduction, Irreducibility of generalized Laguerre polynomials $L_n^{(1/2+u)}(x^2)$ with $-18 \leq u \leq -2$, On the practical solution of the Thue equation, On a variant of Pillai's problem involving \(S\)-units and Fibonacci numbers, Algorithms for Finding Good Examples for the abc and Szpiro Conjectures, Matrix displacement decompositions and applications to Toeplitz linear systems, S-integral points on elliptic curves, Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture, On a variant of Pillai’s problem with binary recurrences and S-units, Effective resolution of Diophantine equations of the form \(u_n+u_m=w p_1^{z_1} \dotsm p_s^{z_s}\), On a variant of Pillai's problem with factorials and \(S\)-units, Small Two-Variable Exponential Diophantine Equations, Sums of Fibonacci numbers that are perfect powers, Pell and Pell-Lucas numbers of the form \(x^a\pm x^b+1\), Smooth solutions to the \(abc\) equation: the \(xyz\) conjecture, Computing integral points on genus 2 curves estimating hyperelliptic logarithms, On \(p^x-q^y=c\) and related three term exponential Diophantine equations with prime bases., On Fermat's quadruple equations, Finding all \(S\)-Diophantine quadruples for a fixed set of primes \(S\), Exponential diophantine equations with four terms, On distribution of solutions of \(S\)-unit equations, Geodesic continued fractions and LLL, Primitive Divisors of Lucas and Lehmer Sequences, Factoring polynomials and the knapsack problem, Computing All Elliptic Curves Over an Arbitrary Number Field with Prescribed Primes of Bad Reduction, The Solution of Triangularly Connected Decomposable Form Equations, Symplectic Lattice Reduction and NTRU, LLL: A Tool for Effective Diophantine Approximation, An exponential Diophantine equation related to the sum of powers of two consecutive terms of a Lucas sequence and \(x\)-coordinates of Pell equations, The weighted sum of two S-units being a square, Difference between powers and squares of integers, LLL \(\and\) ABC, Irreducibility of extensions of Laguerre polynomials, Gaps between integers with the same prime factors, Polynomials with prescribed bad primes, Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction, On a variant of an identity relating cubes of three consecutive Fibonacci numbers, Pillai's conjecture revisited.



Cites Work