 � 1 (1979) · pp.195–203

A PROOF THAT EULER MISSED...

Apéry's Proof of the Irrationality of ζ(3)

An Informal Report of Alfred van der Poorten

1. Journees Arithmetiques de Marseille–Luminy, June, 1978

The board of programme changes informed us that R. Apéry (Caen) would speak Thursday, 14:00 «Sur l'irrationalite de ζ(3)». Though there had been earlier rumours of his claiming a proof, scepticism was general. The lecture tended to strengthen this view to rank disbelief. Those who listened casually, or who were afflicted with being non-Francophone, appeared to hear only a sequence of unlikely assertions.

EXERCISE

Prove the following amazing claims:

1  For all a1, a2, ...
 ∞ ∑ a1a2 ... ak–1(x + a1)(x + a2) ... (x + ak) = 1 x . k=1
2

ζ(3) =    1

n3

=  5

2

 (–1)n–1 n3 ( 2nn )
.
n=1 n=1
(1)
3  Consider the recursion:
 n3un + (n – 1)3un–2 = (34n3 – 51n2 + 27n – 5)un–1,       n ≥ 2. (2)

Let {bn} be the sequence defined by b0 = 1, b1 = 5, and bn = un for all n; then the bn are integers! Let {an} be the sequence defined by a0 = 0, a1 = 6, an = un for all n; then the an are rational numbers with denominator dividing 2[1, 2, ..., n]3 (here [1, 2, ..., n] is the LCM (lowest common multiple) of 1, 2, ..., n).

4

an/bn → ζ(3); indeed the convergence is so fast as to prove that ζ(3) cannot be rational. To be precise, for all integers p, q with q sufficiently large relative to ε > 0
 ζ(3) – p q > 1 q12.417820... + ε .

Moreover, analogous claims were made for ζ(2):
2'

ζ(2) =    1

n2

=  π2

6

= 3
 1 n2 ( 2nn )
.
n=1 n=1
(3)
3'  Consider the recursion:
 n2un + (n – 1)2un–2 = (11n2 – 11n + 3)un–1,       n ≥ 2. (4)

Let {Bn} be the sequence defined by B0 = 1, B1 = 3, and Bn = un for all n; then the Bn all are integers! Let {An} be the sequence defined by A0 = 0, A1 = 5, an = un for all n; then the An are rational numbers with denominator dividing [1, 2, ..., n]2.

4'

An/Bn → ζ(2); indeed the convergence is so fast as to prove that ζ(2) cannot be rational. To be precise, for all integers p, q with q sufficiently large relative to ε > 0
 π2 – p q > 1 q11.850782... + ε .

I heard with some ineredulity that, for one, Henri Cohen (Grenoble) believed that these claims might well be valid. Very much intrigued, I joined Hendrik Lenstra (Amsterdam) and Cohen in an evening's discussion, in which Cohen explained and demonstrated most of the details of the proof. We came away convinced that Professor Apery had indeed found a quite miraculous and magnificent demonstration of the irrationality of ζ(2). But we remained unable to prove a critical step.

A number β is irrational if it is not of the form p0/q0; p0, q0 integers (ÎZ). A rational number b is characterised by the property that for p, qÎZ (q>0) and bp/q there exists an integer q0 (>0, of course) such that |bp/q| ≥ 1/qq0. On the other hand, for irrational β there are always infinitely many p/q (for instance, the convergents of the continued fraction expansion of β) such that |β – p/q| < 1/q2. Plainly this yields a criterion for irrationality. It there is a δ>0 and a sequence {pn/qn} of rational numbers such that pn/qn ≠ β and |β – pn/qn| < 1/qn1+δ, nÎN, then β is irrational.

A successful application of the criterion may yield a measure of irrationality: If |β – pn/qn| < 1/qn1+δ, and the qn are monotonic increasing with qn < qn–11+k (for n sufficiently large relative to k > 0), then for all integers p, q > 0 sufficiently large relative to ε > 0),

 β – p q < 1 q(1 + δ)/(δ – k) + ε .

For example, if the sequence {qn} increases geometrically we may take k > 0 arbitrary small so that 1 + 1/δ becomes an irrationality degree for β. To see the claim suppose that |β – p/q| ≤ 1/qσ and select n so that qn–11+δqσqn1+δ. Then

 1 qqn ≤ p q – pn qn ≤ β – pn qn + β – p q ≤ 1 qn1 + δ + 1 qσ < 2 qσ .

Hence ½qσqqn < qqn–1k+1 < qqn < q1+σ(1+k)/(1+δ) or σ < (1+δ)/(1+k) + ε as claimed. This argument is effective (the "sufficiently large" requirements can be made explicit).

It is well-known (the theorem Thue–Siegel–Roth) that for β algebraic (a zero of a polynomial a0Xn + a1Xn–1 + ... + an, aiÎZ) always |β – p/q| < 1/q2+ε, for q sufficiently large relative ε > 0. So, if β is too well approximable by rationals (δ > 1 above) then β is not algebraic, but transcendental. Unfortunately, only a set of measure zero of transcendental numbers can be detected in this way, whilst since the set of algebraic numbers is countable, almost all numbers are transcendental. It is notoriously difficult to prove that any given naturally occuring number is irrational, let alone transcendental. One may be fortunate: for example the usual series for e implies immediately (easy exercise) that e is irrational. In the case of the Riemann ζ-function:
 ∞ ζ(s) = ∑ 1 ns (Re s > 1) n=1

there is the quite well-known fact that
 ∞ ζ(2k) = ∑ 1 n2k = (–1)k–1(2π)2k2(2k)! B2k , kÎN, n=1
(5)

where the Bernoulli numbers, Bm, are rational (ζ(2) = π2/6, ζ(4) = π4/90, ζ(6) = π6/945, ...). There are some classical techniques (see ) for detecting the irrationality of powers of π, but it is most useful to appeal to the theorem of Hermite–Lindemann (whereby eα is transcendental for algebraic α ≠ 0) whence π is transcendental (because eπi = –1) and so a fortiori its powers are irrational, kÎN. On the other hand there are no useful analogous closed evaluations of ζ at odd arguments. There is however a famous formula of Ramanujan: let α and β be positive numbers such that αβ = π2. Then if n is any positive integer
 ( ∞ ) 1 αn ζ(2n+1)2 + ∑ 1 k2n+1(e2αk – 1) = k=1
 ( ∞ ) n+1 = (–1)n βn ζ(2n+1)2 + ∑ 1 k2n+1(e2βk – 1) – 22n ∑ (–1)k B2k(2k)! B2n+2–2k(2n+2–2k)! αn+1–kβk. k=1 k=0

Taking α rational multiple of π one sees that ζ(2n+1) is given as a rational multiple of π2n+1 plus two very rapidly convergent series. See for example . Indeed the above formula is the natural analogue of Euler's formula (5). The cited paper gives many others formulas and detailed references). Incidentally, (5) is demonstrated quite easily. The Bernoulli numbers are defined by the generating function (a nontrivial example of an even function!)
 ∞ z ez – 1 + z 2 = ∑ B2m(2m)! z2m, m=0

hence by the recursion

 ( n0 ) B0 + ( n1 ) B1 + ... + ( n n–1 ) Bn–1 = 0, B0 = 1,   B1 = – 12 , n = 3, 4, ... .

On the other hand it is well-known that
 ∞ sin πz = πz ∏ ( 1 – z2 n2 ) , n=1

so
 ∞ π sin πzcos πz = π ctg πz = 1 z – ∑ 2z n2 – z2 . n=1

But
 ∞ π ctg πz = πiz eπiz + e–πizeπiz – e–πiz = 2πize2πiz – 1 + πiz = ∑ (–1)m (2π)2m(2m)! B2mz2m, m=0

and on the other hand
 ∞ ∞ ∞ π ctg πz = 1 – 2 ∑ ∑ z2mn2m = 1 – 2 ∑ ζ(2m)z2m. m=1 n=1 m=1

Comparing coefficients one has (5). With a little ingenuity one can avoid a direct appeal to the infinite product for sin πz or to the expansion for π ctg πz (For a detailed set of references, and some new proofs, see ). Indeed proving the irrationality of ζ(2n+1), nÎN constitutes one of the outstanding problems of the theory (ranking with the arithmetic nature of
 n γ = lim ( ∑ 1k – ln n ), n→∞ k=1

and of eπ, e + π, ... which are yet undetermined).

It is some measure of Apery's achievement that these questions have been considered by mathematicians of the top rank over the past few centuries without much success being achieved.

3. Some Irrelevant Explanations

For much of the following details I am indebted to Henri Cohen. All this due to Apery, of course. The identity
 K ∑ a1a2 ... ak–1(x + a1)(x + a2) ... (x + ak) = 1 x – a1a2 ... aKx(x + a1)(x + a2) ... (x + aK) k=1

follows easily on writing the right-hand side as A0AK and noting that each term on the left is Ak–1Ak . This explains  1 . Now put x = n2, ak = –k2, and take kKn – 1, to obtain
n–1
(–1)k–1(k – 1)!2

(n2 – 12) ... (n2k2)

=  1

n2

–  (–1)n–1(n – 1)!2

n2(n2 – 12) ... (n2 – (n–1)2)

=  1

n2

–
 2(–1)n–1 n2 ( 2nn )
.
k=1

Writing
 εn,k = k!2(n – k)!k3(n + k)!

because
 (–1)k n (εn,k – εn–1,k ) = (–1)k – 1(k – 1)!2(n2 – 12) ... (n2 – k2)

we have
N n–1   N   N
(–1)kn,k – εn–1,k ) = 1

n3

– 2
 (–1)n–1 n3 ( 2nn )
=
n=1 k=1   n=1   n=1
N   N   N
= (–1)kN,k – εk,k ) = 1

2

 (–1)k k3 ( N+kk )( Nk )
–  1

2

 (–1)k k3 ( 2kk )
k=1   k=1   k=1

and on noting that as N → ∞ the first term on the right vanishes, we have  2 . Actually the formula  2  is quite well known: it was observed some years ago by Raymond Ayoub (Penn.State) and it in fact appears in ; independently again it was noticed by R. William Gosper, Jr. (Palo Alto) in . Henri Cohen remarked that the formula is

 ζ(3) = 54 Li3 ( 1τ2 ) + 2π215 ln τ – 23 ln3 τ ,

where τ = ½(1 + √5) and Li3(x) = ∑ xn/n3 is the trilogarithm. Hjortnaes, Ayoub, and respectively Gosper note the integral representations (easily shown equivalent)
 ln τ ½ ζ(3) = 10 ò t2 cth t dt = 10 ò arsh2 tt dt. 0 0

In the case ζ(2) the formula is even better known. It is, for example, referred to by Z. R. Melzak , but suggested proof is not quite appropriate.  2'  may be proved by slightly varying the argument in Section 3 – multiply by (–1)n–1 instead of dividing by n. Many formulas similar to  2  and  2'  appear in the literature and the folklore.

4. Some Nearly Relevant Explanations

All this is quite irrelevant to the proof. It would suffice to introduce the quantities
n k
cn,k = 1

m3

+
 (–1)m–1 2m3 ( nm )( n+mm )
,   kn
m=1 m=1
(6)

and to remark that plainly cn,k → ζ(3) as n → ∞ uniformly in k. One might hope that a sequence cn,k already implies the irrationality of ζ(3) (say, the diagonal, with k = n) but this is not quite so. To see this, it is useful to prove a lemma:

Lemma:
 2cn,k ( n + kk ) Î Z + Z23 + ... + Zn3 = Z[1, 2, ..., n]3 .
 Equivalently:   2[1, 2, ..., n]3cn,k ( n + kk ) is an integer.

Proof. We check the number of times that any given prime p divides the denominator. But

(  n + m
m
)  =
 ( k m )
(  n + k
k
) (  n + k
km
)

and
 ordp ( n m ) ≤ ln n ln p – ordp m = ordp [1, ..., n] – ordp m,

so, we have

ord p ì m3  (  n
m
)(  n + m
m
) ü  = ord p ì m3  (  n
m
)(  k
m
) ü  ≤
î
 ( n + k k )
þ î
 ( n + k k – m )
þ
 ≤ 3 ordp m + ln n ln p + ln k ln p – 2 ordp m,

which yields the assertion, because mkn. We remark that those who know it well (Those who know it really well write
 ∞ ln [1, ..., n] = ∑ θ(n1/m) = ψ(n),  where  θ(n) = ∑ ln p. m=1 p≤n

Then it is known that ψ(n)/n ≤ 1.03883... (with maximum at n = 113) and indeed ψ(n) – n < 0.0242334...·n/ln n for n ≥ 525.752; see ) know that for n sufficiently large relative to ε > 0, [1, 2, ..., n] ≤ en(1+ε)

 (roughly:  [1, ..., n] = ∏ p[ln n/ln p] ≤ ∏ n ~ nn/ln n = en). p≤n p≤n

It will turn out that the cn,k have too large a denominator relative to their closeness to ζ(3). Hence to apply the irrationality criterion we must somehow accelerate the convergence. Apery described this process as follows: Consider two trianglular arrays (defined for kn) with entries

 d (0)n,k = cn,k ( n+kk ) and ( n+kk )

respectively. We recall that the arrays have the property that their "quotient" converges to ζ(3), in the sence that given any "diagonal" {n, k(n)}, the quotient of the corresponding elements of the two arrays converges to ζ(3). Now apply the following transformations to each array:

 d (0)n, k → d (0)n, n–k = d (1)n, k → ( n k ) d (1)n, k = d (2)n, k →

 k k → ∑ ( k m ) d (2)n, k = d (3)n, k → ( n k ) d (3)n, k = d (4)n, k → ∑ ( k m ) d (4)n, k = d (5)n, k , m=0 m=0
 k ( n+k k ) → ( 2n–k n ) → ( n k )( 2n–k n ) → ∑ ( k m )( n m )( 2n–m n ) → m=0
 k k l → ∑ ( k m )( n m )( n k )( 2n–m n ) → ∑ ∑ ( k l )( l m )( n l )( n m )( 2n–m n ) . m=0 l=0 m=0

Of course, the arrays have retained the property that their "quotient" converges to ζ(3), and we still have 2[1, 2, ..., n]3dn,kÎZ: We now take the main diagonals (k = n) of the arrays, calling them respectively {an} and {bn} and make the fantastic assertions embodied in  3 ! That is, each sequence satisfies the recurrence (2)! This is plainly absurd since surely inter alia a solution {un} of (2) (with integral initial values u0, u1) will have {un} with denominator more like n!3 than like 1 (or even 2[1, 2, ..., n]3). In Marseille, our amazement was total when our HP-67s, calculating {bn} on the one hand from the definition above, and on the other hand by the recurrence (2), kept on producing the same values.

5. It Seems that Apery Has Shown that ζ(3) Is Irrational

We were quite unable to prove that the sequences {an} defined above did satisfy the recurrence (2) (Apery rather tartly pointed out to me in Helsinki that he regarded this more a compliment than a criticizm of his method). But empirically (numerically) the evidence in favour was utterly compelling. It seemed indeed that ζ(3) had been proved irrational, because the rest, thus  4 , follows quite easily: Given (with p(n – 1) = 34n3 – 51n2 + 27n – 5),

n3anp(n – 1)an–1 + (n – 1)3an–2 = 0,     n3bnp(n – 1)bn–1 + (n – 1)3bn–2 = 0,

one multiplies the first equation by bn–1, the second by an–1, to obtain

n3(anbn–1an–1bn) = (n – 1)3(an–1bn–2an–2bn–1).

Recalling  a1b0a0b1 = 6·1 – 0·5 = 6  this cleverly yields

 anbn–1 – an–1bn = 6/n3. (7)

Seeing that ζ(3) – a0/b0 = ζ(3), it is easily indiced (write ζ(3) – an/bn = xn, and note that we have xnxn–1 = –6/n3bnbn–1 and x = 0) that
 ∞ ζ(3) – an bn = ∑ 6 k3bk bk –1 ,     ζ(3) – an bn = O ( 1bn2 ) . k=n+1

On the other hand the recurrence relation makes it easy to estimate bn, at any rate asymptotically. We have

 bn – ì 34 – 51 n + 27n2 – 5n3 ü bn–1 + ì 1 – 3 n + 3n2 – 1n3 ü bn–2 = 0 î þ î þ

and since the polynomial x2 – 34x + 1 has zeros 17 ± 12√2 = (√2 ± 1)4 we readily conclude that bn = O4n), α = 1 + √2. In fact Cohen has, more precisely, calculated that

 bn = (1 + √2)2(2π√2)3/2 (1 + √2)4nn3/2 ì 1 – 48 – 15√264n + O ì 1n2 ü ü . î î þ þ
(8)

We have to recall that the an are not integers. But writing pn = 2[1, 2, ..., n]3an, qn = 2[1, 2, ..., n]3bn we have pn, qn ÎZ and qn =O4ne3n),

 ζ(3) – pnqn = O ì 1α8n ü = O ì 1qn1+δ ü ,     with δ = 4 ln α – 34 ln α + 3 = 0.080529... > 0. î þ î þ

Hence, by the irrationality criterion, ζ(3) is indeed irrational, and moreover, because 1/δ = 12.417820... we have: For all integers p, q > 0 sufficiently large relative to ε > 0

 ζ(3) – p q > 1 q12.417820... + ε .

6. Some Trivial Verifications

To convince ourselves of the validity of Apery's proof we need only complete the following exercise.

EXERCISE

Prove the following identities:

5  Let cn, k defined by (6) and
 n n an = ∑ ( n k ) 2 ( n+k k ) 2 cn, k ,     bn = ∑ ( n k ) 2 ( n+k k ) 2 . k=0 k=0

Then a0 = 0,   a1 = 6;   b0 = 1,   b1 = 5 and each sequence {an} and {bn} satisfies the recurrence (2).

In the same spirit, the case of ζ(2) requires:

5'  Let
n   k
Cn, k = 2 (–1)m–1

m2

+
 (–1)n+m–1 m2 ( nm )( n+mm )
,
m=1   m=1
 n n An = ∑ ( n k ) 2 ( n+k k ) Cn, k ,     Bn = ∑ ( n k ) 2 ( n+k k ) . k=0 k=0

Then A0 = 0,   A1 = 5;   B0 = 1,   B1 = 3 and each sequence {An} and {Bn} satisfies the recurrence (4).

It is useful to notice that very little more than just proving these claims is required for Apery's proof. After all, it is quite plain that an/bn → ζ(3); the bn are integers, and the lemma of Section 4 shows that the an are "near-integers". In Section 5 we showed that the sequence satisfy the recursion (2) the irrationality of ζ(3) follows because from lnα>3 we obtain δ>0. Thus, as implied in various asides, most of the earlier argument is quite irrelevant. Indeed I am indebted to John Conway for the remark that even  5  is irrelevant.

EXERCISE

Be the first in your block to prove by a 2-line argument that ζ(3) is irrational (The author does not pretend to be able to do this. Notice that in fact even less is needed: it is sufficient to show anbn–1an–1bn = On) and bn = On), with   ln β – ln γ > 3).

 6 Given the definitions of  5  show that anbn–1 – an–1bn = 1/bn3 and bn = O(α4n) with α = 1 + √2. Conclude that ζ(3) is irrational because lnα>¾.

EXERCISE

Astound your friends with an excellent irrationality measure for π2.
6'

Given the definitions of  5'  show that anbn–1an–1bn = 5(–1)n–1/n2 and bn = O5n) with ω = ½(1 + √5). Conclude that for all integers p, q > 0 sufficiently large relative to ε>0

 π2 – p q > 1 q11.850782... + ε .

Though we have long known that ζ(2) is irrational, Apery's result in this case is significant. The irrationality degree for π2 is the best known; the irrationality degree implied for π is 23.701564... . These results compare very favourably with those of Mahler : |π – p/q| > q–42.

Wirsing announced |π – p/q| > q–21 and Mignotte proved that (for q sufficiently large) |π – p/q| > q–20; this is the best known result. It should be noted that the cited results depend on deep techniques and complicated estimates in transcendence theory as contrasted with the essentially elementary methods in Apery's proof. Mignotte also shows that |π – p/q| > q–18, which is weaker than Apery's result.

7. ICM'78. Helsinki, August 1978

Neither Cohen nor I had been able to prove  5  or  5'  in the intervening 2 months. After a few days of fruitless effort the specific problem was mentioned to Don Zagier (Bonn), and with irritating speed he showed that indeed the sequence {Bn} satisfies the recurrence (4). This more or less broke the dam and  5  and  5'  were quickly conquered. Henri Cohen addressed a very well-attended meeting at 17:00 on Friday, August 18 in the language of the majority, proving  5  and explaining how this implied the irrationality of ζ(3). Apery then made some remarks on the status of the French language, and alluded to the underlying motivation (as mentioned in Section 3) for his astonishing proof.

EXERCISE

Show that

7
 ζ(3) = 6 5 – 1 117 – 64 535 – ... – n634n3 + 51n2 + 27n + 5

and deduce that ζ(3) = 1.202056903... is irrational.

7'
 ζ(2) = π26 = 5 3 + 1 25 + 16 69 + ... + n411n2 + 11n + 3

and deduce that π2 has irrationality degree at most 11.850782... .

8. Some Rather Complicated but Ingenious Explanations

According to a dictum of Littlewood any identity, once verified, is trivial. Surely  5  is very nearly a counterexample. The following is principally due to Zagier and Cohen. Incidentally, we first considered  5'  which appeared simpler, but this was because we had failed to notice that
 n k n ∑ ∑ ( n k ) 2 ( n l )( k l )( 2n – l n ) = ∑ ( n k ) 2 ( 2n – k n ) 2 . k=0 l=0 k=0

Now writing nk for k links the arrays of Section 4 to  5 . It is quite convenient to write:
 n n bn, k = ( n k ) 2 ( n + k k ) 2 ,     an, k = bn, k cn, k bn = ∑ bn, k ,   an = ∑ bn, k cn, k . k=0 k=0

Then we wish to show that

 ∑ ( (n + 1)3bn+1, k – (34n3 + 51n2 + 27n + 5)bn, k + n3bn–1, k ) = 0. k

We cleverly construct

 Bn, k = 4(2n + 1) ( k(2k + 1) – (2n + 1)2 ) ( n k ) 2 ( n + k k ) 2

with the motive that

 Bn, k – Bn, k–1 = (n + 1)3 ( n + 1 k ) 2 ( n + 1 + k k ) 2 –

 – (34n3 + 51n2 + 27n + 5) ( n k ) 2 ( n + k k ) 2 + n3 ( n – 1 k ) 2 ( n – 1 + k k ) 2 ,

and, O mirabile dictu, the sequence {bn} does indeed satisfy the recurrence (2) by virtue of the method of creative telescoping (by the usual conventions: Bn, k = 0 for k < 0 or k > n; note also that P(n) = 34n3 + 51n2 + 27n + 5 implies P(n–1) = –P(–n)). The rest is plain sailing (or is it plane sailing?) We notice that

 (n + 1)3bn+1, k cn+1, k – P(n)bn, k cn, k + n3bn–1, k cn–1, k = = (Bn, k – Bn, k–1)cn, k + (n + 1)3bn+1, k (cn+1, k – cn, k) – n3bn–1, k(cn, k – cn–1, k).
(9)

Clearly
 k cn, k – cn–1, k = 1n3 + ∑ (–1)m (m – 1)!2 (n – m – 1)!(n + m)! = m=1
 k = 1n3 + ∑ ( (–1)m m!2 (n – m – k)!n2 (n + m)! – (–1)m–1 (m – 1)!n2 (n + m + 1)! ) = (–1)k k!2 (n – k – 1)!k2 (n + k)! m=1

whilst not even a minor miracle is required to write down cn,kcn, k–1. After some massive reorganization (9) becomes An, kAn, k–1 with

 An, k = Bn, kcn, k + 5(2n + 1)(–1)k–1 kn(n + 1) ( n k )( n + kk )

and we have completed  5 , and, in passing, proved  3 . This of course verifies Apery's claim to have proved ζ(3) irrational.

9. The Case of ζ(2)

The arguments required to deal with the exercises  2'  6'  are quite similar to those already described. It way however be a kindness to the reader to reveal that it would be wise to take

 Bn, k = (k2 + 3(2n+1)k – 11n2 – 9n – 2) ( n k ) 2 ( n + kk ) , An, k = Bn, kCn, k + 3(–1)n+k–1 (n – 1)!(k – 1)! .

Moreover

 Cn, k – Cn–1, k = 2(–1)n+k–1 k!2(n – k – 1)!n(n + k)! and Bn = [½(1 + √5)]5n+4 2πn√5 + 2√5 ( 1 + O( 1/n) ) .
(10)

(also note that if Q(n) = 11n2 + 11n + 3 then Q(n–1) = Q(–n)).

10. What on Earth is Going on Here?

Apery's incredible proof appears to be a mixture of miracles and mysteries. The dominating question is how to generalize all this, down to the Euler constant γ and up to the general ζ(t)? Here we have, apparently, the tip of an iceberg which relates 1 + √2 to ζ(3) and ½(1 + √5) to ζ(2); we have surprising identities  2  and  2' , and startling continued fractions (produced by Cohen for his Helsinki talk),  7  and  7' . Does the complete berg look like this? For my part I incline to the view that much of what has been presented constitutes a mystification rather than an explanation. For example Richard Askey (Madison, Wiskonsin) has pointed out to me that the sequences {bn} and {Bn} may be recognized as special values of certain hypergeometric polynomials; immediately the recurrences  2  and  2'  become identities relating hypergeometric functions and much of the magic fades away. Unfortunately the difficulties remain, because not all that much is known about the higher generalizations of the classical hypergeometric functions. For this, and other reasons, it is however likely that one should think about recurrences of order greater than 2. This, incidentally, means that the continued fractions constitute a red herring. In any event  7  obscures a fundamental miracle. It convergents Pn/Qn are of course such that the sequences {Pn} and {Qn} both satisfy Un+1 = (34n3 + 51n2 + 27n + 5)Unn6Un–1. The proof works (not because the continued fraction does not terminate; that only works for regular continued fractions, but) because if U0 = 1, U1 = 5 then it happens that n!3 divides the integers Un; more honestly: it is already enough (and is necessary) that for any initial integer values U0, U1, n!3 always divides 2[1, 2, ..., n]3Un. An analogous miracle makes the recurrence Un+1 = (11n2 + 11n + 3)Un + n4Un–1 useful in proving the irrationality of ζ(2). Tom Cusick (Buffalo) has noticed that the following recurrences also yield continued fractions converging to π2/6: n2un = (7n2 7n + 2)un–1 + 8(n–1)2un–2
(one solution of which is
 n ∑ ( n k ) 3 k=0
),

and n3un = 2(2n – 1)(3n2 – 3n + 1)un–1 + (4n – 3)(4n – 4)(4n – 5)un–2
(a solution is
 n ∑ ( n k ) 4 k=0
).

On first impression the first yields a worse irrationality degree for π2 than that obtained by Apery, and the second does not yield irrationality at all. Apery's results are indeed remarkable. These surprises generalize the following quite well known fact (to which I was alerted by Frits Beukers (Leiden)): the recurrence Un+1 = (6n + 3)Unn2Un–1 is such that n! divides Un if U0 = 1, U1 = 3; and n! divides [1, 2, ..., n]Un for all integer initial values U0, U1.

EXERCISE

What are the higher analogues?

8  Show that if
 ∞ n B(z) = 1 √1 – 6z + z² ∑ bn z n,   then the   bn = ∑ ( n k )( n + kk ) . n=0 k=0

Find expression for the an in
 z ∞ A(z) = 1 √1 – 6z + z² ∫ dt √1 – 6t + t² = ∑ an z n 0 n=0

and notice that the [1, 2, ..., n]an all are integers. Show that sequences {an} (a0 = 0, a1 = 1) and {bn} (b0 = 1, b1 = 3) both satisfy nun + (n – 1)un–2 = (6n – 3)un–1. Now prove that there is a constant λ such that
 ∞ A(z) – λB(z) = ∑ cn z n n=0

has no singularity at (√2 – 1)2. Deduce that then cn = O((√2 – 1)2n) and conclude that it follows that ln2 has irrationality degree at most 4.662100831... .

Of course,  6  should remind us that recurrences may be quite irrelevant to the proof. The vital this then is suitable definition of the cn,k, so one is brought back to looking for generalizations of  2 . But, for the present, generalization of Apery's work remains, as they say, a mystery wrapped in an enigma. Well, not really. It is just that it is not at all clear where to go. A numerical test (suggested by Cohen) implies that

ζ(4) =  π4

90

=  36

17

 1 n4 ( 2nn )
n=1

(so this true for all practical purposes) and it has been shown by Gosper that

ζ(5) =  5

2

( 1 +  1

22

+  1

32

+ ... +  1

(n – 1)2

–  4

5n2

)
 (–1)n n3 ( 2nn )
.
n=2

David Hawkins (Boulder) suggests similar formulas. Apparently such expressions can be generated virtually at will on using appropriate series accelerator identities. Most startling of all though should be the fact that Apery's proof has no aspect that would not have been accessible to a mathematician of 200 years ago. The proof we have seen is one that many mathematicians could have found, but missed.

This note was written at Queen's University, Kingston, Ontario whilst the author was on study leave from the University of New South Wales, Sydney, Australia (October, 1978).

P.S. See  for many delightful facts including the trilogarithm formula of 4 which is given at p.139. At p.89 of  one is astonished to be asked to prove as an exercise that

 1 ( 2nn )
=  1

3

+  2π√3

27

,
n=1

 1 n ( 2nn )
=  π√3

9

,
n=1

 1 n2 ( 2nn )
=  π2

18

,
n=1

 1 n4 ( 2nn )
=  17π4

3240

.
n=1

Seeing that

 x2n n2 ( 2nn )
= 2 arcsin (  x

2

)
n=1

(, p.108) the first three formulae (and the one with trilogarithm) become quite accessible to proof, but I had not detected anyone able to prove the expression for ζ(4), until I proved it in March 1979 after noticing a remark of Lewin that also
 π/3 2 ∫ x ln2 ( 2 sin x2 ) dx = 17π43240 . 0

Sam Wagstaff (Illinois) and Andrew Odlyzko (Bell Labs) have mentioned to me that numerical evidence suggests that there are formulae of the shape  2  and  2'  for ζ(t) only for t = 2, 3, 4, and this is verified by my studies in a current manuscript Some wonderful formulae. The recurrences (9) are long known, see , p.90. One can recognise the bn as bn = 4F3(n+1, –n, n+1, –n; 1,1,1; 1) and determine the recurrence  3  by way of three term relations with contiguous balanced series; see .

Frits Beukers (Leiden)  has found an elegant approach to Apery's proof which entirely avoids explicit identities, recurrences and other magic. Instead just consider
 1 1 I = – 12 ∫ ∫ Pn(x)Pn(y) ln xy1 – xy dxdy = bnζ(3) – an 0 0

noticing that the bn are integers and the an are rationals with the 2[1, 2, ..., n]3an integers, whilst I | ≤ ζ(3)(√2 – 1)4n. Here Pn(z) = (d/dz)n[zn(1 – zn)]/n! is the Legendre polynomial. Again, there is no obvious way to generalize the proof.

In retrospect it seems clear that  8  really is useful; implications are being considered by Bombieri et al (at Princeton). For example, one's intuition is just wrong in feeling incredulity at the facts of  3 . All that this report is that the differential equation

 ddx (x4 – 34x3 + x2 ) d3ydx3 + (6x3 – 103x2 + 3x) d2ydx2 +

 + (7x2 – 112x + 1) dydx + (x – 5)y – (u1 – 5u0) = 0

has two G-function solutions, namely a(x) = a1 x + a2 x2 + ...; b(x) = 1 + b1 x + b2 x2 + ...; and a(x) – ζ(3)b(x) is regular (in fact vanishes) at α = (√2 – 1)4. This is interesting, but no longer incredible; and it is readily generalizable... All this too is an idea of Beukers. Some officious readers have been critical of my casual use of the O-symbol; the fault is mine, not Apery's. No harm is done. Similarly it has been claimed that Apery's proof was not missed by Euler – «Euler did not know the prime number theorem»; to me it seems hypercritical to suggest that [1, 2, ..., n] = O((√2 + 1)4n/3) could not have been noticed at the time, had it been needed. Anyhow, I considered it a racy title. It arose after Cohen's report at Helsinki, with someone sourly commenting «A victory for the French peasant...»; to this Nick Katz retorted: «No...! No! This is marvellous! It is something Euler could have done...».

 School of Mathematics and Physics,Macquarie UniversityNorth Ryde, New South Wales,Australia 2113 March 1979

References
1. I. Niven. Irrational Numbers (Carus Monograph #11). MAA-Wiley, 1967. black

2. Bruce C. Berndt. Modular transformations and generalizations of several formulae of Ramanujan. Rocky Mountain J. of Maths 7 (1977), pp. 147–189. black

3. Bruce C. Berndt. Elementary evaluation of ζ(2n). Maths Mag. 48 (1945), pp. 148–153. black

4. Margrethe Munthe Hjortnaes. Overforing av rekken 1/k³ til et bestemt integral. Proc. 12th Cong. Scand. Maths, Lund 10–15 Aug. 1953 (Lund 1954). black

5. R. William Gosper, Jr. A calculus of series rearrangements. In "Algorithms and Complexity, New Directions and Recent Results", ed. J. Traub. Academic Press, 1976, pp.121–151. black

6. Z. R. Melzak. Introduction to Concrete Mathematics. Wiley, 1973, p.85. black

7. J. Barkley. Rosser and lowell Schoenfeld. Math. Comp. 29 (1975) pp.243–269. black

8. K. Mahler. Applications of some formulae by Hermite to the approximation of exponentials and logarithms. Math. Annalen 168 (1967) pp.200–227. black

9. Leonard Lewin. Dilogarithms and associated functions. Macdonald, London, 1958. black

10. Louis Comtet. Advanced Combinatorics. D.Reidel, Dordrecht, 1974. black

11. J. A. Wilson. Hypergeometric series, recurrence relations and some new orthogonal functions. Ph.D.Thesis; U.Wisconsin–Madison, 1978. black

12. Frits Beukers. A note on the irrationality of ζ(2) and ζ(3). J. Lond. Math. Soc. (to appear). black

Some Wonderful Formulae