Page 1

Displaying 1 – 6 of 6

Showing per page

Searching for Diophantine quintuples

Mihai Cipu, Tim Trudgian (2016)

Acta Arithmetica

We consider Diophantine quintuples a, b, c, d, e. These are sets of positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we improve on current estimates to show that there are at most 5 . 441 · 10 26 Diophantine quintuples.

Siegel’s theorem and the Shafarevich conjecture

Aaron Levin (2012)

Journal de Théorie des Nombres de Bordeaux

It is known that in the case of hyperelliptic curves the Shafarevich conjecture can be made effective, i.e., for any number field k and any finite set of places S of k , one can effectively compute the set of isomorphism classes of hyperelliptic curves over k with good reduction outside S . We show here that an extension of this result to an effective Shafarevich conjecture for Jacobians of hyperelliptic curves of genus g would imply an effective version of Siegel’s theorem for integral points on...

Smooth solutions to the a b c equation: the x y z Conjecture

Jeffrey C. Lagarias, Kannan Soundararajan (2011)

Journal de Théorie des Nombres de Bordeaux

This paper studies integer solutions to the a b c equation A + B + C = 0 in which none of A , B , C have a large prime factor. We set H ( A , B , C ) = max ( | A | , | B | , | C | ) , and consider primitive solutions ( gcd ( A , B , C ) = 1 ) having no prime factor larger than ( log H ( A , B , C ) ) κ , for a given finite κ . We show that the a b c Conjecture implies that for any fixed κ < 1 the equation has only finitely many primitive solutions. We also discuss a conditional result, showing that the Generalized Riemann hypothesis (GRH) implies that for any fixed κ > 8 the a b c equation has infinitely many primitive solutions....

Currently displaying 1 – 6 of 6

Page 1