Tunnell's theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description In number theory, Tunnell's theorem gives a partial resolution to the congruent number problem, and under the Birch and Swinnerton-Dyer conjecture, a full resolution.

Congruent number problem

Script error: No such module "Labelled list hatnote". The congruent number problem asks which positive integers can be the area of a right triangle with all three sides rational. Tunnell's theorem relates this to the number of integral solutions of a few fairly simple Diophantine equations.

Theorem

For a given square-free integer n, define

An=#{(x,y,z)3n=2x2+y2+32z2},Bn=#{(x,y,z)3n=2x2+y2+8z2},Cn=#{(x,y,z)3n=8x2+2y2+64z2},Dn=#{(x,y,z)3n=8x2+2y2+16z2}.

Tunnell's theorem states that supposing n is a congruent number, if n is odd then 2An = Bn and if n is even then 2Cn = Dn. Conversely, if the Birch and Swinnerton-Dyer conjecture holds true for elliptic curves of the form y2=x3n2x, these equalities are sufficient to conclude that n is a congruent number.

History

The theorem is named for Jerrold B. Tunnell, a number theorist at Rutgers University, who proved it in Template:Harvtxt.

Importance

The importance of Tunnell's theorem is that the criterion it gives is testable by a finite calculation. For instance, for a given n, the numbers An,Bn,Cn,Dn can be calculated by exhaustively searching through x,y,z in the range n,,n.

See also

References

  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".