Results 1  10
of
13
Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers
 Annals of Math
"... Abstract. This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general ..."
Abstract

Cited by 37 (12 self)
 Add to MetaCart
Abstract. This is the second in a series of papers where we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we use a general and powerful new lower bound for linear forms in three logarithms, together with a combination of classical, elementary and substantially improved modular methods to solve completely the LebesgueNagell equation for D in the range 1 ≤ D ≤ 100. x 2 + D = y n, x, y integers, n ≥ 3, 1.
THE BRAUERMANIN OBSTRUCTION FOR INTEGRAL POINTS ON CURVES
"... We discuss the question of whether the BrauerManin obstruction is the only obstruction to the Hasse principle for integral points on affine hyperbolic curves. In the case of rational curves we conjecture a positive answer, we prove that this conjecture can be given several equivalent formulations ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We discuss the question of whether the BrauerManin obstruction is the only obstruction to the Hasse principle for integral points on affine hyperbolic curves. In the case of rational curves we conjecture a positive answer, we prove that this conjecture can be given several equivalent formulations and relate it to an old conjecture of Skolem. We show that the case of elliptic curves minus at least three points reduces to the case of rational curves. Finally, we show that for elliptic curves minus one point the question has a negative answer.
Computing All Integer Solutions of a Genus 1 Equation
"... The Elliptic Logarithm Method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 defining elliptic curves. We extend this method to include any equation f(u, v) = 0, where f Z[u, v] is irreducible over Q, defines a curve of genus 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The Elliptic Logarithm Method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 defining elliptic curves. We extend this method to include any equation f(u, v) = 0, where f Z[u, v] is irreducible over Q, defines a curve of genus 1, but is otherwise of arbitrary shape and degree. We give a detailed description of the general features of our approach, and conclude with two rather unusual examples corresponding to equations of degree 5 and degree 9. 1991 Mathematics subject classification: 11D41, 11G05 Key words and phrases: diophantine equation, elliptic curve, elliptic logarithm # Econometric Institute, Erasmus University, P.O.Box 1738, 3000 DR Rotterdam, The Netherlands; email: stroeker@few.eur.nl; homepage: http://www.few.eur.nl/few/people/stroeker/ + Department of Mathematics, University of Crete, Iraklion, Greece; email: tzanakis@math.uch.gr; homepage: http://www.math.uoc.gr/tzanakis 1
Computing All Integer Solutions of a General Elliptic Equation
, 2000
"... The Elliptic Logarithm Method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 dening elliptic curves. We explore the possibility of extending this method to include any equation f(u; v) = 0, where f 2 Z[u;v] denes an irreducible cu ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
The Elliptic Logarithm Method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 dening elliptic curves. We explore the possibility of extending this method to include any equation f(u; v) = 0, where f 2 Z[u;v] denes an irreducible curve of genus 1, independent of shape or degree of the polynomial f . We give a detailed description of the general features of our approach, putting forward along the way some claims (one of which conjectural) that are supported by the explicit examples added at the end. 1
Minimisation and Reduction of 2, 3 and 4coverings of elliptic curves
, 2009
"... In this paper we consider models for genus one curves of degree n for n = 2, 3 and 4, which arise in explicit ndescent on elliptic curves. We prove theorems on the existence of minimal models with the same invariants as the minimal model of the Jacobian elliptic curve and provide simple algorithms ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper we consider models for genus one curves of degree n for n = 2, 3 and 4, which arise in explicit ndescent on elliptic curves. We prove theorems on the existence of minimal models with the same invariants as the minimal model of the Jacobian elliptic curve and provide simple algorithms for minimising a given model, valid over general number fields. Finally, for genus one models defined over Q, we develop a theory of reduction and again give explicit algorithms for n = 2, 3 and 4.
SIMATH  a computer algebra system for number theoretic applications
"... this paper is to give a survey of the wide range of number theoretic applications of the computer algebra system SIMATH [42] ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper is to give a survey of the wide range of number theoretic applications of the computer algebra system SIMATH [42]
The Diophantine Equation b²X^4  dY² = 1
, 1999
"... If b and d are given positive integers with b>1, then we show that the equation of the title possesses at most one solution in positive integers X, Y. Moreover, we give an explicit characterization of this solution, when it exists, in terms of fundamental units of associated quadratic fields. Th ..."
Abstract
 Add to MetaCart
If b and d are given positive integers with b>1, then we show that the equation of the title possesses at most one solution in positive integers X, Y. Moreover, we give an explicit characterization of this solution, when it exists, in terms of fundamental units of associated quadratic fields. The proof utilizes estimates for linear forms in logarithms of algebraic numbers in conjunction with properties of Pellian equations and the Jacobi symbol and explicit determination of the integer points on certain elliptic curves.
NOTE ON J.H.E. COHN’S PAPER ”THE DIOPHANTINE EQUATION x n = Dy 2 + 1”
"... A classical problem of the theory of diophantine equations is to find the solutions of (1) x n = Dy 2 + 1 ..."
Abstract
 Add to MetaCart
A classical problem of the theory of diophantine equations is to find the solutions of (1) x n = Dy 2 + 1