In this post, we prove that is irrational.
Theorem 1. is irrational.
We will prove this by following the proof provided by Niven (1947). Let’s first establish a few lemmas.
Lemma 1. For integers define the functions
Then and
are integers.
Proof of Lemma 1. Since ,
. It therefore suffices to check that
is an integer for any
, which is straightforward upon using the binomial theorem:
Observe that differentiating times and setting
yields
for
. Differentiating one more time yields
Dividing by on both sides,
This yields integer values of for
.
We also need a lemma involving integrals.
Lemma 2. Following the notations in Lemma 1,
Proof of Lemma 2. A quick observation yields
Thus, integrating yields
Both integrals can be simplified using integration by parts. For ,
For ,
Therefore,
Finally, we want to upper-bound the aforementioned integral.
Lemma 3. .
Now, we can prove our main result.
Proof of Theorem 1. Suppose for a contradiction that for some positive integers
. Defining
in Lemma 1, we have
being an integer. By Lemma 3, taking sufficiently large,
Thus, is an integer strictly between
and
, a contradiction.
—Joel Kindiak, 27 Oct 24, 2034H
Leave a comment