Preprint
Article

This version is not peer-reviewed.

On the Irrationality of the Odd Zeta Values

Submitted:

20 January 2026

Posted:

21 January 2026

You are already at the latest version

Abstract
We prove the irrationality of the odd zeta values \( \zeta(2n+1),\,n\in\mathbb{N} \). Our approach is based on constructing explicit integer linear forms in \( \zeta(2n+1) \), and applying a refinement of Dirichlet's approximation theorem. We prove that the sequence of denominators produced by successive rational approximations yields infinitely many nontrivial integer relations of the type \( \Lambda_m^{(q)}=A_m^{(q)}\zeta(2n+1)-B_m^{(q)} \), with \( |\Lambda_m^{(q)}| \) (\( q \) being a parameter) decaying towards zero as \( m \) approaches infinity. This permits us to invoke a general irrationality criterion and thereby deduce that each \( \zeta(2n+1) \) is irrational. Our method combines ideas from probability theory and Diophantine approximation, and complements earlier work of Apéry, Beukers, Rivoal, and Zudilin.
Keywords: 
;  ;  ;  ;  

1. Introduction

1.1. Background and Motivation

The study of the arithmetic properties of special values of the Riemann zeta function occupies a central place in analytic number theory. Euler’s classical formulae [10]
ζ ( 2 n ) = ( 1 ) n + 1 B 2 n ( 2 π ) 2 n 2 ( 2 n ) ! , n N
express the even zeta values in terms of Bernoulli numbers and powers of π , thereby establishing both their transcendence and algebraic relations to π . In striking contrast, the arithmetic nature of the odd zeta values ζ ( 2 n + 1 ) remains largely mysterious. The pioneering breakthrough was Apéry’s proof [1,11] of the irrationality of ζ ( 3 ) , which not only settled a longstanding problem of Euler but also introduced a new paradigm for irrationality proofs through the construction of highly nontrivial linear recurrences. Subsequent refinements by Beukers [3] via integrals, and the landmark results of Rivoal [7] and Zudilin [12] showed that infinitely many odd zeta values must be irrational, and that at least one of ζ ( 5 ) , ζ ( 7 ) , ζ ( 9 ) , ζ ( 11 ) is irrational. Nevertheless, no specific irrationality result beyond Apéry’s ζ ( 3 ) has been obtained, and the question of whether ζ ( 2 n + 1 ) is irrational for n 2 remains open.
The goal of this paper is to prove general irrationality results for the odd zeta values, by applying a refined Diophantine approximation argument.

1.2. Main Theorem

We begin by stating the principal result.
Theorem 1.1 
(Main theorem). For every n N , the odd zeta value ζ ( 2 n + 1 ) is irrational.

1.3. Strategy of the Proof (Sketch)

We outline the logical structure of the proof before entering the technical details.
1.
Construction of integer linear forms. We construct for each m N an asymmetric beta kernel W m ( q ) ( x ) and its cumulative distribution function S m ( q ) ( x ) , enabling an exact integral identity linking ζ ( 2 n + 1 ) with a sequence of weighted moments L m ( q ) . Truncating the Maclaurin expansion of the polylogarithm Li 2 n + 1 ( x ) yields integer linear forms Λ m ( q ) = A m ( q ) ζ ( 2 n + 1 ) B m ( q ) , whose coefficients are made integral by a suitable least common multiple of denominators.
2.
Asymptotic decay and growth estimates. Exponential decay of the kernel tail and remainder terms is established using Stirling asymptotics and L p norms, while precise denominator growth is controlled through Legendre’s formula and the Prime Number Theorem.
3.
Application of an irrationality criterion. The balance of these estimates ensures that | Λ m ( q ) | 0 as m , permitting application of a refined Dirichlet-type irrationality criterion to prove that each ζ ( 2 n + 1 ) is irrational.

2. An Integral Representation of ζ ( 2 n + 1 )

We shall exploit the following integral representation of ζ ( 2 n + 1 ) :
ζ ( 2 n + 1 ) = 0 1 Li 2 n + 1 ( x ) d x ,
where Li s ( x ) = k = 1 x k k s denotes the polylogarithm [5].

3. Construction of Integer Linear Forms

3.1. The Beta Kernel and the Exact Integral Identity

Define the asymmetric beta kernel [4]
W m ( q ) ( x ) : = ( q + 1 ) m m x m ( 1 x ) q m , m , q N .
The corresponding probability density function on [ 0 , 1 ] is
W ˜ m ( q ) ( x ) : = Ω m ( q ) W m ( q ) ( x ) ,
where the normalization Ω m ( q ) : = ( q + 1 ) m + 1 . The cumulative distribution function is
S m ( q ) ( x ) : = 0 x W ˜ m ( q ) ( t ) d t .
Set
L m ( q ) : = 0 1 W m ( q ) ( x ) Li 2 n + 1 ( x ) d x .
Lemma 3.1 
(Exact integral identity). We have
Ω m ( q ) L m ( q ) = ζ ( 2 n + 1 ) 0 1 Li 2 n + 1 ( x ) S m ( q ) ( x ) d x .
Proof. 
Substitute Li 2 n + 1 ( x ) = 0 x Li 2 n + 1 ( t ) d t and swap the integrals:
L m ( q ) = 0 1 W m ( q ) ( x ) 0 x Li 2 n + 1 ( t ) d t d x = 0 1 Li 2 n + 1 ( t ) t 1 W m ( q ) ( x ) d x d t = 1 Ω m ( q ) 0 1 Li 2 n + 1 ( t ) [ 1 S m ( q ) ( t ) ] d t .
Multiply by Ω m ( q ) and use (1). □

3.2. Truncation and Denominator Control

By definition,
Li 2 n + 1 ( x ) = k = 1 x k k 2 n + 1 .
Multiplying by W m ( q ) and integrating termwise (justified by uniform convergence on [ 0 , 1 ] ) gives
L m ( q ) = k = 1 1 k 2 n + 1 ( q + 1 ) m m B ( m + k + 1 , q m + 1 ) = k = 1 1 k 2 n + 1 ( ( q + 1 ) m ) ! ( m + k ) ! m ! ( ( q + 1 ) m + k + 1 ) !
= k = 1 F m , k ( q ) k 2 n + 1 ,
where
F m , k ( q ) : = ( ( q + 1 ) m ) ! ( m + k ) ! m ! ( ( q + 1 ) m + k + 1 ) ! ,
and we used B ( a , b ) = Γ ( a ) Γ ( b ) Γ ( a + b ) to simplify.
Fix a truncation parameter K = K ( m ) and split
L m ( q ) = L m ( q ) ( K ) + L m ( q ) ( > K ) ,
where L m ( q ) ( K ) : = k = 1 K F m , k ( q ) k 2 n + 1 and L m ( q ) ( > K ) : = k > K F m , k ( q ) k 2 n + 1 . Let den ( x ) be the denominator of the rational number x written in lowest terms. Define
D m ( q ) : = lcm 1 k K den F m , k ( q ) k 2 n + 1 .
Lemma 3.2 
(Integer linear form). With
A m ( q ) : = D m ( q ) Z ,
B m ( q ) : = Ω m ( q ) D m ( q ) L m ( q ) ( K ) Z ,
we have
Λ m ( q ) : = A m ( q ) ζ ( 2 n + 1 ) B m ( q ) = Ω m ( q ) D m ( q ) L m ( q ) ( > K ) + D m ( q ) 0 1 Li 2 n + 1 ( x ) S m ( q ) ( x ) d x .
Proof. 
Multiply (6) by D m ( q ) and substitute L m ( q ) = L m ( q ) ( K ) + L m ( q ) ( > K ) . The choice (10) guarantees every B m ( q ) is an integer (the least common multiple clears all denominators k 2 n + 1 for k K and all factorial denominators up to ( q + 1 ) m + K + 1 ). □
Thus, Λ m ( q ) = A m ( q ) ζ ( 2 n + 1 ) B m ( q ) is our integer linear form in ζ ( 2 n + 1 ) . Equation (13) guarantees that Λ m ( q ) > 0 .

4. Analytic Estimates for the Linear Forms

This section proves that the constructed linear forms tend to zero as m .

4.1. Exponential Decay of the Kernel Tail

Using Stirling asymptotics and large-deviation estimates, we show that the truncated tail contributes an exponentially small error.
Lemma 4.1 
(Kernel tail). There exist parameters α , γ ( q ) ( α ) , C 1 ( α , m , q ) , C 2 ( α , q ) > 0 , such that for m > C 2 ( α , q ) ,
| Ω m ( q ) L m ( q ) ( > K ) | C 1 ( α , m , q ) 1 C 2 ( α , q ) m 1 e γ ( q ) ( α ) m .
Proof. 
Set k = σ m , where σ > 0 is a scaling parameter. Using the Stirling estimate
log N ! = N log N N + O ( log N ) ,
we get
log F m , k ( q ) = log ( ( q + 1 ) m ) ! + log ( m + k ) ! log m ! log ( ( q + 1 ) m + k + 1 ) ! = m ϕ ( q ) ( σ ) + O ( log m ) ,
where
ϕ ( q ) ( σ ) : = ( 1 + q ) log ( 1 + q ) + ( 1 + σ ) log ( 1 + σ ) ( 1 + q + σ ) log ( 1 + q + σ )
is a rate function, which is strictly decreasing on ( 0 , ) . Since ϕ ( q ) ( 0 ) = 0 , this implies ϕ ( q ) ( σ ) < 0 for all σ > 0 . Thus,
F m , k ( q ) k 2 n + 1 m O ( 1 ) e m ϕ ( q ) ( σ ) .
Let K : = α m , for some fixed real α > 0 . Then,
| L m ( q ) ( > K ) | m O ( 1 ) k > α m e m ϕ ( q ) ( σ ) m O ( 1 ) α m e m ϕ ( q ) x m d x = m O ( 1 ) α e m ϕ ( q ) ( σ ) d σ .
Since
d d σ e m ϕ ( q ) ( σ ) = m ϕ ( q ) ( σ ) e m ϕ ( q ) ( σ ) ,
an integration by parts gives
α e m ϕ ( q ) ( σ ) d σ = e m ϕ ( q ) ( α ) m ϕ ( q ) ( α ) + 1 m α ϕ ( q ) ( σ ) ϕ ( q ) ( σ ) 2 e m ϕ ( q ) ( σ ) d σ .
The remainder integral may be bounded as
α ϕ ( q ) ( σ ) ϕ ( q ) ( σ ) 2 e m ϕ ( q ) ( σ ) d σ sup σ α ϕ ( q ) ( σ ) ϕ ( q ) ( σ ) 2 α e m ϕ ( q ) ( σ ) d σ = C 2 ( α , q ) α e m ϕ ( q ) ( σ ) d σ ,
where
C 2 ( α , q ) : = sup σ α ϕ ( q ) ( σ ) ϕ ( q ) ( σ ) 2 .
Note that C 2 ( α , q ) is finite, since for σ α > 0 ,
ϕ ( q ) ( σ ) = log 1 + σ 1 + q + σ < 0 , ϕ ( q ) ( σ ) = q ( 1 + σ ) ( 1 + q + σ ) > 0 ;
both are continuous on [ α , ) . Moreover, both ϕ ( q ) ( σ ) and ϕ ( q ) ( σ ) tend to zero as σ ; an application of L’Hôpital’s rule shows that this limit is 1 q . So, ϕ ( q ) ϕ ( q ) 2 is continuous and bounded on [ α , ) . Therefore, we get
α e m ϕ ( q ) ( σ ) d σ e m ϕ ( q ) ( α ) m ϕ ( q ) ( α ) + C 2 ( α , q ) m α e m ϕ ( q ) ( σ ) d σ ,
or,
1 C 2 ( α , q ) m α e m ϕ ( q ) ( σ ) d σ e m ϕ ( q ) ( α ) m ϕ ( q ) ( α ) .
Since 1 C 2 ( α , q ) m > 0 for all m > C 2 ( α , q ) , we get
α e m ϕ ( q ) ( σ ) d σ e m ϕ ( q ) ( α ) m ϕ ( q ) ( α ) 1 C 2 ( α , q ) m 1 = e m ϕ ( q ) ( α ) m log 1 + q + α 1 + α 1 C 2 ( α , q ) m 1 .
Therefore,
| L m ( q ) ( > K ) | m O ( 1 ) e m ϕ ( q ) ( α ) log 1 + q + α 1 + α 1 C 2 ( α , q ) m 1 .
Defining
C 1 ( α , m , q ) : = Ω m ( q ) m O ( 1 ) log 1 + q + α 1 + α
and γ ( q ) ( σ ) : = ϕ ( q ) ( σ ) (so γ ( q ) ( σ ) is positive and increasing on ( 0 , ) ), we get
| Ω m ( q ) L m ( q ) ( > K ) | C 1 ( α , m , q ) 1 C 2 ( α , q ) m 1 e γ ( q ) ( α ) m .

4.2. Control of the Remainder Term

Using finite difference operators and L 1 / L bounds, we prove that the remainder integral also decays exponentially.
Lemma 4.2 
(Remainder term). There exist parameters C 3 ( m , q ) > 0 , 0 < δ < 1 such that
0 1 Li 2 n + 1 ( x ) S m ( q ) ( x ) d x C 3 ( m , q ) δ m m + δ m .
Proof. 
We adopt the convention that all L 1 / L norms are defined on [ 0 , 1 ] . Then, we have
0 1 Li 2 n + 1 ( x ) S m ( q ) ( x ) d x Li 2 n + 1 S m ( q ) 1 ,
where
Li 2 n + 1 ( x ) = k = 1 x k 1 k 2 n .
For 0 x 1 , x k 1 k 2 n 1 k 2 n ; therefore,
| Li 2 n + 1 ( x ) | k = 1 1 k 2 n = ζ ( 2 n ) ,
which particularly implies
Li 2 n + 1 ζ ( 2 n ) .
Now consider the finite mth backward difference with step h[6], applied to S m ( q ) :
h m S m ( q ) ( x ) : = k = 0 m m k ( 1 ) k S m ( q ) ( x k h ) .
Appendix A proves the following properties of h m S m ( q ) :
h m S m ( q ) 1 h m S m ( q ) ( m ) 1 , S m ( q ) h m S m ( q ) 1 ( h m ) m S m ( q ) ( m ) 1 .
By definition, S m ( q ) ( m ) = W ˜ m ( q ) ( m 1 ) . For the asymmetric beta density, using the Leibniz rule,
d m 1 d x m 1 [ x m ( 1 x ) q m ] = k = 0 m 1 m 1 k ( m ) k ( q m ) m 1 k ( 1 ) m 1 k x m k ( 1 x ) q m ( m 1 k ) ,
where ( m ) k is the falling factorial. Taking absolute values and integrating:
0 1 d m 1 d x m 1 [ x m ( 1 x ) q m ] d x k = 0 m 1 m 1 k ( m ) k ( q m ) m 1 k B ( m k + 1 , ( q 1 ) m + k + 2 ) k = 0 m 1 m 1 k ( m ) k ( q m ) m 1 k Γ ( m k + 1 ) Γ ( ( q 1 ) m + k + 2 ) Γ ( q m + 3 ) = 2 m 1 Γ ( m + 1 ) Γ ( q m + 1 ) Γ ( q m + 3 ) .
Multiplying by the normalization Ω m ( q ) ( q + 1 ) m m gives us W ˜ m ( q ) :
W ˜ m ( q ) ( m 1 ) 1 Ω m ( q ) ( q + 1 ) m m 2 m 1 m ! ( q m ) ! ( q m + 2 ) ! = Ω m ( q ) 2 m 1 ( ( q + 1 ) m ) ! ( q m + 2 ) ! .
Hence,
S m ( q ) ( m ) 1 Ω m ( q ) 2 m ( ( q + 1 ) m ) ! ( q m ) ! .
From [8], we obtain the Stirling–Robbins bounds
2 π N N + 1 2 e N + 1 12 N + 1 N ! 2 π N N + 1 2 e N + 1 12 N .
Therefore,
S m ( q ) ( m ) 1 c 1 ( m , q ) 1 + 1 q q m 2 ( q + 1 ) m e m c 1 ( m , q ) [ 2 ( q + 1 ) m ] m ,
where
c 1 ( m , q ) : = Ω m ( q ) q + 1 q exp 1 12 ( q + 1 ) m 1 12 q m + 1 .
From the trivial rearrangement S m ( q ) ( x ) = h m S m ( q ) ( x ) + [ S m ( q ) ( x ) h m S m ( q ) ( x ) ] , we obtain the norm inequality
S m ( q ) 1 h m S m ( q ) 1 + S m ( q ) h m S m ( q ) 1 .
Applying the properties of h m S m ( q ) gives
S m ( q ) 1 c 1 ( m , q ) [ { 2 ( q + 1 ) h m } m + { 2 ( q + 1 ) h m 2 } m ] .
Set δ : = 2 ( q + 1 ) h m 2 for a fixed real δ ( 0 , 1 ) . Then,
S m ( q ) 1 c 1 ( m , q ) δ m m + δ m .
Combining (17), (18) and the inequality above, we get
0 1 Li 2 n + 1 ( x ) S m ( q ) ( x ) d x C 3 ( m , q ) δ m m + δ m ,
where C 3 ( m , q ) : = ζ ( 2 n ) c 1 ( m , q ) . □
Finally, combining (13), (14), (16), we obtain
| Λ m ( q ) | D m ( q ) C 1 ( α , m , q ) 1 C 2 ( α , q ) m 1 e γ ( q ) ( α ) m + D m ( q ) C 3 ( m , q ) δ m m + δ m .

4.3. Growth of Denominators

Recall Legendre’s formula [2], which gives the exponent of a prime p in N ! :
ν p ( N ! ) = j = 1 log p N N p j .
For any integers N , a 0 , we have for each j,
a p j N + a p j N p j a p j + 1 .
Compute
ν p ( F m , k ( q ) ) = ν p ( ( ( q + 1 ) m ) ! ) ν p ( ( m + k ) ! ) + ν p ( m ! ) + ν p ( ( ( q + 1 ) m + k + 1 ) ! ) = [ ν p ( ( ( q + 1 ) m + k + 1 ) ! ) ν p ( ( ( q + 1 ) m ) ! ) ] [ ν p ( ( m + k ) ! ) ν p ( m ! ) ] [ ν p ( ( k + 1 ) ! ) + log p ( ( q + 1 ) m + k + 1 ) ] ν p ( k ! ) = ν p ( k + 1 ) + log p ( ( q + 1 ) m + k + 1 ) .
Since den ( F m , k ( q ) ) = p p max ( 0 , ν p ( F m , k ( q ) ) ) , the above inequality results in
den ( F m , k ( q ) ) | ( k + 1 ) p p log p ( ( q + 1 ) m + k + 1 ) = ( k + 1 ) lcm ( 1 , 2 , , ( q + 1 ) m + k + 1 ) .
Taking the least common multiple over 1 k K , one gets a bound of the form
D m ( q ) | lcm ( 1 , 2 , , K + 1 ) κ + 1 lcm ( 1 , 2 , , ( q + 1 ) m + K + 1 ) ,
where κ : = 2 n + 1 . With K = α m and lcm ( 1 , 2 , , N ) = e ψ ( N ) (where ψ ( N ) is the Chebyshev psi function), we obtain the Rosser–Schoenfeld bound [9]
D m ( q ) exp ( [ ( κ + 1 ) ( α m + 2 ) + ( 1 + q + α ) m + 2 ] [ 1 + o ( 1 ) ] ) = c 2 exp ( ( 1 + q + λ α ) m [ 1 + o ( 1 ) ] ) ,
where c 2 : = exp ( ( 2 κ + 4 ) [ 1 + o ( 1 ) ] ) and λ : = κ + 2 .

5. Proof of the Main Theorem

5.1. Parameter Selection

From (22), for exponential decay to zero, we must ensure that
1 + q + λ α < min ( γ ( q ) ( α ) , log δ ) .
Lemma 5.1 
(Existence of admissible parameters). With λ > 0 , there exist parameters q N , δ ( 0 , 1 ) , α > 0 which satisfy (24).
Proof. 
We first solve the inequality
1 + q + λ α < γ ( q ) ( α ) = ( 1 + q ) log ( 1 + q ) ( 1 + α ) log ( 1 + α ) + ( 1 + q + α ) log ( 1 + q + α ) .
Let
g ( α ) : = 1 + q + λ α + ( 1 + q ) log ( 1 + q ) + ( 1 + α ) log ( 1 + α ) ( 1 + q + α ) log ( 1 + q + α ) .
We want the set of α > 0 with g ( α ) < 0 . We have
g ( α ) = λ log 1 + q + α 1 + α , g ( α ) = q ( 1 + α ) ( 1 + q + α ) > 0 .
So, g is strictly increasing and g is strictly convex on ( 0 , ) . Since g ( 0 ) = 1 + q > 0 and the initial slope is g ( 0 ) = λ log ( 1 + q ) , we have the following two cases:
1.
If λ log ( 1 + q ) , then g ( 0 ) 0 . Since g is convex and g ( 0 ) > 0 , we then have g ( α ) > 0 for all α > 0 . Hence, no positive α satisfies the inequality.
2.
If λ < log ( 1 + q ) , then g ( 0 ) < 0 . By convexity, g increases from g ( 0 ) < 0 to lim α g ( α ) = λ > 0 ; so, there is exactly one α * > 0 with g ( α * ) = 0 . The value of α * is
α * = q e λ 1 1 ,
and with this,
( g ( α * ) ) ( λ , q ) = ( 1 + q ) [ 1 + log ( 1 + q ) λ ] q log q e λ 1 .
At small positive α , we have g ( α ) > 0 , while g ( α ) as α ; hence, for there to exist a pair of positive roots of g ( α ) = 0 , we require that g ( α * ) < 0 . Differentiating with respect to λ , we find that λ g ( α * ) = q e λ 1 1 > 0 ; this means that g ( α * ) is strictly increasing in λ on ( 0 , log ( 1 + q ) ) . Since lim λ 0 + g ( α * ) = and lim λ log ( 1 + q ) g ( α * ) = 1 + q > 0 , by continuity and strict monotonicity in λ , there exists a unique λ * ( 0 , log ( 1 + q ) ) such that ( g ( α * ) ) ( λ * , q ) = 0 . Therefore, for 0 < λ < λ * , g has exactly two positive roots α 1 , α 2 (with 0 < α 1 < α * < α 2 ). Thus, the solution set of the strict inequality is the interval α 1 < α < α 2 .
From the second case, the requirement is λ < log ( 1 + q ) , or q > e λ 1 . Fix such a q. Then, there exists an interval ( α 1 , α 2 ) such that 1 + q + λ α < γ ( q ) ( α ) for all α ( α 1 , α 2 ) . Fix any α in this interval. Then, it suffices to choose δ small enough so that 1 + q + λ α < log δ ; this guarantees (24). □

5.2. Irrationality Criterion and Completion of the Proof

With (24) satisfied, | Λ m ( q ) | 0 as m . This places us precisely within the framework of the following general criterion.
Theorem 5.1 
(Irrationality criterion). Let x R . Suppose there exist infinitely many integers A m 0 and B m , such that
0 < | Λ m | = | A m x B m | ϵ m ,
where ϵ m 0 as m . Then, x is irrational.
Proof. 
Assume that x = p * q * Q is in lowest terms. Then,
| Λ m | = | A m p * B m q * | | q * | .
Hence, for every m, either | Λ m | = 0 or | Λ m | 1 | q * | . By (25), | Λ m | ϵ m 0 as m . So, for all sufficiently large m, we have ϵ m < 1 | q * | , contradicting the dichotomy above. Therefore, x cannot be rational. □
We thus conclude that each ζ ( 2 n + 1 ) is irrational. This completes the proof of Theorem 1.1.

Appendix A. Proof of h m S m ( q ) 1 h m S m ( q ) ( m ) 1 and S m ( q ) h m S m ( q ) 1 (hm ) m S m ( q ) ( m ) 1

Proof. 
We have
h 1 S m ( q ) ( x ) = S m ( q ) ( x ) S m ( q ) ( x h ) = 0 h S m ( q ) ( x t 1 ) d t 1 .
Applying induction, we arrive at the box-averaged representation
h m S m ( q ) ( x ) = ( 1 ) m 0 h 0 h S m ( q ) ( m ) ( x t 1 t m ) d t 1 d t m = ( 1 ) m [ 0 , h ] m S m ( q ) ( m ) ( x t ) d m t ,
where t : = t 1 + + t m and d m t : = d t 1 d t m .
Take absolute values and integrate in x. By Fubini’s theorem, we get
h m S m ( q ) 1 = 0 1 [ 0 , h ] m S m ( q ) ( m ) ( x t ) d m t d x [ 0 , h ] m 0 1 | S m ( q ) ( m ) ( x t ) | d x d m t [ 0 , h ] m S m ( q ) ( m ) 1 d m t = S m ( q ) ( m ) 1 [ 0 , h ] m d m t = h m S m ( q ) ( m ) 1 .
Now, consider the Taylor series of S m ( q ) ( x k h ) expanded to the first m terms:
S m ( q ) ( x k h ) = j = 0 m 1 ( k h ) j j ! S m ( q ) ( j ) ( x ) + ( k h ) m ( m 1 ) ! 0 1 ( 1 θ ) m 1 S m ( q ) ( m ) ( x k h θ ) d θ .
The mth backward difference annihilates polynomials up to degree m 1 ; that is,
k = 0 m ( 1 ) k m k k j = 0 , j = 0 , 1 , , m 1 .
Hence, we get
S m ( q ) ( x ) h m S m ( q ) ( x ) = j = 0 m 1 ( h ) j j ! S m ( q ) ( j ) ( x ) k = 1 m ( 1 ) k m k k j ( h ) m ( m 1 ) ! 0 1 ( 1 θ ) m 1 k = 1 m ( 1 ) k m k k m S m ( q ) ( m ) ( x k h θ ) d θ = ( h ) m ( m 1 ) ! 0 1 ( 1 θ ) m 1 k = 1 m ( 1 ) k m k k m S m ( q ) ( m ) ( x k h θ ) d θ .
Take absolute values and integrate:
S m ( q ) h m S m ( q ) 1 h m m ! k = 1 m m k k m S m ( q ) ( m ) 1 .
Since k = 1 m m k k m ( 2 m ) m , and 2 m m ! for m 4 ,
S m ( q ) h m S m ( q ) 1 ( h m ) m S m ( q ) ( m ) 1
for those m. □

References

  1. R. Apéry, Irrationalité de ζ2 et ζ3. Astérisque 1979, 61, 11–13. Available online: https://smf.emath.fr/system/files/filepdf/AS-61.pdf.
  2. Apostol, T. M. Introduction to Analytic Number Theory; Springer-Verlag: New York, 1976. [Google Scholar]
  3. F. Beukers, A note on the irrationality of ζ(2) and ζ(3). Bull. London Math. Soc. 1979, 11, 268–272. [CrossRef]
  4. Chen, S. X. Beta kernel estimators for density functions. Comput. Stat. Data Anal. 1999, 31, 131–145. [Google Scholar] [CrossRef]
  5. Lewin, L. Polylogarithms and Associated Functions; North-Holland, 1981. [Google Scholar]
  6. Nørlund, N. E. Vorlesungen über Differenzenrechnung; Springer-Verlag: Berlin, 1924. [Google Scholar]
  7. Rivoal, T. La fonction zêta de Riemann prend une infinité de valeurs irrationnelles aux entiers impairs. C. R. Acad. Sci. Ser. I Math. 2000, 331, 267–270. [Google Scholar] [CrossRef]
  8. H. Robbins, A Remark on Stirling’s Formula. Amer. Math. Monthly 1955, 62, 26–29. [CrossRef]
  9. Rosser, J. B.; Schoenfeld, L. Approximate formulas for some functions of prime numbers. Illinois J. Math. 1962, 6, 64–94. [Google Scholar] [CrossRef]
  10. The Theory of the Riemann Zeta-Function, 2nd ed.; Titchmarsh, E. C., Heath-Brown, D. R., Eds.; Oxford University Press, 1986. [Google Scholar]
  11. van der Poorten, A. A proof that Euler missed: Apéry’s proof of the irrationality of ζ(3). Math. Intell. 1979, 1, 195–203. [Google Scholar] [CrossRef]
  12. Zudilin, W. One of the numbers ζ(5), ζ(7), ζ(9), ζ(11) is irrational. Uspekhi Mat. Nauk 2001, 56, 149–150. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated