On the Oesterlé-Masser conjecture

DOI10.1007/BF01294603zbMath0597.10042WikidataQ55967376 ScholiaQ55967376MaRDI QIDQ1078600

Robert Tijdeman, Cameron L. Stewart

Publication date: 1986

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178303

zbMATH Keywords

linear forms in logarithms; prime numbers

Mathematics Subject Classification ID

11J81: Transcendence (general theory)

11N05: Distribution of primes

Related Items

On $abc$ and discriminants, Smooth solutions to the \(abc\) equation: the \(xyz\) conjecture, Solving exponential diophantine equations using lattice basis reduction algorithms, The ABC conjecture implies Vojta's height inequality for curves, Modular forms and effective Diophantine approximation, Effectiveness of Siegel's theorem and the abc conjecture, Lower bounds for numbers of \(ABC\)-hits, On the \(abc\) conjecture, A lower bound in the \(abc\) conjecture, \(abc\) triples, Elliptic logarithms, diophantine approximation and the Birch and Swinnerton-Dyer conjecture, ABC implies the radicalized Vojta height inequality for curves, The exceptional set in Vojta’s conjecture for algebraic points of bounded degree, A refinement of theabcconjecture, Squarefree values of trinomial discriminants, Lecture on the abc Conjecture and Some of Its Consequences

Cites Work

• Solving exponential diophantine equations using lattice basis reduction algorithms
• Finiteness theorems for abelian varieties over number fields.
• The n -th Prime is Greater than n logn
• Unnamed Item
• Unnamed Item