Xrthnty

Pi (π) is the best-known transcendental number

In mathematics, a transcendental number is a real or complex number that is not algebraic—that is, it is not a root of a nonzero polynomial equation with integer (or, equivalently, rational) coefficients. The best-known transcendental numbers are π and e. Though only a few classes of transcendental numbers are known (in part because it can be extremely difficult to show that a given number is transcendental), transcendental numbers are not rare. Indeed, almost all real and complex numbers are transcendental, since the algebraic numbers are countable while the sets of real and complex numbers are both uncountable. All real transcendental numbers are irrational, since all rational numbers are algebraic. The converse is not true: not all irrational numbers are transcendental; e.g., the square root of 2 is irrational but not a transcendental number, since it is a solution of the polynomial equation x² − 2 = 0. Another irrational number that is not transcendental is the golden ratio, φdisplaystyle varphi or ϕdisplaystyle phi , since it is a solution of the polynomial equation x² − x − 1 = 0.

History

The name "transcendental" comes from the Latin transcendĕre 'to climb over or beyond, surmount',^[1] and was first used for the mathematical concept in Leibniz's 1682 paper in which he proved that sin(x) is not an algebraic function of x.^[2][3]Euler, in the 18th century, was probably the first person to define transcendental numbers in the modern sense.^[4]

Johann Heinrich Lambert conjectured that e and π were both transcendental numbers in his 1768 paper proving the number π is irrational, and proposed a tentative sketch of a proof of π's transcendence.^[5]

Joseph Liouville first proved the existence of transcendental numbers in 1844,^[6] and in 1851 gave the first decimal examples such as the Liouville constant

Lb=∑n=1∞b−n!=b−1+b−2+b−6+b−24+b−120+b−720+b−5040+b−40320+…=(0.11000100000000000000000100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000000…)bdisplaystyle beginalignedL_b&=sum _n=1^infty b^-n!\&=b^-1+b^-2+b^-6+b^-24+b^-120+b^-720+b^-5040+b^-40320+ldots \&=left(0.textbf 1textbf 1000textbf 100000000000000000textbf 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000textbf 100000000ldots right)_b\endaligned

in which the nth digit after the decimal point is 1 if n is equal to k! (k factorial) for some k and 0 otherwise.^[7] In other words, the nth digit of this number is 1 only if n is one of the numbers 1! = 1, 2! = 2, 3! = 6, 4! = 24, etc. Liouville showed that this number belongs to a class of transcendental numbers that can be more closely approximated by rational numbers than can any irrational algebraic number, and this class of numbers are called Liouville numbers, named in honour of him. Liouville showed that all Liouville numbers are indeed transcendental.^[8]

The first number to be proven transcendental without having been specifically constructed for the purpose of proving transcendental numbers' existence was e, by Charles Hermite in 1873.

In 1874, Georg Cantor proved that the algebraic numbers are countable and the real numbers are uncountable. He also gave a new method for constructing transcendental numbers.^[9][10] In 1878, Cantor published a construction that proves there are as many transcendental numbers as there are real numbers.^[11] Cantor's work established the ubiquity of transcendental numbers.

In 1882, Ferdinand von Lindemann published the first complete proof of the transcendence of π. He first proved that e^a is transcendental when a is any non-zero algebraic number. Then, since e^iπ = −1 is algebraic (see Euler's identity), iπ must be transcendental. But since i is algebraic, π therefore must be transcendental. This approach was generalized by Karl Weierstrass to what is now known as the Lindemann–Weierstrass theorem. The transcendence of π allowed the proof of the impossibility of several ancient geometric constructions involving compass and straightedge, including the most famous one, squaring the circle.

In 1900, David Hilbert posed an influential question about transcendental numbers, Hilbert's seventh problem: If a is an algebraic number, that is not zero or one, and b is an irrational algebraic number, is a^b necessarily transcendental? The affirmative answer was provided in 1934 by the Gelfond–Schneider theorem. This work was extended by Alan Baker in the 1960s in his work on lower bounds for linear forms in any number of logarithms (of algebraic numbers).^[12]

Properties

The set of transcendental numbers is uncountably infinite. Since the polynomials with rational coefficients are countable, and since each such polynomial has a finite number of zeroes, the algebraic numbers must also be countable. However, Cantor's diagonal argument proves that the real numbers (and therefore also the complex numbers) are uncountable. Since the real numbers are the union of algebraic and transcendental numbers, they cannot both be countable. This makes the transcendental numbers uncountable.

No rational number is transcendental and all real transcendental numbers are irrational. The irrational numbers contain all the real transcendental numbers and a subset of the algebraic numbers, including the quadratic irrationals and other forms of algebraic irrationals.

Any non-constant algebraic function of a single variable yields a transcendental value when applied to a transcendental argument. For example, from knowing that π is transcendental, it can be immediately deduced that numbers such as 5π, (π − 3)/√2, (√π − √3)⁸ and (π⁵ + 7)^1/7 are transcendental as well.

However, an algebraic function of several variables may yield an algebraic number when applied to transcendental numbers if these numbers are not algebraically independent. For example, π and (1 − π) are both transcendental, but π + (1 − π) = 1 is obviously not. It is unknown whether π + e, for example, is transcendental, though at least one of π + e and πe must be transcendental. More generally, for any two transcendental numbers a and b, at least one of a + b and ab must be transcendental. To see this, consider the polynomial (x − a)(x − b) = x² − (a + b)x + ab. If (a + b) and ab were both algebraic, then this would be a polynomial with algebraic coefficients. Because algebraic numbers form an algebraically closed field, this would imply that the roots of the polynomial, a and b, must be algebraic. But this is a contradiction, and thus it must be the case that at least one of the coefficients is transcendental.

The non-computable numbers are a strict subset of the transcendental numbers.

All Liouville numbers are transcendental, but not vice versa. Any Liouville number must have unbounded partial quotients in its continued fraction expansion. Using a counting argument one can show that there exist transcendental numbers which have bounded partial quotients and hence are not Liouville numbers.

Using the explicit continued fraction expansion of e, one can show that e is not a Liouville number (although the partial quotients in its continued fraction expansion are unbounded). Kurt Mahler showed in 1953 that π is also not a Liouville number. It is conjectured that all infinite continued fractions with bounded terms that are not eventually periodic are transcendental (eventually periodic continued fractions correspond to quadratic irrationals).^[13]

Numbers proven to be transcendental

Numbers proven to be transcendental:

• 
  e^a if a is algebraic and nonzero (by the Lindemann–Weierstrass theorem).


• 
  π (by the Lindemann–Weierstrass theorem).


• 
  e^π, Gelfond's constant, as well as e^−π/2=iⁱ (by the Gelfond–Schneider theorem).


• 
  a^b where a is algebraic but not 0 or 1, and b is irrational algebraic (by the Gelfond–Schneider theorem), in particular:

22,displaystyle 2^sqrt 2, the Gelfond–Schneider constant (or Hilbert number)

• Numbers such as:

∑n=0∞10−(n22−n2−1)=10−1+10−2+10−4+10−7+10−11+10−16+…=0.1101001000100001000001000000100000001000000001000000000100000000001000000000001000000000000…displaystyle beginaligneddisplaystyle sum _n=0^infty 10^-left(frac n^22-frac n2-1right)&=10^-1+10^-2+10^-4+10^-7+10^-11+10^-16+ldots \&=0.textbf 1textbf 10textbf 100textbf 1000textbf 10000textbf 100000textbf 1000000textbf 10000000textbf 100000000textbf 1000000000textbf 10000000000textbf 100000000000textbf 1000000000000ldots endaligned

• 
  sin(a), cos(a) and tan(a), and their multiplicative inverses csc(a), sec(a) and cot(a), for any nonzero algebraic number a (by the Lindemann–Weierstrass theorem).


• The fixed point of the cosine function – the unique real solution to the equation cos⁡(x)=xdisplaystyle cos(x)=x (by the Lindemann–Weierstrass theorem).^[14]


• 
  ln(a) if a is algebraic and not equal to 0 or 1, for any branch of the logarithm function (by the Lindemann–Weierstrass theorem).


• 
  W(a) if a is algebraic and nonzero, for any branch of the Lambert W Function (by the Lindemann–Weierstrass theorem).


• 
  Γ(1/3),^[15] Γ(1/4),^[16] and Γ(1/6).^[16]


• 0.64341054629..., Cahen's constant.^[17]


• The Champernowne constants, the irrational numbers formed by concatenating representations of all positive integers.^[18][19]


• Ω, Chaitin's constant (since it is a non-computable number).^[20]


• The so-called Fredholm number^[21][22][23]

∑n=0∞2−2ndisplaystyle sum _n=0^infty 2^-2^n

more generally, any number of the form

∑n=0∞β2ndisplaystyle sum _n=0^infty beta ^2^n

with 0 < |β| < 1 and β algebraic.^[24]

• The aforementioned Liouville constant

∑n=1∞10−n!;displaystyle sum _n=1^infty 10^-n!;

more generally any number of the form

∑n=1∞βn!displaystyle sum _n=1^infty beta ^n!

with 0 < |β| < 1 and β algebraic.

• The Prouhet–Thue–Morse constant.^[25][26]


• Any number for which the digits with respect to some fixed base form a Sturmian word.^[27]


• For β > 1

∑k=0∞10−⌊βk⌋;displaystyle sum _k=0^infty 10^-leftlfloor beta ^krightrfloor ;

where β↦⌊β⌋displaystyle beta mapsto lfloor beta rfloor is the floor function.

• 3.300330000000000330033... and its reciprocal 0.30300000303..., two numbers with only two different decimal digits whose nonzero digit positions are given by the Moser–de Bruijn sequence and its double.^[28]


• 
  Gauss's constant G,since π and Γ(1/4) are algebraically independent, Gauss's constant is transcendental.

Possibly transcendental numbers

Numbers which have yet to be proven to be either transcendental or algebraic:

• Most sums, products, powers, etc. of the number π and the number e, e.g. π + e, π − e, πe, π/e, π^π, e^e, π^e, π^√2, e^π2 are not known to be rational, algebraic, irrational or transcendental. A notable exception is e^π√n (for any positive integer n) which has been proven transcendental.^[29]


• The Euler–Mascheroni constant γ (which has not even been proven to be irrational).


• 
  Catalan's constant, also not known to be irrational.


• 
  Khinchin's constant, also not known to be irrational.


• 
  Apéry's constant ζ(3) (which Apéry proved is irrational).


• The Riemann zeta function at other odd integers, ζ(5), ζ(7), ... (not known to be irrational).


• The Feigenbaum constants δ and α.


• 
  Mills' constant.


• The Copeland–Erdős constant, formed by concatenating the decimal representations of prime numbers.


• 
  e^L_b and e^C_b, where L_b is the aformentioned Liouville constant and C_b is the base-b Champernowne constant

Conjectures:

• 
  Schanuel's conjecture,


• 
  Four exponentials conjecture.

Sketch of a proof that e is transcendental

The first proof that the base of the natural logarithms, e, is transcendental dates from 1873. We will now follow the strategy of David Hilbert (1862–1943) who gave a simplification of the original proof of Charles Hermite. The idea is the following:

Assume, for purpose of finding a contradiction, that e is algebraic. Then there exists a finite set of integer coefficients c₀, c₁, ..., c_n satisfying the equation:

c0+c1e+c2e2+⋯+cnen=0,c0,cn≠0.displaystyle c_0+c_1e+c_2e^2+cdots +c_ne^n=0,qquad c_0,c_nneq 0.

Now for a positive integer k, we define the following polynomial:

fk(x)=xk[(x−1)⋯(x−n)]k+1,displaystyle f_k(x)=x^kleft[(x-1)cdots (x-n)right]^k+1,

and multiply both sides of the above equation by

∫0∞fke−xdx,displaystyle int _0^infty f_ke^-x,dx,

to arrive at the equation:

c0(∫0∞fke−xdx)+c1e(∫0∞fke−xdx)+⋯+cnen(∫0∞fke−xdx)=0.displaystyle c_0left(int _0^infty f_ke^-x,dxright)+c_1eleft(int _0^infty f_ke^-x,dxright)+cdots +c_ne^nleft(int _0^infty f_ke^-x,dxright)=0.

This equation can be written in the form

P+Q=0displaystyle P+Q=0

where

P=c0(∫0∞fke−xdx)+c1e(∫1∞fke−xdx)+c2e2(∫2∞fke−xdx)+⋯+cnen(∫n∞fke−xdx)Q=c1e(∫01fke−xdx)+c2e2(∫02fke−xdx)+⋯+cnen(∫0nfke−xdx)displaystyle beginalignedP&=c_0left(int _0^infty f_ke^-x,dxright)+c_1eleft(int _1^infty f_ke^-x,dxright)+c_2e^2left(int _2^infty f_ke^-x,dxright)+cdots +c_ne^nleft(int _n^infty f_ke^-x,dxright)\Q&=c_1eleft(int _0^1f_ke^-x,dxright)+c_2e^2left(int _0^2f_ke^-x,dxright)+cdots +c_ne^nleft(int _0^nf_ke^-x,dxright)endaligned

Lemma 1. For an appropriate choice of k, Pk!displaystyle tfrac Pk! is a non-zero integer.

Proof. Each term in P is an integer times a sum of factorials, which results from the relation

∫0∞xje−xdx=j!displaystyle int _0^infty x^je^-x,dx=j!

which is valid for any positive integer j (consider the Gamma function).

It is non-zero because for every a satisfying 0< a ≤ n, the integrand in

caea∫a∞fke−xdxdisplaystyle c_ae^aint _a^infty f_ke^-x,dx

is e^−x times a sum of terms whose lowest power of x is k+1 after substituting x for x−a in the integral. Then this becomes a sum of integrals of the form

∫0∞xje−xdxdisplaystyle int _0^infty x^je^-x,dx

with k+1 ≤ j, and it is therefore an integer divisible by (k+1)!. After dividing by k!, we get zero modulo (k+1). However, we can write:

∫0∞fke−xdx=∫0∞([(−1)n(n!)]k+1e−xxk+⋯)dxdisplaystyle int _0^infty f_ke^-x,dx=int _0^infty left(left[(-1)^n(n!)right]^k+1e^-xx^k+cdots right)dx

and thus

1k!c0∫0∞fke−xdx≡c0[(−1)n(n!)]k+1≢0(modk+1).displaystyle frac 1k!c_0int _0^infty f_ke^-x,dxequiv c_0[(-1)^n(n!)]^k+1not equiv 0pmod k+1.

So when dividing each integral in P by k!, the initial one is not divisible by k+1, but all the others are, as long as k+1 is prime and larger than n and |c₀|. It follows that Pk!displaystyle tfrac Pk! itself is not divisible by the prime k+1 and therefore cannot be zero.

Lemma 2. |Qk!|<1tfrac Qk!right for sufficiently large kdisplaystyle k.

Proof. Note that

fke−x=xk[(x−1)(x−2)⋯(x−n)]k+1e−x=(x(x−1)⋯(x−n))k⋅((x−1)⋯(x−n)e−x)=u(x)k⋅v(x)displaystyle beginalignedf_ke^-x&=x^k[(x-1)(x-2)cdots (x-n)]^k+1e^-x\&=left(x(x-1)cdots (x-n)right)^kcdot left((x-1)cdots (x-n)e^-xright)\&=u(x)^kcdot v(x)endaligned

where u(x)displaystyle u(x) and v(x)displaystyle v(x) are continuous functions of xdisplaystyle x for all xdisplaystyle x, so are bounded on the interval [0,n]displaystyle [0,n]. That is, there are constants G,H>0displaystyle G,H>0 such that

|fke−x|≤|u(x)|k⋅|v(x)|<GkH for 0≤x≤n.<G^kHquad text for 0leq xleq n.

So each of those integrals composing Qdisplaystyle Q is bounded, the worst case being

|∫0nfke−xdx|≤∫0n|fke−x|dx≤∫0nGkHdx=nGkH.int _0^nf_ke^-x,dxright

It is now possible to bound the sum Qdisplaystyle Q as well:

|Q|<Gk⋅nH(|c1|e+|c2|e2+⋯+|cn|en)=Gk⋅M,e^2+cdots +

where Mdisplaystyle M is a constant not depending on kdisplaystyle k. It follows that

|Qk!|<M⋅Gkk!→0 as k→∞,<Mcdot frac G^kk!to 0quad text as kto infty ,

finishing the proof of this lemma.

Choosing a value of kdisplaystyle k satisfying both lemmas leads to a non-zero integer (P/k!displaystyle P/k!) added to a vanishingly small quantity (Q/k!displaystyle Q/k!) being equal to zero, is an impossibility. It follows that the original assumption, that edisplaystyle e can satisfy a polynomial equation with integer coefficients, is also impossible; that is, edisplaystyle e is transcendental.

The transcendence of π

A similar strategy, different from Lindemann's original approach, can be used to show that the number π is transcendental. Besides the gamma-function and some estimates as in the proof for e, facts about symmetric polynomials play a vital role in the proof.

For detailed information concerning the proofs of the transcendence of π and e, see the references and external links.

Mahler's classification

Kurt Mahler in 1932 partitioned the transcendental numbers into 3 classes, called S, T, and U.^[30] Definition of these classes draws on an extension of the idea of a Liouville number (cited above).

Measure of irrationality of a real number

One way to define a Liouville number is to consider how small a given real number x makes linear polynomials |qx − p| without making them exactly 0. Here p, q are integers with |p|, |q| bounded by a positive integer H.

Let m(x, 1, H) be the minimum non-zero absolute value these polynomials take and take:

ω(x,1,H)=−log⁡m(x,1,H)log⁡Hdisplaystyle omega (x,1,H)=-frac log m(x,1,H)log H

ω(x,1)=lim supH→∞ω(x,1,H).displaystyle omega (x,1)=limsup _Hto infty omega (x,1,H).

ω(x, 1) is often called the measure of irrationality of a real number x. For rational numbers, ω(x, 1) = 0 and is at least 1 for irrational real numbers. A Liouville number is defined to have infinite measure of irrationality. Roth's theorem says that irrational real algebraic numbers have measure of irrationality 1.

Measure of transcendence of a complex number

Next consider the values of polynomials at a complex number x, when these polynomials have integer coefficients, degree at most n, and height at most H, with n, H being positive integers.

Let m(x,n,H) be the minimum non-zero absolute value such polynomials take at x and take:

ω(x,n,H)=−log⁡m(x,n,H)nlog⁡Hdisplaystyle omega (x,n,H)=-frac log m(x,n,H)nlog H

ω(x,n)=lim supH→∞ω(x,n,H).displaystyle omega (x,n)=limsup _Hto infty omega (x,n,H).

Suppose this is infinite for some minimum positive integer n. A complex number x in this case is called a U number of degree n.

Now we can define

ω(x)=lim supn→∞ω(x,n).displaystyle omega (x)=limsup _nto infty omega (x,n).

ω(x) is often called the measure of transcendence of x. If the ω(x,n) are bounded, then ω(x) is finite, and x is called an S number. If the ω(x,n) are finite but unbounded, x is called a T number. x is algebraic if and only if ω(x) = 0.

Clearly the Liouville numbers are a subset of the U numbers. William LeVeque in 1953 constructed U numbers of any desired degree.^[31][32] The Liouville numbers and hence the U numbers are uncountable sets. They are sets of measure 0.^[33]

T numbers also comprise a set of measure 0.^[34] It took about 35 years to show their existence. Wolfgang M. Schmidt in 1968 showed that examples exist. However, almost all complex numbers are S numbers.^[35] Mahler proved that the exponential function sends all non-zero algebraic numbers to S numbers:^[36][37] this shows that e is an S number and gives a proof of the transcendence of π. The most that is known about π is that it is not a U number. Many other transcendental numbers remain unclassified.

Two numbers x, y are called algebraically dependent if there is a non-zero polynomial P in 2 indeterminates with integer coefficients such that P(x, y) = 0. There is a powerful theorem that 2 complex numbers that are algebraically dependent belong to the same Mahler class.^[32][38] This allows construction of new transcendental numbers, such as the sum of a Liouville number with e or π.

It is often speculated that S stood for the name of Mahler's teacher Carl Ludwig Siegel and that T and U are just the next two letters.

Koksma's equivalent classification

Jurjen Koksma in 1939 proposed another classification based on approximation by algebraic numbers.^[30][39]

Consider the approximation of a complex number x by algebraic numbers of degree ≤ n and height ≤ H. Let α be an algebraic number of this finite set such that |x − α| has the minimum positive value. Define ω*(x,H,n) and ω*(x,n) by:

|x−α|=H−nω∗(x,H,n)−1.displaystyle

ω∗(x,n)=lim supH→∞ω∗(x,n,H).displaystyle omega ^*(x,n)=limsup _Hto infty omega ^*(x,n,H).

If for a smallest positive integer n, ω*(x,n) is infinite, x is called a U*-number of degree n.

If the ω*(x,n) are bounded and do not converge to 0, x is called an S*-number,

A number x is called an A*-number if the ω*(x,n) converge to 0.

If the ω*(x,n) are all finite but unbounded, x is called a T*-number,

Koksma's and Mahler's classifications are equivalent in that they divide the transcendental numbers into the same classes.^[39] The A*-numbers are the algebraic numbers.^[35]

LeVeque's construction

Let

λ=13+∑k=1∞10−k!displaystyle lambda =tfrac 13+sum _k=1^infty 10^-k!

It can be shown that the nth root of λ (a Liouville number) is a U-number of degree n.^[40]

This construction can be improved to create an uncountable family of U-numbers of degree n. Let Z be the set consisting of every other power of 10 in the series above for λ. The set of all subsets of Z is uncountable. Deleting any of the subsets of Z from the series for λ creates uncountably many distinct Liouville numbers, whose nth roots are U-numbers of degree n.

Type

The supremum of the sequence ω(x, n) is called the type. Almost all real numbers are S numbers of type 1, which is minimal for real S numbers. Almost all complex numbers are S numbers of type 1/2, which is also minimal. The claims of almost all numbers were conjectured by Mahler and in 1965 proved by Vladimir Sprindzhuk.^[31]

See also

• 
  Transcendental number theory, the study of questions related to transcendental numbers


• Diophantine approximation


• 
  Periods, a set of numbers (including both transcendental and algebraic numbers) which may be defined by integral equations.

Notes

References

• 
  David Hilbert, "Über die Transcendenz der Zahlen e und πdisplaystyle pi ", Mathematische Annalen 43:216–219 (1893).


• 
  Alexander Gelfond, Transcendental and Algebraic Numbers, Dover reprint (1960).


• 
  Baker, Alan (1975). Transcendental Number Theory. Cambridge University Press. ISBN 978-0-521-20461-3. Zbl 0297.10013.
  


• 
  Mahler, Kurt (1976). Lectures on Transcendental Numbers. Lecture Notes in Mathematics. 546. Springer-Verlag. ISBN 978-3-540-07986-6. Zbl 0332.10019.
  


• 
  Sprindzhuk, Vladimir G. (1979). Metric theory of Diophantine approximations. Scripta Series in Mathematics. Transl. from the Russian and ed. by Richard A. Silverman. With a foreword by Donald J. Newman. John Wiley & Sons. Zbl 0482.10047.
  


• 
  LeVeque, William J. (2002) [1956]. Topics in Number Theory, Volumes I and II. New York: Dover Publications. ISBN 978-0-486-42539-9.
  


• 
  Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. ISBN 978-0-521-82332-6. Zbl 1086.11015.
  


• 
  Burger, Edward B.; Tubbs, Robert (2004). Making transcendence transparent. An intuitive approach to classical transcendental number theory. New York, NY: Springer-Verlag. ISBN 978-0-387-21444-3. Zbl 1092.11031.
  


• 
  Peter M Higgins, "Number Story" Copernicus Books, 2008,
  ISBN 978-1-84800-001-8.


• 
  Bugeaud, Yann (2012). Distribution modulo one and Diophantine approximation. Cambridge Tracts in Mathematics. 193. Cambridge: Cambridge University Press. ISBN 978-0-521-11169-0. Zbl 1260.11001.
  


• 
  Davison, J. Les; Shallit, Jeffrey O. (1991), "Continued fractions for some alternating series", Monatshefte für Mathematik, 111 (2): 119–126, doi:10.1007/BF01332350
  

External links

• Weisstein, Eric W. "Transcendental Number". MathWorld.


• Weisstein, Eric W. "Liouville Number". MathWorld.


• Weisstein, Eric W. "Liouville's Constant". MathWorld.


• 
  (in English) Proof that e is transcendental
  


• 
  (in English) Proof that the Liouville Constant is transcendental
  


• 
  (in German) Proof that e is transcendental (PDF)
  


• 
  (in German) Proof that π is transcendental (PDF)
  


• 
  (in German) Hilbert's 1893 paper proving that e and π are transcendental