Skip to main content

Part of the book series: Graduate Texts in Mathematics ((GTM,volume 97))

  • 1807 Accesses

Abstract

At the end of the last chapter, we used reduction modulo p to find some useful information about the elliptic curves E n : y2 = x3n2x and the congruent number problem. We considered E n as a curve over the prime field \({{\mathbb{F}}_{p}} \) where \( p\nmid 2n \) used the easily proved equality \( \# {{E}_{n}}({{\mathbb{F}}_{p}}) = p + 1 \) when p = 3 (mod 4); and, by making use of infinitely many such p, were able to conclude that the only rational points of finite order on E n are the four obvious points of order two. This then reduced the congruent number problem to the determination of whether r, the rank of \( {{E}_{n}}(\mathbb{Q}) \), is zero or greater than zero

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Koblitz, N. (1984). The Hasse—Weil L-Function of an Elliptic Curve. In: Introduction to Elliptic Curves and Modular Forms. Graduate Texts in Mathematics, vol 97. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0255-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-0255-1_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4684-0257-5

  • Online ISBN: 978-1-4684-0255-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics