Congruent number

Congruent number

In mathematics, a congruent number is a positive integer that is the area of a right triangle with three rational number sides.[1] A more general definition includes all positive rational numbers with this property.[2]

The sequence of integer congruent numbers starts with

5, 6, 7, 13, 14, 15, 20, 21, 22, 23, 24, 28, 29, 30, 31, 34, 37, 38, 39, 41, 45, 46, 47, … (sequence A003273 in OEIS)

For example, 5 is a congruent number because it is the area of a 20/3, 3/2, 41/6 triangle. Similarly, 6 is a congruent number because it is the area of a 3,4,5 triangle. 3 is not a congruent number.

If q is a congruent number then s2q is also a congruent number for any rational number s (just by multiplying each side of the triangle by s). This leads to the observation that whether a nonzero rational number q is a congruent number depends only on its residue in the group

\mathbb{Q}^{*}/\mathbb{Q}^{*2}.

Every residue class in this group contains exactly one square free integer, and it is common, therefore, only to consider square free positive integers, when speaking about congruent numbers.

Contents

Congruent number problem

The question of determining whether a given rational number is a congruent number is called the congruent number problem. This problem has not (as of 2009) been brought to a successful resolution. Tunnell's theorem provides an easily testable criterion for determining whether a number is congruent; but his result relies on the Birch and Swinnerton-Dyer conjecture, which is still unproven.

Fermat's right triangle theorem, named after Pierre de Fermat, states that no square number can be a congruent number.

Relation to elliptic curves

The question of whether a given number is congruent turns out to be equivalent to the condition that a certain elliptic curve has positive rank.[2] An alternative approach to the idea is presented below (as can essentially also be found in the introduction to Tunnell's paper).

Suppose a,b,c are numbers (not necessarily positive or rational) which satisfy the following two equations:


	\begin{matrix}
		a^2 + b^2 &=& c^2\\
		\frac{ab}{2} &=& n.
	\end{matrix}

Then set x = n(a+c)/b and y = 2n2(a+c)/b2. A calculation shows


	y^2 = x^3 -n^2x
	\,\!

and y is not 0 (if y = 0 then a = -c, so b = 0, but (1/2)ab = n is nonzero, a contradiction).

Conversely, if x and y are numbers which satisfy the above equation and y is not 0, set a = (x2 - n2)/y, b = 2nx/y, and c = (x2 + n2)/y . A calculation shows these three numbers satisfy the two equations for a, b, and c above.

These two correspondences between (a,b,c) and (x,y) are inverses of each other, so we have a one-to-one correspondence between any solution of the two equations in a, b, and c and any solution of the equation in x and y with y nonzero. In particular, from the formulas in the two correspondences, for rational n we see that a, b, and c are rational if and only if the corresponding x and y are rational, and vice versa. (We also have that a, b, and c are all positive if and only if x and y are all positive; notice from the equation y2 = x3 - xn2 = x(x2 - n2) that if x and y are positive then x2 - n2 must be positive, so the formula for a above is positive.)

Thus a positive rational number n is congruent if and only if the equation y2 = x3 - n2x has a rational point with y not equal to 0. It can be shown (as a nice application of Dirichlet's theorem on primes in arithmetic progression) that the only torsion points on this elliptic curve are those with y equal to 0, hence the existence of a rational point with y nonzero is equivalent to saying the elliptic curve has positive rank.

Current progress

Much work has been done classifying congruent numbers.

For example, it is known[3] that if p is a prime number then

  • if p ≡ 3 (mod 8), then p is not a congruent number, but 2p is a congruent number.
  • if p ≡ 5 (mod 8), then p is a congruent number.
  • if p ≡ 7 (mod 8), then p and 2p are congruent numbers.

References

  1. ^ Weisstein, Eric W., "Congruent Number" from MathWorld.
  2. ^ a b Koblitz, Neal (1993). Introduction to Elliptic Curves and Modular Forms. New York: Springer-Verlag. p. 3. ISBN 0-387-97966-2. 
  3. ^ Paul Monsky (1990). "Mock Heegner Points and Congruent Numbers". Mathematische Zeitschrift 204 (1): 45–67. doi:10.1007/BF02570859. 

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

  • number theory — Math. the study of integers and their relation to one another. Also called theory of numbers. [1910 15] * * * Branch of mathematics concerned with properties of and relations among integers. It is a popular subject among amateur mathematicians… …   Universalium

  • 6 (number) — This article is about the mathematical number. For other uses, see 6 (disambiguation). 6 −1 0 1 2 3 4 5 6 7 8 9 → List of numbers Integers …   Wikipedia

  • 5 (number) — This article discusses the number five. For the year 5 AD, see 5. For other uses of 5, see 5 (disambiguation). 5 −1 0 1 2 3 4 5 6 7 8 9 → List of numbers Integers …   Wikipedia

  • List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

  • Perfect number — In number theory, a perfect number is a positive integer that is equal to the sum of its proper positive divisors, that is, the sum of its positive divisors excluding the number itself (also known as its aliquot sum). Equivalently, a perfect… …   Wikipedia

  • Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”