 
 
 
 
 
 
 
  
 Next: The Naive Algorithms
 Up: Some Modular Degree and
 Previous: The Definitions
     Contents 
- 
 1984: ?? 1984: ??
- 1984: Don Zagier wrote the often-cited paper 
Modular parametrizations
of elliptic curves (1985), in which he gave an algorithm to compute
 (sometimes?).  The paper incluced (sometimes?).  The paper incluced
- A result of Ribet:
  
 Theorem  2.1 (Ribet)    
If    is prime, then 
  
 
 
- It also said
  
 
 
- 1998: Frey and Müller published a wonderful survey:
Arithmetic of modular curves and applications.  
  
- They ask:
  Question 4.4: Let  be an optimal quotient of any conductor.
  Does be an optimal quotient of any conductor.
  Does ? ?
- They remark that 
 and give two references
  [Ribet 83, Inventiones] and [Zagier 1985]. and give two references
  [Ribet 83, Inventiones] and [Zagier 1985].
 
 
- 1995: Cremona wrote a Math. Comp. paper, and computed
 for every curve of conductor for every curve of conductor , where , where is a few thousand. is a few thousand.
 
- 2001: Mark Watkins
 computed  for some curves with for some curves with HUGE, using an
algorithm he created from a formula of M. Flach.1 HUGE, using an
algorithm he created from a formula of M. Flach.1
 
William A Stein
2002-09-29