Algorithms for Finding Good Examples for the abc and Szpiro Conjectures
Nitaj, Abderrahmane; Nitaj, Abderrahmane; Departernent de Mathematiques, Universite de Caen
Журнал:
Experimental Mathematics
Дата:
1993
Аннотация:
The radical rad n of an integer n ≠ 0 is the product of the primes dividing n. The abc-conjecture and the Szpiro conjecture imply that, for any positive relatively prime integers a, b, and e such that a + b = c, the expressionsare bounded. We give an algorithm for finding triples (a, b, c) for which these ratios are high with respectto their conjectured asymptotic values. The algorithm is based on approximation methods for solving the equation Ax <sup> n </sup> – By <sup> n </sup> = C <sub> z </sub> in integers x, y, and z with srnall |z|.Additionally, we employ these triples to obtain semistable elliptic curves over Q with high Szpiro ratiowhere Δ is the discriminant and N is the conductor.
3.315Мб