Elliptic Diophantine equations. A concrete approach via the elliptic logarithm
From MaRDI portal
Publication:357892
zbMath1311.11023MaRDI QIDQ357892
Publication date: 14 August 2013
Published in: De Gruyter Series in Discrete Mathematics and Applications (Search for Journal in Brave)
Elliptic curves over global fields (11G05) Computer solution of Diophantine equations (11Y50) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Cubic and quartic Diophantine equations (11D25) Higher degree equations; Fermat's equation (11D41)
Related Items (6)
Diophantine equations coming from binomial near-collisions ⋮ Hilbert’s Proof of His Irreducibility Theorem ⋮ Solving 𝑆-unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via the Shimura–Taniyama Conjecture ⋮ On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\) ⋮ Three consecutive almost squares ⋮ Unnamed Item
Uses Software
This page was built for publication: Elliptic Diophantine equations. A concrete approach via the elliptic logarithm
