## Experimental Mathematics

- Experiment. Math.
- Volume 16, Issue 3 (2007), 303-312.

### Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes

J. E. Cremona and M. P. Lingham

#### Abstract

We describe an algorithm for determining elliptic curves defined over a given number field with a given set of primes of bad reduction. Examples are given over $\Q$ and over various quadratic fields.

#### Article information

**Source**

Experiment. Math., Volume 16, Issue 3 (2007), 303-312.

**Dates**

First available in Project Euclid: 7 March 2008

**Permanent link to this document**

https://projecteuclid.org/euclid.em/1204928531

**Mathematical Reviews number (MathSciNet)**

MR2367320

**Zentralblatt MATH identifier**

1149.11028

**Subjects**

Primary: 11G05: Elliptic curves over global fields [See also 14H52] 11Y50: Computer solution of Diophantine equations

**Keywords**

Elliptic curves Diophantine equations

#### Citation

Cremona, J. E.; Lingham, M. P. Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes. Experiment. Math. 16 (2007), no. 3, 303--312. https://projecteuclid.org/euclid.em/1204928531