 #jsDisabledContent { display:none; } My Account | Register | Help Flag as Inappropriate This article will be permanently flagged as inappropriate and made unaccessible to everyone. Are you certain this article is inappropriate?          Excessive Violence          Sexual Content          Political / Social Email this Article Email Address:

# Heegner number

Article Id: WHEBN0000522147
Reproduction Date:

 Title: Heegner number Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

### Heegner number

In number theory, a Heegner number is a square-free positive integer d such that the imaginary quadratic field Q(d) has class number 1. Equivalently, its ring of integers has unique factorization.

The determination of such numbers is a special case of the class number problem, and they underlie several striking results in number theory.

According to the Stark–Heegner theorem there are precisely nine Heegner numbers:

1, 2, 3, 7, 11, 19, 43, 67, 163. (sequence A003173 in OEIS)

This result was conjectured by Gauss and proven by Kurt Heegner in 1952.

## Contents

• Euler's prime-generating polynomial 1
• Almost integers and Ramanujan's constant 2
• Detail 2.1
• Pi formulas 3
• Other Heegner numbers 4
• Consecutive primes 5
• Notes and references 6

## Euler's prime-generating polynomial

Euler's prime-generating polynomial

n^2 - n + 41, \,

which gives (distinct) primes for n = 1, ..., 40, is related to the Heegner number 163 = 4 · 41 − 1.

Euler's formula, with n taking the values 1,... 40 is equivalent to

n^2 + n + 41, \,

with n taking the values 0,... 39, and Rabinowitz proved that

n^2 + n + p \,

gives primes for n=0,\dots,p-2 if and only if its discriminant 1-4p equals minus a Heegner number.

(Note that p-1 yields p^2, so p-2 is maximal.) 1, 2, and 3 are not of the required form, so the Heegner numbers that work are 7, 11, 19, 43, 67, 163, yielding prime generating functions of Euler's form for 2,3,5,11,17,41; these latter numbers are called lucky numbers of Euler by F. Le Lionnais.

## Almost integers and Ramanujan's constant

Ramanujan's constant is the transcendental number e^{\pi \sqrt{163}}, which is an almost integer, in that it is very close to an integer:

e^{\pi \sqrt{163}} = 262\,537\,412\,640\,768\,743.999\,999\,999\,999\,25...  \approx 640\,320^3+744.

This number was discovered in 1859 by the mathematician Charles Hermite. In a 1975 April Fool article in Scientific American magazine, "Mathematical Games" columnist Martin Gardner made the (hoax) claim that the number was in fact an integer, and that the Indian mathematical genius Srinivasa Ramanujan had predicted it—hence its name.

This coincidence is explained by complex multiplication and the q-expansion of the j-invariant.

### Detail

Briefly, j((1+\sqrt{-d})/2) is an integer for d a Heegner number, and e^{\pi \sqrt{d}} \approx -j((1+\sqrt{-d})/2) + 744 via the q-expansion.

If \tau is a quadratic irrational, then the j-invariant is an algebraic integer of degree |\mbox{Cl}(\mathbf{Q}(\tau))|, the class number of \mathbf{Q}(\tau) and the minimal (monic integral) polynomial it satisfies is called the Hilbert class polynomial. Thus if the imaginary quadratic extension \mathbf{Q}(\tau) has class number 1 (so d is a Heegner number), the j-invariant is an integer.

The q-expansion of j, with its Fourier series expansion written as a Laurent series in terms of q=\exp(2 \pi i \tau), begins as:

j(q) = \frac{1}{q} + 744 + 196\,884 q + \cdots.

The coefficients c_n asymptotically grow as \ln(c_n) \sim 4\pi \sqrt{n} + O(\ln(n)), and the low order coefficients grow more slowly than 200\,000^n, so for q \ll 1/200\,000, j is very well approximated by its first two terms. Setting \tau = (1+\sqrt{-163})/2 yields q=-\exp(-\pi \sqrt{163}) or equivalently, \frac{1}{q}=-\exp(\pi \sqrt{163}). Now j((1+\sqrt{-163})/2)=(-640\,320)^3, so,

(-640\,320)^3=-e^{\pi \sqrt{163}}+744+O\left(e^{-\pi \sqrt{163}}\right).

Or,

e^{\pi \sqrt{163}}=640\,320^3+744+O\left(e^{-\pi \sqrt{163}}\right)

where the linear term of the error is,

-196\,884/e^{\pi \sqrt{163}} \approx 196\,884/(640\,320^3+744) \approx -0.000\,000\,000\,000\,75

explaining why e^{\pi \sqrt{163}} is within approximately the above of being an integer.

## Pi formulas

The Chudnovsky brothers found in 1987,

\frac{1}{\pi} = \frac{12}{640\,320^{3/2}} \sum_{k=0}^\infty \frac{(6k)! (163 \cdot 3\,344\,418k + 13\,591\,409)}{(3k)!(k!)^3 (-640\,320)^{3k}}

and uses the fact that j\big(\tfrac{1+\sqrt{-163}}{2}\big) = -640\,320^3. For similar formulas, see the Ramanujan–Sato series.

## Other Heegner numbers

For the four largest Heegner numbers, the approximations one obtains are as follows.

\begin{align} e^{\pi \sqrt{19}} &\approx 96^3+744-0.22\\ e^{\pi \sqrt{43}} &\approx 960^3+744-0.000\,22\\ e^{\pi \sqrt{67}} &\approx 5\,280^3+744-0.000\,0013\\ e^{\pi \sqrt{163}} &\approx 640\,320^3+744-0.000\,000\,000\,000\,75 \end{align}

Alternatively,

\begin{align} e^{\pi \sqrt{19}} &\approx 12^3(3^2-1)^3+744-0.22\\ e^{\pi \sqrt{43}} &\approx 12^3(9^2-1)^3+744-0.000\,22\\ e^{\pi \sqrt{67}} &\approx 12^3(21^2-1)^3+744-0.000\,0013\\ e^{\pi \sqrt{163}} &\approx 12^3(231^2-1)^3+744-0.000\,000\,000\,000\,75 \end{align}

where the reason for the squares is due to certain Eisenstein series. For Heegner numbers d < 19, one does not obtain an almost integer; even d = 19 is not noteworthy. The integer j-invariants are highly factorisable, which follows from the 12^3(n^2-1)^3=(2^2\cdot 3 \cdot (n-1) \cdot (n+1))^3 form, and factor as,

\begin{align} j((1+\sqrt{-19})/2) &= 96^3 =(2^5 \cdot 3)^3\\ j((1+\sqrt{-43})/2) &= 960^3=(2^6 \cdot 3 \cdot 5)^3\\ j((1+\sqrt{-67})/2) & =5\,280^3=(2^5 \cdot 3 \cdot 5 \cdot 11)^3\\ j((1+\sqrt{-163})/2) &=640\,320^3=(2^6 \cdot 3 \cdot 5 \cdot 23 \cdot 29)^3. \end{align}

These transcendental numbers, in addition to being closely approximated by integers, (which are simply algebraic numbers of degree 1), can also be closely approximated by algebraic numbers of degree 3,

\begin{align} e^{\pi \sqrt{19}} &\approx x^{24}-24; x^3-2x-2=0\\ e^{\pi \sqrt{43}} &\approx x^{24}-24; x^3-2x^2-2=0\\ e^{\pi \sqrt{67}} &\approx x^{24}-24; x^3-2x^2-2x-2=0\\ e^{\pi \sqrt{163}} &\approx x^{24}-24; x^3-6x^2+4x-2=0 \end{align}

The roots of the cubics can be exactly given by quotients of the Dedekind eta function η(τ), a modular function involving a 24th root, and which explains the 24 in the approximation. In addition, they can also be closely approximated by algebraic numbers of degree 4,

\begin{align} e^{\pi \sqrt{19}} &\approx 3^5 \left(3-\sqrt{2(-3+1\sqrt{3\cdot19})} \right)^{-2}-12.000\,06\dots\\ e^{\pi \sqrt{43}} &\approx 3^5 \left(9-\sqrt{2(-39+7\sqrt{3\cdot43})} \right)^{-2}-12.000\,000\,061\dots\\ e^{\pi \sqrt{67}} &\approx 3^5 \left(21-\sqrt{2(-219+31\sqrt{3\cdot67})} \right)^{-2}-12.000\,000\,000\,36\dots\\ e^{\pi \sqrt{163}} &\approx 3^5 \left(231-\sqrt{2(-26\,679+2\,413\sqrt{3\cdot163})} \right)^{-2}-12.000\,000\,000\,000\,000\,21\dots \end{align}

Note the reappearance of the integers n = 3, 9, 21, 231 as well as the fact that,

\begin{align} &2^6 \cdot 3(-3^2+3 \cdot 19 \cdot 1^2) = 96^2\\ &2^6 \cdot 3(-39^2+3 \cdot 43 \cdot 7^2) = 960^2\\ &2^6 \cdot 3(-219^2+3 \cdot 67 \cdot 31^2) = 5\,280^2\\ &2^6 \cdot 3(-26679^2+3 \cdot 163 \cdot 2413^2) = 640\,320^2 \end{align}

which, with the appropriate fractional power, are precisely the j-invariants. As well as for algebraic numbers of degree 6,

\begin{align} e^{\pi \sqrt{19}} &\approx (5x)^3-6.000\,010\dots\\ e^{\pi \sqrt{43}} &\approx (5x)^3-6.000\,000\,010\dots\\ e^{\pi \sqrt{67}} &\approx (5x)^3-6.000\,000\,000\,061\dots\\ e^{\pi \sqrt{163}} &\approx (5x)^3-6.000\,000\,000\,000\,000\,034\dots \end{align}

where the xs are given respectively by the appropriate root of the sextic equations,

\begin{align} &5x^6-96x^5-10x^3+1=0\\ &5x^6-960x^5-10x^3+1=0\\ &5x^6-5\,280x^5-10x^3+1=0\\ &5x^6-640\,320x^5-10x^3+1=0 \end{align}

with the j-invariants appearing again. These sextics are not only algebraic, they are also solvable in radicals as they factor into two cubics over the extension \mathbb{Q}\sqrt{5} (with the first factoring further into two quadratics). These algebraic approximations can be exactly expressed in terms of Dedekind eta quotients. As an example, let \tau = (1+\sqrt{-163})/2, then,

\begin{align} e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/24} \eta(\tau)}{\eta(2\tau)} \right)^{24}-24.000\,000\,000\,000\,001\,05\dots\\ e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/12} \eta(\tau)}{\eta(3\tau)} \right)^{12}-12.000\,000\,000\,000\,000\,21\dots\\ e^{\pi \sqrt{163}} &= \left( \frac{e^{\pi i/6} \eta(\tau)}{\eta(5\tau)} \right)^{6}-6.000\,000\,000\,000\,000\,034\dots \end{align}

where the eta quotients are the algebraic numbers given above.

## Consecutive primes

Given an odd prime p, if one computes k^2 \pmod{p} for k=0,1,\dots,(p-1)/2 (this is sufficient because (p-k)^2\equiv k^2 \pmod{p}), one gets consecutive composites, followed by consecutive primes, if and only if p is a Heegner number.

For details, see "Quadratic Polynomials Producing Consecutive Distinct Primes and Class Groups of Complex Quadratic Fields" by Richard Mollin.

## Notes and references

1. ^
2. ^ Rabinowitz, G. "Eindeutigkeit der Zerlegung in Primzahlfaktoren in quadratischen Zahlkörpern." Proc. Fifth Internat. Congress Math. (Cambridge) 1, 418–421, 1913.
3. ^ Le Lionnais, F. Les nombres remarquables. Paris: Hermann, pp. 88 and 144, 1983.
4. ^ Weisstein, Eric W., "Transcendental Number", MathWorld. gives e^{\pi\sqrt{d}}, d \in Z^*, based on Nesterenko, Yu. V. "On Algebraic Independence of the Components of Solutions of a System of Linear Differential Equations." Izv. Akad. Nauk SSSR, Ser. Mat. 38, 495–512, 1974. English translation in Math. USSR 8, 501–518, 1974.
5. ^ Ramanujan Constant – from Wolfram MathWorld
6. ^ Barrow, John D (2002). The Constants of Nature. London: Jonathan Cape.
7. ^ Gardner, Martin (April 1975). "Mathematical Games". Scientific American (Scientific American, Inc) 232 (4): 127.
8. ^ These can be checked by computing \sqrt{e^{\pi\sqrt{d}}-744} on a calculator, and 196\,884/e^{\pi\sqrt{d}} for the linear term of the error.