Number

An integral that cannot be a whole number

Niven's proof that π is not a fraction is the same squeeze as the one for e, with a much harder multiplier. A polynomial supplies the whole number; its own smallness supplies the contradiction; and both halves are computable.

Worth reading first: A tail too small to be a whole number · Adding up rectangles until they stop being rectangles.

The proof that ee is not a fraction fits in a paragraph because the series for ee hands over both halves of the squeeze at once: the factorial makes the head whole, and the same factorials make the tail small.

π\pi has no such series. Every classical expression for it converges too slowly to be squeezed, and for two thousand years nobody could show it was not a fraction — Aristotle assumed it was, Archimedes bracketed it, and the question stayed open until Lambert settled it in 1761 with a continued fraction for the tangent. The proof that fits on a page is Ivan Niven’s, from 1947, and it is the same template with a manufactured multiplier.

The polynomial that squeezes π. On the left, xⁿ(π − x)ⁿ/n! drawn at several degrees, its largest value falling toward nothing; on the right, the derivatives of the same polynomial at zero, every one a whole number.
Fig. 1 The two halves of the squeeze. On the left, the polynomial xn(πx)n/n!x^n(\pi - x)^n / n! on the interval from zero to π\pi: it is positive, and its largest value falls to nothing as the degree rises, so anything integrated against it does too. On the right, the same polynomial’s derivatives at zero when π\pi is written as a fraction — every one of them a whole number, computed exactly, which is what makes the integral whole.

The template, and what has to be supplied

The argument that settled ee has a shape: assume the number is p/qp/q, find a multiplier that makes some computable quantity a whole number, and show that quantity is strictly between zero and one.

For ee the multiplier was q!q! and the quantity was a series tail. Here the multiplier is a polynomial and the quantity is an integral, and both have to be constructed. Suppose π=a/b\pi = a/b with aa and bb whole numbers, and set

f(x)=xn(abx)nn!,In=0πf(x)sinxdx.f(x) = \frac{x^n(a - bx)^n}{n!}, \qquad I_n = \int_0^{\pi} f(x)\,\sin x \, \mathrm{d}x.

Two claims are needed, and they are the two panels of the figure.

InI_n is a whole number. This is the hard half, and the polynomial was built for it.

0<In<10 < I_n < 1 for large nn. This is the easy half, and it is a bound on a positive function times a bounded one.

Together they are the contradiction, because there is no whole number strictly between zero and one — the same observation that finished the last rung.

Why the integral is a whole number

Integrating f(x)sinxf(x)\sin x by parts repeatedly turns the integral into a sum of values of ff and its derivatives at the two endpoints, with alternating signs. The polynomial has degree 2n2n, so after 2n+12n + 1 steps the derivatives vanish and the process stops; what is left is

In=F(0)+F(π),F=ff+fI_n = F(0) + F(\pi), \qquad F = f - f'' + f'''' - \dots

So InI_n is whole as soon as every derivative of ff at 00 and at π\pi is whole, and that is what the polynomial’s peculiar shape buys.

At x=0x = 0: expand xn(abx)nx^n(a - bx)^n and every term has degree at least nn, so the derivatives of order below nn all vanish. The derivative of order n+jn + j at zero is the coefficient of xn+jx^{n+j} times (n+j)!(n+j)!, divided by the n!n! in the denominator — and (n+j)!/n!(n+j)!/n! is a whole number. The coefficients themselves are whole because aa and bb are.

At x=π=a/bx = \pi = a/b: the polynomial satisfies f(πx)=f(x)f(\pi - x) = f(x), which is a two-line check on the definition, so the derivatives at π\pi are the derivatives at 00 up to sign. Nothing more is needed.

The right-hand panel of the figure computes those derivatives at 00 in exact whole-number arithmetic for a stated a/ba/b and reports that every one of them is whole. That is the step usually asserted in the textbook proof, and it is the step a reader has no reason to believe on being told.

The polynomial that squeezes π. On the left, xⁿ(π − x)ⁿ/n! drawn at several degrees, its largest value falling toward nothing; on the right, the derivatives of the same polynomial at zero, every one a whole number.
Fig. 2 The polynomial at four degrees. It is squeezed between zero and its own peak at the midpoint, and the peak is (π2/4)n/n!(\pi^2/4)^n/n! — an exponential over a factorial, so it falls to nothing however large the numerator is. That is the entire content of the second claim.

Why the integral is small

The other half is a bound, and it needs nothing clever.

On the interval, 0xπ0 \le x \le \pi, so 0x(abx)aπ0 \le x(a - bx) \le a \cdot \pi — the product of two positive factors each at most its own maximum. And sinx\sin x is between 00 and 11 there. So

0<Inπ(πa)nn!.0 < I_n \le \pi \cdot \frac{(\pi a)^n}{n!}.

The numerator grows exponentially in nn and the denominator grows factorially, so the bound goes to zero — and past some computable nn it is below one. That nn can be found by search rather than estimated, and the figure finds it.

24 rectangles under a curve. A left-endpoint Riemann sum with 24 rectangles approximating the area under a curve.
Fig. 3 What the quantity being bounded actually is: an area under a curve on the interval from zero to π\pi. The bound in this section replaces the curve by its own largest value and the interval by its length, which is crude and is enough — the factorial in the denominator does all the remaining work.

Note what has just happened. The number nn was free all along; the polynomial exists for every degree. The proof chooses nn after seeing aa and bb, large enough for the bound to bite. That order matters: for any particular nn there is a fraction a/ba/b for which the bound is useless, and for any particular a/ba/b there is an nn for which it is not. The quantifiers are the proof.

The factorial, and the formula with e inside it. A table of n, n factorial, the value of (n/e)ⁿ√(2πn), their ratio and n times the excess, for n up to 12; the ratio falls from 1.0844 to 1.006967.
Fig. 4 Why the bound wins: Stirling’s estimate for n!n!, which grows like (n/e)n(n/e)^n and so outruns any fixed base raised to the nn. The ratio cn/n!c^n/n! falls to nothing however large cc is, because each further step divides by nn and multiplies by cc — and everything in the second half of this proof is that one comparison.

Where the difficulty actually sits

It is worth being precise about which part of this was hard, because the proof is short and its shortness is misleading.

The bound is routine. Anyone who has seen an exponential lose to a factorial can produce it, and the tail argument for ee is the same comparison doing the same job.

The integrality is not routine at all, and the polynomial is not something a reader would think of. It has to vanish to order nn at both endpoints (so that low derivatives are zero), have whole-number coefficients after multiplying by bnb^n (so the high ones are whole), be symmetric about the midpoint (so one endpoint’s computation serves for both), and be small on the interval (so the bound works). Four requirements, one construction, and the construction was found in 1947 rather than in 1761.

Lambert’s original proof is quite different. It develops tanx\tan x as a continued fraction, shows the expansion is infinite for every non-zero rational xx, and concludes that tan(π/4)=1\tan(\pi/4) = 1 forces π/4\pi/4 to be irrational. It is a better proof in the sense that it proves more — every non-zero rational has irrational tangent, so the circular functions take no non-zero rational to a rational — and a worse one in the sense that convergence of a continued fraction with function entries takes real analysis to justify.

Niven’s is the one that fits on a page, and the reason it fits is that all the ingenuity is in a formula that can be written in one line and checked in three.

The polynomial, and why every requirement is forced

The construction looks arbitrary until each of its features is matched to the line of the proof that needs it, and then there is nothing arbitrary left.

Why xnx^n and (abx)n(a - bx)^n rather than any other pair of factors. The two factors vanish at 00 and at π\pi respectively, each to order nn. That is what kills the low derivatives at both endpoints and leaves only the ones the factorial makes whole.

Why the same exponent on both. It makes f(πx)=f(x)f(\pi - x) = f(x), so the arithmetic at one endpoint serves for the other. Different exponents would double the work and buy nothing.

Why bnb^n inside rather than outside. Writing (abx)n(a - bx)^n rather than bn(a/bx)nb^n(a/b - x)^n keeps every coefficient a whole number. This is where the assumption that π\pi is a fraction is actually used, and it is used exactly once.

Why divide by n!n!. Without it the derivatives are still whole and the integral is not small — the factorial is what turns (πa)n(\pi a)^n into something that goes to zero. It is also what makes the derivatives just whole rather than divisible by a large factor, which is not needed but is where the elegance is.

Why sinx\sin x and not something else. Two reasons. It vanishes at both 00 and π\pi, which is what makes the integration by parts terminate cleanly, and its own derivatives cycle with period four, which is what produces an alternating sum of even derivatives rather than a mess. Any function with those two properties would do, and sin\sin is the one that has them because π\pi is defined by it.

Five features, five lines of the proof. A construction with no spare parts is usually a construction someone worked backwards from the contradiction, and this one visibly was.

What it does not settle

The same three limitations as the last rung, and one of them is sharper here.

It does not give transcendence. π\pi could still, for all this argument says, be a root of some whole-number polynomial of high degree. That it is not is Lindemann’s theorem of 1882, and it is a much heavier result — it needs the transcendence of eαe^\alpha for algebraic non-zero α\alpha, and Euler’s identity to connect the two.

That distinction is not academic. Squaring the circle needs transcendence and not irrationality: the constructible numbers include plenty of irrational ones, so the impossibility of squaring the circle waited on Lindemann rather than on Lambert, a hundred and twenty years later. Doubling the cube is the contrasting case, where irrationality is easy and the impossibility still needed a statement about degrees rather than about fractions.

It does not measure how irrational π\pi is. The proof shows a quantity is small; it extracts no approximation statement. What is known — that π\pi cannot be approached faster than about the eighth power of the denominator — comes from entirely different machinery, of the kind the rung above introduces, and the exponent has been reduced slowly and painfully over decades.

It says nothing about π+e\pi + e, πe\pi e, or ππ\pi^{\pi}. Whether any of those is irrational is open. At least one of π+e\pi + e and πe\pi e is transcendental, because if both were algebraic then π\pi and ee would be roots of a quadratic with algebraic coefficients — but which one, nobody knows.

The tail that would have to be a whole number. For each denominator, the value of q! times the tail of the series for e, plotted against the band between zero and one where no whole number lies, with the bound 1/q above it.
Fig. 5 The proof for ee, for contrast. The squeeze is the same and everything hard about the π\pi case is absent: the head is whole because factorials divide factorials, and the tail is small because factorials grow. Niven’s polynomial is what has to be built when a number arrives without a series that does both.

A worked instance of the arithmetic

It helps to see the integrality claim on actual numbers rather than in general.

Take a/b=22/7a/b = 22/7, which is not π\pi and is close enough for the picture, and n=7n = 7. The polynomial is x7(227x)7/7!x^7(22 - 7x)^7/7!. Expanding (227x)7(22 - 7x)^7 by the binomial theorem gives eight terms with whole-number coefficients; multiplying by x7x^7 shifts them to degrees 77 through 1414; and the derivative of order 7+j7 + j at zero is that term’s coefficient times (7+j)!(7+j)!, over 7!7!.

The ratio (7+j)!/7!(7+j)!/7! is a product of jj consecutive whole numbers and is therefore whole. Every derivative comes out whole, and the figure prints the first several of them — numbers with a dozen digits, exactly, in big-integer arithmetic, because the claim is whole and a floating-point computation of a twelve-digit quantity cannot tell a whole number from its neighbour.

The size of those numbers is worth noticing. They are enormous, and InI_n is under one. The integral is a very small difference of very large whole numbers, and that is not a defect of the presentation — it is what the proof is doing. A quantity assembled out of numbers near 101210^{12} and known to lie strictly between zero and one has been forced to be a whole number, and there is none available.

How long it took, and what the delay was about

The gap between Archimedes and Lambert is nineteen centuries, and it is worth asking what the missing ingredient was, because the answer is not ingenuity.

Archimedes bracketed π\pi between 223/71223/71 and 22/722/7 by inscribing and circumscribing ninety-six-sided polygons, and the method is exact and mechanical: it can be pushed to any accuracy by doubling the sides. What it produces is a sequence of fractions, and no sequence of fractions decides whether its limit is one.

The missing ingredient was an infinite process that says something about a number’s kind rather than its size. Series, continued fractions and integrals all do that; polygon-doubling does not, because every stage of it is a rational approximation and rational approximations are exactly what the question is about.

The convergents of π. Each convergent marked on a number line, alternating above and below the value it approaches.
Fig. 6 The fractions that come closest to π\pi for their size, including Archimedes’ 22/722/7 and the much better 355/113355/113. Every one of them is a rational approximation, every one is exact arithmetic, and the whole list settles nothing about the question this essay answers — which is the point the nineteen centuries were making.

That is why the seventeenth century’s arrival of infinite series changed the situation and the eighteenth century’s mastery of them settled it. Euler had ee’s continued fraction in 1737; Lambert had the tangent’s in 1761; and Niven’s polynomial is a nineteenth-century object used in 1947 to make the answer fit on a page.

There is a general lesson in the shape of it and this site keeps meeting it. A question about what a number is cannot be answered by better approximations to it. Counting what has no formula is the same observation about the primes: an enormous table of them was available for a century before anything was proved, and the proof when it came was about a completely different object.

The same squeeze, on a number nobody could reach

It is worth saying what the template has and has not managed since, because π\pi was not the end of the line and the pattern of the successes is informative.

Every ere^r for rational non-zero rr, and every tanr\tan r, fell to Lambert’s machinery in the eighteenth century. The continued fractions were there and the numbers were reachable.

ζ(3)\zeta(3) — the sum of the reciprocal cubes — held out until 1978. Euler had evaluated the sum of the reciprocal squares as π2/6\pi^2/6 in 1735, which settles that one, and the odd exponents resisted everything for two hundred and forty years. Apéry’s proof is the same template: a quantity that would have to be a whole number, and a demonstration that it is too small. Producing the quantity took two auxiliary sequences satisfying a recurrence nobody had seen, and the talk announcing it was widely disbelieved.

ζ(5)\zeta(5) is open. So is the irrationality of the Euler–Mascheroni constant, of π+e\pi + e, and of 222^{\sqrt2} — no, that last one is settled, by Gelfond and Schneider, and it is worth naming because it shows how uneven the ground is: a number that looks far more exotic than ζ(5)\zeta(5) is known and a sum of reciprocal fifth powers is not.

The unevenness has a reason. The template needs a quantity that is forced to be whole, and that comes from a structure rather than from a number. Where a number sits inside a series with factorial denominators, or inside an integral against a polynomial, or inside a linear form with algebraic coefficients, there is something to force. Where it does not, there is nothing to try, and ζ(5)\zeta(5) has been in that position for a very long time.

What the picture cannot show

The left panel draws xn(πx)n/n!x^n(\pi - x)^n/n! and not f(x)sinxf(x)\sin x, and the integral is of the second. The difference does not matter for the bound — sin\sin is between zero and one — but the curve on the page is not the integrand, and a reader looking for the area under the drawn curve is looking at the wrong quantity by a factor of up to π\pi.

The right panel prints derivatives at zero and says every one is whole. It cannot show why, which is the binomial expansion and the ratio of factorials, and the reason is that the why is arithmetic rather than shape.

And neither panel can show the choice of nn, which is the logical heart. The proof works because nn is chosen after aa and bb; a picture at fixed degree shows a single case, and the quantifier is invisible in every one of them.

Where the ladder goes next

Above: transcendence. Being no root of any whole-number polynomial is a stronger property than being no fraction, it needs a different kind of argument, and the accessible version of that argument is about how fast a number can be approached rather than about whether anything hits it exactly.

Two debts. Lambert’s continued fraction for the tangent is quoted and not drawn, and it is the historically decisive proof. And Lindemann’s theorem is named three times here as the thing that settles squaring the circle, and no essay on this site proves it — which is honest, since it is several pages of exponential polynomials, and is still a promise.

What Niven built

When a number arrives without a series that is both whole and small, build a polynomial that is.

Every requirement on Niven’s ff answers one line of the template. It vanishes to high order so the low derivatives are whole; it carries bnb^n so the high ones are; it is symmetric so one endpoint suffices; and it is tiny so the integral is. The proof is one paragraph because the construction absorbed all of it, which is the usual arrangement when a two-thousand-year-old question turns out to have a one-page answer.

What links here

Computed from the collection, not written here: the essays that point at this one.

Shares its objects with

Essays that name at least two of the same things, and that neither author linked.

Named objects

A dashed tag is an object no other essay names yet.

DerivativeFactorialIntegralityIntegration by partsIrrationalityPiPolynomialProof by contradictionSqueezeTranscendence