Next Article in Journal
Trajectory Tracking Closed-Loop Cooperative Control of Manipulator Neural Network and Terminal Sliding Model
Previous Article in Journal
Neuromuscular Activation and Symmetry in Isometric Squats: Comparing Stable and Unstable Surfaces
Previous Article in Special Issue
From Complex to Quaternions: Proof of the Riemann Hypothesis and Applications to Bose–Einstein Condensates
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Novel Finite Sum Identities Involving Reciprocals of Binomial Coefficients

1
Department of Mathematics, Nevşehir Hacı Bekta Veli University, Nevşehir 50300, Turkey
2
Department of Mathematics, Dongguk University, Gyeongju 38066, Republic of Korea
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(8), 1318; https://doi.org/10.3390/sym17081318
Submission received: 13 July 2025 / Revised: 3 August 2025 / Accepted: 5 August 2025 / Published: 14 August 2025

Abstract

Finite sums involving reciprocals of binomial coefficients have long intrigued mathematicians, owing to their elegant structure and unexpected identities. In this work, we present a comprehensive general formula that unifies and extends several results previously studied in the literature. To demonstrate the breadth and utility of our approach, we also investigate a variety of significant special cases, shedding light on deeper patterns and connections. This unified perspective aims to appeal to researchers interested in combinatorics, number theory, and special functions.

1. Introduction and Preliminaries

The binomial coefficient z k is defined for z C and k Z 0 by
z k = z ( z 1 ) ( z k + 1 ) k ! = Γ ( z + 1 ) Γ ( z k + 1 ) Γ ( k + 1 ) ,
where Γ ( z ) denotes the classical gamma function. In particular, when z = n Z 0 , the binomial coefficient reduces to the familiar form
n k = n ! k ! ( n k ) ! n , k Z 0 ,
with the convention 0 ! : = 1 . For a historical overview of the binomial coefficients and a detailed treatment of related fundamental identities, such as
z + 1 k = z k + z k 1 , and z + 1 k + 1 z k = z + 1 k + 1 ,
see Jordan [1] (§§ 22–23).
Using a known identity along with mathematical induction, Sun [2] established the following formula:
k = 1 n 1 k 2 n + k k = 3 k = 1 n 1 k 2 2 k k k = 1 n 1 k 2 ( n N ) .
Throughout this work, we use C , Z , and N to denote the sets of complex numbers, integers, and positive integers, respectively. Also, for a given Z , we use Z (or Z > and Z (or Z < )) to denote the sets of integers greater than or equal to (or strictly greater than) , and less than or equal to (or strictly less than) , respectively. As illustrated by (3), finite or infinite sums involving reciprocals of binomial coefficients have attracted considerable interest due to their rich structure and surprising properties (see, for example, [3] (Equations (2.1)–(2.26), (4.1)–(4.30) and (5.1) and (5.2))).
Gould [3] (Equation (2.12)) presented an infinite analogue of identity (3):
k = 1 1 k 2 n + k k = ζ ( 2 ) H n ( 2 ) , ( n N ) ,
where ζ ( s ) denotes the classical Riemann zeta function, defined by
ζ ( s ) = k = 1 1 k s ( ( s ) > 1 ) ,
and H n ( 2 ) is the second-order harmonic number. The generalized harmonic number of order α is defined as
H n ( α ) : = k = 1 n 1 k α ( α C , n N ) .
By convention, H 0 ( α ) : = 0 , and when α = 1 , H n ( 1 ) = H n denotes the nth harmonic number.
Combining (3) with the identity given in [3] (Equation (5.1)) yields the following result for n N :
k = 1 1 k 2 n + k k 2 = 2 n n ζ ( 2 ) H n ( 2 ) k = 1 n 1 k 2 n + k k = 2 n n k = n + 1 1 k 2 n + k k = 2 n n ζ ( 2 ) + H n 2 H n ( 2 ) + k = 1 n ( 1 ) k k H n + k ,
where identities (4) and (6) are applied in the second and third equalities, respectively.
Batır and Sofo [4] presented several finite sum identities involving the reciprocals of binomial and central binomial coefficients, along with harmonic numbers, Fibonacci numbers, and Lucas numbers.
Sprugnoli [5] investigated combinatorial sums involving reciprocals of central binomial coefficients, deriving several infinite and finite sum results—some involving the golden ratio—using generating functions and the method of coefficients.
Batır and Chen [6] established a general combinatorial formula involving reciprocals of binomial coefficients and partial sums of arbitrary sequences, from which they derived numerous identities—some previously known and others new—featuring reciprocals of binomial and central binomial coefficients and harmonic numbers.
Apéry [7] used the rapidly converging alternating series
ζ ( 3 ) = 5 2 k = 1 ( 1 ) k 1 k 3 2 k k
involving reciprocals of central binomial coefficients to prove the irrationality of ζ ( 3 ) .
Guillera [8] derived a remarkably fast-converging series for the Catalan constant G, involving reciprocals of central binomial coefficients:
G = k = 0 ( 1 ) k ( 3 k + 2 ) 2 3 k 1 ( 2 k + 1 ) 3 2 k k 3 ,
a value classically defined by the alternating series
G = k = 0 ( 1 ) k ( 2 k + 1 ) 2 = 0.915965594177219015 .
For other similar fast-converging series, see [9].
Sofo and Batır [10] presented an alternative expression for the left-hand side of identity (3). For n N ,
k = 1 n 1 k 2 n + k k = H n 2 k = 1 n ( 1 ) k k H n + k .
It follows from (3) and (6) that
k = 1 n 1 k 2 2 k k = H n ( 2 ) H n 2 3 1 3 k = 1 n ( 1 ) k k H n + k ( n N ) .
Batır and Choi [11] investigated the following sums:
k = 1 m ϵ k k p n + k k and k = 1 m ϵ k H k k p n + k k ,
where m , n N , ϵ { 1 , 1 } , and p { 0 , 1 } .
In this paper, we derive an explicit formula for a broad class of generalized sums of the form
k = 1 n Γ k k p r + n + k k ,
where p N , n N , and r C Z 1 . Here, Γ n : = γ 1 + γ 2 + + γ n , with { γ k } k N denoting an arbitrary sequence of complex numbers. Notably, this general expression reduces to known identities under specific parameter choices; for instance, the first sum in (7) becomes (3) when r = 0 , p = 2 , γ 1 = 1 , and γ n = 0 for all n Z 2 .
In Section 2, we present the main identity (Theorem 1) and its derivation. Section 3 is devoted to examining the three particular cases p = 1 , 2 , 3 , as detailed in Corollaries 1–3. In particular, Corollary 1 offers an alternative explicit formula for the case p = 1 , accompanied by a direct proof.
Section 4 investigates further concrete examples of the identity by selecting specific sequences for { γ j } j N , thereby illustrating the flexibility of our general framework.
In Section 5, we differentiate the results from Corollaries 1–3 with respect to the parameter r, leading to new identities involving sums of reciprocals of binomial coefficients. These are formalized in Propositions 1–3, and are complemented by several interesting special cases.
Finally, Section 6 concludes the paper by highlighting the depth and adaptability of the central identity presented in Theorem 1.
For completeness, we also introduce several auxiliary functions, including extensions of the classical harmonic numbers H n and generalized harmonic numbers H n ( α ) , as discussed in [12,13] (Section 1.3). The psi (or digamma) function, denoted by ψ , is defined as the logarithmic derivative of the gamma function Γ ( z ) :
ψ ( z ) : = Γ ( z ) Γ ( z ) z C Z 0 .
The harmonic number H n is expressed in term of the digamma function as follows:
H n = ψ ( n + 1 ) + γ ( n N ) ,
where γ = lim n ( H n log n ) = 0.57721 is the Euler–Mascheroni constant (see, for example, [13] (Section 1.2) and [14], and the references therein). Since the psi function ψ ( z ) is defined on C Z 0 , the harmonic number H n admits the following extension to the complex domain:
H μ = ψ ( μ + 1 ) + γ μ C Z 1 .
For non-integer values of the order n, such as a complex number μ C , the generalized harmonic number H μ ( m + 1 ) can be defined in terms of the polygamma function
ψ ( n ) ( z ) : = d n d z n ψ ( z ) = d n + 1 d z n + 1 log Γ ( z ) , n Z 0 ,
where Γ ( z ) is the gamma function and ψ ( z ) is the digamma function. This definition gives
H μ ( m + 1 ) = ζ ( m + 1 ) + ( 1 ) m m ! ψ ( m ) ( μ + 1 ) ,
for m N and μ C Z 1 , where ζ ( z ) denotes the Riemann zeta function. In the special case when m = 0 , (10) reduces to H μ ( 1 ) = H μ , where H μ is the extended harmonic number of order μ in (9).
This method of extending harmonic and generalized harmonic numbers, pioneered by Sofo and Srivastava [12], has proven to be remarkably fruitful. It not only deepens our understanding of these classical objects but also opens the door to a wealth of elegant identities, particularly those related to classical Euler sums.
By applying the logarithmic derivative and invoking identity (8), we obtain the following formula:
d d z z + a k 1 = z + a k 1 ψ ( z + a k + 1 ) ψ ( z + a + 1 ) = z + a k 1 H z + a k H z + a ,
where (9) is employed for the second equality.
We remark that Pascal’s Triangle exhibits symmetry about its central vertical axis. This property arises from the fundamental combinatorial identity
n k = n n k ,
which asserts that, in the nth row, the kth entry from the left equals the ( n k ) th entry from the right. As a result, each row forms a palindromic sequence, reading identically in both directions.
That is, in row n, the kth entry from the left is equal to the ( n k ) th entry from the right. Consequently, each row of Pascal’s Triangle is palindromic, reading identically from left to right and right to left. The identities and results developed in this paper are deeply connected to this underlying combinatorial symmetry. Many of the recurrence relations and binomial identities we derive inherently reflect this structural balance. Notably, Equation (11) itself exhibits a form of symmetry: differentiating its left-hand side with respect to the parameter a yields a result that mirrors the differentiation on the right-hand side, reinforcing the symmetrical behavior of the underlying functions.
This alignment between structural symmetry in binomial coefficients and the analytic properties of the identities we explore highlights this paper’s thematic relevance to the broader concept of symmetry in mathematical analysis and combinatorics.

2. Main Result

This section starts with an identity which links reciprocal of binomial coefficients, weighted sums, and arbitrary sequences. We need the following lemma.
Lemma 1.
Let x C { 0 } be fixed, and let a C { 0 , x } . For any Z 0 , the following partial fraction decomposition holds:
1 x ( x + a ) = μ = 1 ( 1 ) μ 1 a μ x μ + 1 + ( 1 ) a ( x + a ) .
By convention, an empty sum is taken to be zero.
Proof. 
The identity can be established by mathematical induction on . The proof is straightforward and thus omitted. □
Theorem 1.
Let { γ j } j N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Also, let p N and r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k k p n + r + k k = μ = 1 p 2 k = 1 n ( 1 ) μ ( k + r ) μ j = 1 k 1 Γ j j p μ r + k + j 1 j + k = 1 n ( 1 ) p 1 ( k + r ) p 1 j = 1 k γ j j r + k + j 1 j Γ k k r + 2 k 1 k   + k = 1 n Γ k k p r + 2 k k .
Proof. 
Consider the following sum:
k = 1 n Γ k k p n + r + k k , ( p N ) .
We define
Ω k = j = 1 k Γ j j p k + r + j j .
Then
Ω k + 1 Ω k = j = 1 k + 1 Γ j j p k + r + j + 1 j j = 1 k Γ j j p k + r + j j = j = 1 k Γ j j p 1 k + r + j + 1 j 1 k + r + j j + Γ k + 1 ( k + 1 ) p 2 k + r + 2 k + 1 .
Applying (2), we find that
1 k + r + j + 1 j 1 k + r + j j = j ( k + r + j + 1 ) k + r + j j .
Then, we have
Ω k + 1 Ω k = j = 1 k Γ j j p 1 ( k + r + j + 1 ) k + r + j j + Γ k + 1 ( k + 1 ) p 2 k + r + 2 k + 1 = μ = 1 p 1 ( 1 ) μ ( k + r + 1 ) μ j = 1 k Γ j j p μ r + k + j j + ( 1 ) p ( k + r + 1 ) p 1 j = 1 k Γ j ( j + k + r + 1 ) r + k + j j + Γ k + 1 ( k + 1 ) p r + 2 k + 2 k + 1 ,
where the identity (12) is used for the second equality.
Using the second identity in (2), we get
( r + k + j + 1 ) r + k + j j = ( j + 1 ) r + k + j + 1 j + 1 .
Applying this formula, we find that
j = 1 k Γ j ( r + k + j + 1 ) r + k + j j = j = 1 k Γ j ( j + 1 ) r + k + j + 1 j + 1 = j = 2 k + 1 Γ j 1 j r + k + j j .
Since Γ 0 is an empty sum and is regarded as zero, with the aid of Γ j 1 = Γ j γ j , we derive
j = 1 k Γ j ( r + k + j + 1 ) r + k + j j = j = 1 k + 1 Γ j 1 j r + k + j j = j = 1 k + 1 Γ j j r + k + j j j = 1 k + 1 γ j j r + k + j j   = j = 1 k Γ j j r + k + j j j = 1 k + 1 γ j j r + k + j j + Γ k + 1 ( k + 1 ) r + 2 k + 1 k + 1 .
Substituting this final identity in (14), we obtain
Ω k + 1 Ω k = μ = 1 p 2 ( 1 ) μ ( k + r + 1 ) μ j = 1 k Γ j j p μ r + k + j j + ( 1 ) p ( k + r + 1 ) p 1 j = 1 k + 1 γ j j r + k + j j + Γ k + 1 ( k + 1 ) r + 2 k + 1 k + 1 + Γ k + 1 ( k + 1 ) p r + 2 k + 2 k + 1 ,
Summing both sides from k = 0 to k = n 1 , the left-hand side telescopes to
Ω n Ω 0 = Ω n ,
since Ω 0 is an empty sum. Thus, we arrive at
Ω n = μ = 1 p 2 k = 1 n ( 1 ) μ ( k + r ) μ j = 1 k 1 Γ j j p μ r + k + j 1 j + k = 1 n ( 1 ) p 1 ( k + r ) p 1 j = 1 k γ j j r + k + j 1 j Γ k k r + 2 k 1 k + k = 1 n Γ k k p r + 2 k k .
This completes the proof. □

3. Particular Cases

This section explores the three specific cases of the main identity (13), corresponding to p = 1 , 2 , 3 , as presented in the following corollaries.
Corollary 1.
Let { γ k } k N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n Γ k k n + r + k k = k = 1 n j = 1 k γ j j r + k + j 1 j k = 1 n Γ k k r + 2 k 1 k + k = 1 n Γ k k r + 2 k k .
k = 1 n Γ k k r + n + k k = k = 1 n γ k k r + n + k 1 k Γ n ( n + 1 ) 2 n + r n + 1 .
Proof. 
The identity (15) immediately follows by setting p = 1 in the main identity (13).
The proof of (16) is as follows: We set
P n = k = 1 n Γ k k r + n + k k .
Then,
P n + 1 P n = k = 1 n + 1 Γ k k r + n + k + 1 k k = 1 n Γ k k r + n + k k = k = 1 n Γ k k r + n + k + 1 k k = 1 n Γ k k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 = k = 1 n Γ k r + n + k k 1 k r + n + k k r + n + k + 1 k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 .
By (2) we have
r + n + k k 1 = k r + n + k + 1 r + n + k + 1 k ,
so that
P n + 1 P n = k = 1 n Γ k ( r + n + k + 1 ) r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 .
Applying (2) again, a reindexing argument gives
P n + 1 P n = k = 2 n + 1 Γ k 1 k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 = k = 2 n Γ k 1 k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 Γ n ( n + 1 ) r + 2 n + 1 n + 1 = k = 2 n Γ k γ k k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 Γ n ( n + 1 ) r + 2 n + 1 n + 1 .
Thus, we obtain
P n + 1 = k = 1 n γ k k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 Γ n ( n + 1 ) r + 2 n + 1 n + 1 = k = 1 n + 1 γ k k r + n + k k + Γ n + 1 ( n + 1 ) r + 2 n + 2 n + 1 Γ n + 1 ( n + 1 ) r + 2 n + 1 n + 1 .
Applying (2), we get
P n + 1 = k = 1 n + 1 γ k k r + n + k k Γ n + 1 ( n + 2 ) r + 2 n + 2 n + 2 .
Finally, replacing n with n 1 in the last identity, we prove the desired identity (16). □
Corollary 2.
Let { γ j } j N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k k 2 n + r + k k = k = 1 n 1 r + k j = 1 k γ j j r + k + j 1 j + k = 1 n Γ k k ( r + k ) r + 2 k 1 k + k = 1 n Γ k k 2 r + 2 k k .
Proof. 
The identity (17) immediately follows by setting p = 2 in the main identity (13). □
Corollary 3.
Let { γ j } j N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k k 3 n + r + k k = k = 1 n 1 k + r j = 1 k 1 Γ j j 2 k + r + j 1 j + k = 1 n 1 ( k + r ) 2 j = 1 k γ j j k + r + j 1 j k = 1 n Γ k k ( k + r ) 2 r + 2 k 1 k + k = 1 n Γ k k 3 r + 2 k k .
Proof. 
The identity (18) immediately follows by setting p = 3 in the main identity (13). □

4. Further Particular Cases

This section explores further specific cases of the identities presented in Section 3 with concrete examples of the identity by selecting specific sequences for { γ j } j N , as outlined in the following corollaries.

4.1. Choice of the Sequence: γ 1 = 1 and γ j = 0 for All j Z 2

Setting γ 1 = 1 and γ j = 0 for all j Z 2 in the results in Corollaries 1–3, we obtain the following identities, as stated in Corollaries 4–6.
Corollary 4.
Let r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n 1 k n + r + k k = k = 1 n 1 r + k k = 1 n 1 k r + 2 k 1 k + k = 1 n 1 k r + 2 k k .
k = 1 n 1 k r + n + k k = 1 n + r 1 ( n + 1 ) 2 n + r n + 1 .
In particular,
k = 1 n 1 k n + k k = H n k = 1 n 1 k 2 k k = 1 n 1 ( n + 1 ) 2 n n + 1 .
Proof. 
Setting r = 0 in (19) and (20) yields the first and second equalities of (21), respectively. □
Corollary 5.
Let r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n 1 k 2 n + r + k k = k = 1 n 1 ( r + k ) 2 + k = 1 n 1 k ( r + k ) r + 2 k 1 k + k = 1 n 1 k 2 r + 2 k k .
Also,
k = 1 n 1 k 2 n + k k = 3 k = 1 n 1 k 2 2 k k H n ( 2 ) ,
which agrees with Sun’s identity (3).
Proof. 
Setting r = 0 in (22) leads to (23). □
Corollary 6.
Let r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n 1 k 3 n + r + k k = k = 1 n 1 k + r j = 1 k 1 1 j 2 k + r + j 1 j + k = 1 n 1 ( k + r ) 3 + k = 1 n 1 k 3 r + 2 k k k = 1 n 1 k ( k + r ) 2 r + 2 k 1 k .
In particular,
k = 1 n 1 k 3 n + k k = H n ( 3 ) k = 1 n 1 k j = 1 k 1 1 j 2 k + j 1 j k = 1 n 1 k 3 2 k k .
Also,
k = 1 n 1 k 3 n + r + k k = k = 1 n 1 k + r j = 1 k 1 ( r + j ) 2 k = 1 n 1 k + r j = 1 k 1 3 j 2 + 3 r j + r 2 j 2 ( r + j ) 2 r + 2 j j + k = 1 n 1 k 3 r + 2 k k k = 1 n 1 k ( k + r ) 2 r + 2 k 1 k .
In particular,
k = 1 n 1 k 3 n + k k = k = 1 n H k ( 2 ) k 3 k = 1 n 1 k j = 1 k 1 1 j 2 2 j j k = 1 n 1 k 3 2 k k .
Proof. 
Particularly, setting r = 0 in (24) yields (25).
A proof of (26) is provided: We define
G k = j = 1 k 1 j 3 r + k + j j .
Then,
G k + 1 G k = k = 1 k + 1 1 j 3 r + k + 1 + j j j = 1 k 1 j 3 r + k + j j = j = 1 k 1 j 3 r + k + 1 + j j 1 j 3 r + k + j j + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 = j = 1 k r + k + j j r + k + j + 1 j j 3 r + k + j j r + k + j + 1 j + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 .
Using (2), we find
r + k + j j r + k + j + 1 j = j r + k + j + 1 r + k + j + 1 j ,
which is applied to Equation (28) to yield
G k + 1 G k = j = 1 k 1 j 2 ( r + k + j + 1 ) r + k + j j + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 .
An elementary computation gives
1 j 2 ( r + k + j + 1 ) = 1 ( r + k + 1 ) j 2 1 ( r + k + 1 ) 2 j + 1 ( k + r + 1 ) 2 ( r + k + j + 1 ) .
Using this identity in (29), we find that
G k + 1 G k = 1 r + k + 1 j = 1 k 1 j 2 r + k + j j + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 + 1 ( r + k + 1 ) 2 j = 1 k 1 j r + k + j j j = 1 k 1 ( r + k + j + 1 ) r + k + j j .
Employing the second identity given in (2), we see that
j = 1 k 1 ( r + k + j + 1 ) r + k + j j = j = 1 k 1 ( j + 1 ) r + k + j + 1 j + 1 = j = 2 k + 1 1 j r + k + j j = j = 1 k 1 j r + k + j j + 1 ( k + 1 ) r + 2 k + 1 k + 1 1 r + k + 1 .
Substituting (31) into (30), we obtain
G k + 1 G k = 1 r + k + 1 j = 1 k 1 j 2 r + k + j j + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 + 1 ( r + k + 1 ) 3 1 ( k + 1 ) ( r + k + 1 ) 2 r + 2 k + 1 k + 1 .
Applying Corollary 5 to the summation in (32), we get
G k + 1 G k = 1 r + k + 1 j = 1 k 1 j 2 r + 2 j j + j = 1 k 1 j ( r + j ) r + 2 j 1 j + 1 r + k + 1 j = 1 k 1 ( r + j ) 2 + 1 ( k + 1 ) 3 r + 2 k + 2 k + 1 + 1 ( r + k + 1 ) 3 1 ( k + 1 ) ( r + k + 1 ) 2 r + 2 k + 1 k + 1 .
Summing both sides of this identity from k = 0 to k = n 1 , and letting k + 1 = k and dropping the prime on k, and using G 0 = 0 , we get
G n = k = 1 n 1 r + k j = 1 k 1 1 j 2 r + 2 j j k = 1 n 1 r + k j = 1 k 1 1 j ( r + j ) r + 2 j 1 j + k = 1 n 1 r + k j = 1 k 1 ( r + j ) 2 + k = 1 n 1 k 3 r + 2 k k k = 1 n 1 k ( r + k ) 2 r + 2 k 1 k .
Finally, using the identity
r + 2 j 1 j = r + j r + 2 j r + 2 j j
to unify the first two summations, we derive the desired result (26). Particularly, setting r = 0 in (26) yields (27). □

4.2. Generalized Harmonic Numbers

Setting γ j = 1 j α for all j N and some α C in Corollaries 1, 2, and 3, we obtain the following identities, as stated in Corollaries 7, 8, and 9, respectively.
Corollary 7.
Let α C . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n H k ( α ) k r + n + k k = k = 1 n 1 k 1 + α r + n + k 1 k H n ( α ) ( n + 1 ) 2 n + r n + 1 .
In particular,
k = 1 n H k ( α ) k n + k k = k = 1 n 1 k 1 + α n + k 1 k H n ( α ) ( n + 1 ) 2 n n + 1 .
Proof. 
Setting r = 0 in (33) leads to (34). □
Corollary 8.
Let α C . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n H k ( α ) k 2 n + r + k k = k = 1 n 1 r + k j = 1 k 1 j 1 + α r + k + j 1 j + k = 1 n H k ( α ) k ( r + k ) r + 2 k 1 k + k = 1 n H k ( α ) k 2 r + 2 k k .
In particular,
k = 1 n H k ( α ) k 2 n + k k = k = 1 n 1 k j = 1 k 1 j 1 + α k + j 1 j + 3 k = 1 n H k ( α ) k 2 2 k k .
Proof. 
Setting r = 0 in (35) yields (36). □
Corollary 9.
Let α C . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n H k ( α ) k 3 n + r + k k = k = 1 n 1 k + r j = 1 k 1 H j ( α ) j 2 k + r + j 1 j + k = 1 n 1 ( k + r ) 2 j = 1 k 1 j 1 + α k + r + j 1 j k = 1 n H k ( α ) k ( k + r ) 2 r + 2 k 1 k + k = 1 n H k ( α ) k 3 r + 2 k k .  
In particular,
k = 1 n H k ( α ) k 3 n + k k = k = 1 n 1 k j = 1 k 1 H j ( α ) j 2 k + j 1 j + k = 1 n 1 k 2 j = 1 k 1 j 1 + α k + j 1 j k = 1 n H k ( α ) k 3 2 k k .
Proof. 
Setting r = 0 in (37) yields (38). □

4.3. Bernoulli Numbers

The Bernoulli numbers B n : = B n ( 0 ) are are defined by the generating function (see [13] (Section 1.7)):
z e z 1 = n = 0 B n z n n ! ( | z | < 2 π ) .
Using the well-known facts:
B 1 = 1 2 and B 2 n + 1 = 0 ( n N ) ,
the right-hand side of Equation (39) can be rewritten as:
z e z 1 = 1 z 2 + j = 1 B 2 j z 2 j ( 2 j ) ! ( | z | < 2 π ) .
The first few of the Bernoulli numbers are listed:
B 0 = 1 , B 1 = 1 2 , B 2 = 1 6 , B 4 = 1 30 , B 6 = 1 42 , B 8 = 1 30 , B 10 = 5 66 , B 12 = 691 2730 , B 14 = 7 6 , B 16 = 3617 510 , B 18 = 43867 798 , B 20 = 174611 330 , B 22 = 854513 138 , B 24 = 236364091 2730 , B 26 = 8553103 6 , .  
Recall the following identity (see [15] (p. 1, Entry 0.121)): For any q N and n N ,
j = 1 n j q = n q + 1 q + 1 + n q 2 + = 1 1 2 q 2 1 B 2 n q ( 2 1 ) = : F ( n , q , Ber ) ,
where B 2 are Bernoulli numbers, and the last term involves either n or n 2 depending on q.
The first three specific cases of (40) are
j = 1 n j = n ( n + 1 ) 2 ;
j = 1 n j 2 = n ( n + 1 ) ( 2 n + 1 ) 6 ;
j = 1 n j 3 = n ( n + 1 ) 2 2 .
By assigning γ j = j q for all j N and some fixed q N ,
Corollaries 1, 2, and 3 yield the results stated in Corollaries 10, 11, and 12, respectively. Each corollary includes the specific case when r = 0 , within which the particular identities (41)–(43) are also utilized.
Corollary 10.
Let q N . r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n F ( k , q , Ber ) k r + n + k k = k = 1 n 1 k 1 q r + n + k 1 k F ( n , q , Ber ) ( n + 1 ) 2 n + r n + 1 .
In particular,
k = 1 n F ( k , q , Ber ) k n + k k = k = 1 n 1 k 1 q n + k 1 k F ( n , q , Ber ) ( n + 1 ) 2 n n + 1 .
Furthermore,
k = 1 n ( k + 1 ) ( 2 k + 1 ) n + k k = 6 k = 1 n k n + k 1 k ( n + 1 ) ( 2 n + 1 ) 2 n n ;
k = 1 n k ( k + 1 ) 2 n + k k = 4 k = 1 n k 2 n + k 1 k n ( n + 1 ) 2 2 n n .
Corollary 11.
Let q N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n F ( k , q , Ber ) k 2 n + r + k k = k = 1 n 1 r + k j = 1 k 1 j 1 q r + k + j 1 j + k = 1 n F ( k , q , Ber ) k ( r + k ) r + 2 k 1 k + k = 1 n F ( k , q , Ber ) k 2 r + 2 k k .
In particular,
k = 1 n F ( k , q , Ber ) k 2 n + k k = k = 1 n 1 k j = 1 k 1 j 1 q k + j 1 j + 3 k = 1 n F ( k , q , Ber ) k 2 2 k k .
Furthermore,
k = 1 n k + 1 k n + k k = 2 k = 1 n 1 k j = 1 k 1 k + j 1 j + 3 k = 1 n k + 1 k 2 k k ;
k = 1 n ( k + 1 ) ( 2 k + 1 ) k n + k k = 6 k = 1 n 1 k j = 1 k j k + j 1 j + 3 k = 1 n ( k + 1 ) ( 2 k + 1 ) k 2 k k ;
k = 1 n ( k + 1 ) 2 n + k k = 4 k = 1 n 1 k j = 1 k j 2 k + j 1 j + 3 k = 1 n ( k + 1 ) 2 2 k k .
Corollary 12.
Let q N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n F ( k , q , Ber ) k 3 n + r + k k = k = 1 n 1 k + r j = 1 k 1 F ( j , q , Ber ) j 2 k + r + j 1 j + k = 1 n 1 ( k + r ) 2 j = 1 k 1 j 1 q k + r + j 1 j k = 1 n F ( k , q , Ber ) k ( k + r ) 2 r + 2 k 1 k + k = 1 n F ( k , q , Ber ) k 3 r + 2 k k .
In particular,
k = 1 n F ( k , q , Ber ) k 3 n + k k = k = 1 n 1 k j = 1 k 1 F ( j , q , Ber ) j 2 k + j 1 j + k = 1 n 1 k 2 j = 1 k 1 j 1 q k + j 1 j k = 1 n F ( k , q , Ber ) k 3 2 k k .
Furthermore,
k = 1 n k + 1 k 2 n + k k = k = 1 n 1 k j = 1 k 1 j + 1 j k + j 1 j + 2 k = 1 n 1 k 2 j = 1 k 1 k + j 1 j k = 1 n k + 1 k 2 2 k k ;
k = 1 n ( k + 1 ) ( 2 k + 1 ) k 2 n + k k = k = 1 n 1 k j = 1 k 1 ( j + 1 ) ( 2 j + 1 ) j k + j 1 j + 6 k = 1 n 1 k 2 j = 1 k j k + j 1 j k = 1 n ( k + 1 ) ( 2 k + 1 ) k 2 2 k k ;
k = 1 n ( k + 1 ) 2 k n + k k = k = 1 n 1 k j = 1 k 1 ( j + 1 ) 2 k + j 1 j + 4 k = 1 n 1 k 2 j = 1 k j 2 k + j 1 j k = 1 n ( k + 1 ) 2 k 2 k k .

4.4. Arithmetic Progression

Recall the arithmetic progression identity: For some fixed a , d C and each n N ,
j = 1 n ( a + ( j 1 ) d ) = n 2 [ 2 a + ( n 1 ) d ] .
The particular case of (44) when a = 1 and d = 2 gives
j = 1 n ( 2 j 1 ) = n 2 .
By setting γ j = a + ( j 1 ) d for all j N and fixed parameters a , d C , Corollaries 1, 2, and 3 lead to the results given in Corollaries 13, 14, and 15, respectively. Each corollary includes the special case r = 0 , wherein the identity (45) is also applied.
Corollary 13.
Let a , d C . Suppose r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n 2 a + ( k 1 ) d n + r + k k = 2 k = 1 n j = 1 k a + ( j 1 ) d j r + k + j 1 j k = 1 n 2 a + ( k 1 ) d r + 2 k 1 k + k = 1 n 2 a + ( k 1 ) d r + 2 k k .
k = 1 n 2 a + ( k 1 ) d r + n + k k = 2 k = 1 n a + ( k 1 ) d k r + n + k 1 k n [ 2 a + ( n 1 ) d ] ( n + 1 ) 2 n + r n + 1 .
In particular,
k = 1 n 2 a + ( k 1 ) d n + k k = 2 k = 1 n j = 1 k a + ( j 1 ) d j k + j 1 j k = 1 n 2 a + ( k 1 ) d 2 k k ;
k = 1 n 2 a + ( k 1 ) d n + k k = 2 k = 1 n a + ( k 1 ) d k n + k 1 k 2 a + ( n 1 ) d 2 n n .
Furthermore,
k = 1 n j = 1 k 2 j 1 j k + j 1 j = k = 1 n k n + k k + k = 1 n k 2 k k ;
k = 1 n k n + k k = k = 1 n 2 k 1 k n + k 1 k n 2 n n .
k = 1 n k n + k k = 2 k = 1 n 1 n + k 1 k k = 1 n 1 k n + k 1 k n 2 n n .
Corollary 14.
Let a , d C . Suppose r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n 2 a + ( k 1 ) d k n + r + k k = 2 k = 1 n 1 r + k j = 1 k a + ( j 1 ) d j r + k + j 1 j     + k = 1 n 2 a + ( k 1 ) d ( r + k ) r + 2 k 1 k + k = 1 n 2 a + ( k 1 ) d k r + 2 k k .
In particular,
k = 1 n 2 a + ( k 1 ) d k n + k k = 2 k = 1 n 1 k j = 1 k a + ( j 1 ) d j k + j 1 j + 3 k = 1 n 2 a + ( k 1 ) d k 2 k k .
Furthermore,
k = 1 n 1 n + k k = k = 1 n 1 k j = 1 k 2 j 1 j k + j 1 j + 3 k = 1 n 1 2 k k .
Corollary 15.
Let a , d C . Suppose r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n 2 a + ( k 1 ) d k 2 n + r + k k = k = 1 n 1 k + r j = 1 k 1 2 a + ( j 1 ) d j k + r + j 1 j + 2 k = 1 n 1 ( k + r ) 2 j = 1 k a + ( j 1 ) d j k + r + j 1 j k = 1 n 2 a + ( k 1 ) d ( k + r ) 2 r + 2 k 1 k + k = 1 n 2 a + ( k 1 ) d k 2 r + 2 k k .
In particular,
k = 1 n 2 a + ( k 1 ) d k 2 n + k k = k = 1 n 1 k j = 1 k 1 2 a + ( j 1 ) d j k + j 1 j + 2 k = 1 n 1 k 2 j = 1 k a + ( j 1 ) d j k + j 1 j k = 1 n 2 a + ( k 1 ) d k 2 2 k k .
Furthermore,
k = 1 n 1 k n + k k = k = 1 n 1 k j = 1 k 1 1 k + j 1 j + k = 1 n 1 k 2 j = 1 k 2 j 1 j k + j 1 j k = 1 n 1 k 2 k k .

5. Further Results

By differentiating the identities established in Corollaries 1–3 with respect to r, we derive several identities involving sums of reciprocals of binomial coefficients, as stated in Propositions 1–3. We further explore notable special cases arising from these results.
Proposition 1.
Let { γ k } k N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k H r + n H r + n + k k r + n + k k = k = 1 n γ k k r + n + k 1 k H r + n 1 H r + n + k 1 + Γ n H 2 n + r H n + r 1 ( n + 1 ) 2 n + r n + 1 .
In particular,
k = 1 n Γ k H n H n + k k n + k k = k = 1 n γ k k n + k 1 k H n 1 H n + k 1   + Γ n H 2 n H n 1 ( n + 1 ) 2 n n + 1     .
Proof. 
We used (9) and (11). Identity (47) is the special case of (46) when r = 0 . □
Proposition 2.
Let { γ j } j N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k H n + r H n + r + k k 2 n + r + k k = k = 1 n 1 r + k j = 1 k γ j j r + k + j 1 j H r + k + j 1 H r + k 1 k = 1 n Γ k H r + 2 k 1 H r + k 1 k ( r + k ) r + 2 k 1 k + k = 1 n Γ k H r + k H r + 2 k k 2 r + 2 k k + k = 1 n 1 ( r + k ) 2 j = 1 k γ j j r + k + j 1 j k = 1 n Γ k k ( r + k ) 2 r + 2 k 1 k .
In particular,
k = 1 n Γ k H n H n + k k 2 n + k k = k = 1 n 1 k j = 1 k γ j j k + j 1 j H k + j 1 H k 1 3 k = 1 n Γ k H 2 k H k k 2 2 k k 3 k = 1 n Γ k k 3 2 k k + k = 1 n 1 k 2 j = 1 k γ j j k + j 1 j .
Proof. 
We used (9) and (11). Identity (49) is the special case of (48) when r = 0 . □
Proposition 3.
Let { γ j } j N be an arbitrary complex sequence, and define the partial sums denoted by Γ n = γ 1 + γ 2 + + γ n for each n N . Suppose r C Z 1 . Then, for all n N , the following identity holds:
k = 1 n Γ k ( H n + r H n + r + k ) k 3 n + r + k k = k = 1 n 1 ( k + r ) 2 j = 1 k 1 Γ j j 2 k + r + j 1 j k = 1 n 1 k + r j = 1 k 1 Γ j H k + r 1 H k + r + j 1 j 2 k + r + j 1 j 2 k = 1 n 1 ( k + r ) 3 j = 1 k γ j j k + r + j 1 j + k = 1 n 1 ( k + r ) 2 j = 1 k γ j H k + r 1 H k + r + j 1 j k + r + j 1 j + k = 1 n Γ k k ( k + r ) 3 r + 2 k 1 k k = 1 n Γ k H r + k 1 H r + 2 k 1 k ( k + r ) 2 r + 2 k 1 k + k = 1 n Γ k H r + k H r + 2 k k 3 r + 2 k k .
In particular,
k = 1 n Γ k ( H n H n + k ) k 3 n + k k = k = 1 n 1 k 2 j = 1 k 1 Γ j j 2 k + j 1 j k = 1 n 1 k j = 1 k 1 Γ j H k 1 H k + j 1 j 2 k + j 1 j 2 k = 1 n 1 k 3 j = 1 k γ j j k + j 1 j + k = 1 n 1 k 2 j = 1 k γ j H k 1 H k + j 1 j k + j 1 j + 2 k = 1 n Γ k k 4 2 k k 2 k = 1 n Γ k H k 1 H 2 k 1 k 3 2 k k + k = 1 n Γ k H k H 2 k k 3 2 k k .  
By setting γ j = 1 j for all j N in the identities in Propositions 1–3, we obtain the corresponding identities, as given in the following corollary.
Corollary 16.
Let r C Z 1 . Then, for all n N , the following identities hold:
k = 1 n H k H n + r H n + r + k k 2 n + r + k k = k = 1 n 1 r + k j = 1 k H r + k + j 1 H r + k 1 j 2 r + k + j 1 j k = 1 n H k H r + 2 k 1 H r + k 1 k ( r + k ) r + 2 k 1 k + k = 1 n H k H r + k H r + 2 k k 2 r + 2 k k k = 1 n H k k ( r + k ) 2 r + 2 k 1 k + k = 1 n 1 ( r + k ) 2 j = 1 k 1 j 2 r + k + j 1 j ;
k = 1 n H k H n H n + k k 2 n + k k = k = 1 n 1 k j = 1 k H k + j 1 H k 1 j 2 k + j 1 j 3 k = 1 n H k H 2 k H k k 2 2 k k 3 k = 1 n H k k 3 2 k k + k = 1 n 1 k 2 j = 1 k 1 j 2 k + j 1 j ;
k = 1 n H k H r + n H r + n + k k r + n + k k = k = 1 n H r + n 1 H r + n + k 1 k 2 r + n + k 1 k H n H n + r 1 H 2 n + r ( n + 1 ) 2 n + r n + 1 ; k = 1 n H k H n H n + k k n + k k = k = 1 n H n 1 H n + k 1 k 2 n + k 1 k H n H n 1 H 2 n ( n + 1 ) 2 n n + 1 ; k = 1 n H k ( H n + r H n + r + k ) k 3 n + r + k k = k = 1 n 1 ( k + r ) 2 j = 1 k 1 H j j 2 k + r + j 1 j k = 1 n 1 k + r j = 1 k 1 H j H k + r 1 H k + r + j 1 j 2 k + r + j 1 j 2 k = 1 n 1 ( k + r ) 3 j = 1 k 1 j 2 k + r + j 1 j + k = 1 n 1 ( k + r ) 2 j = 1 k H k + r 1 H k + r + j 1 j 2 k + r + j 1 j + k = 1 n H k k ( k + r ) 3 r + 2 k 1 k k = 1 n H k H r + k 1 H r + 2 k 1 k ( k + r ) 2 r + 2 k 1 k + k = 1 n H k H r + k H r + 2 k k 3 r + 2 k k ; k = 1 n H k ( H n H n + k ) k 3 n + k k = k = 1 n 1 k 2 j = 1 k 1 H j j 2 k + j 1 j k = 1 n 1 k j = 1 k 1 H j H k 1 H k + j 1 j 2 k + j 1 j 2 k = 1 n 1 k 3 j = 1 k 1 j 2 k + j 1 j + k = 1 n 1 k 2 j = 1 k H k 1 H k + j 1 j 2 k + j 1 j + 2 k = 1 n H k k 4 2 k k k = 1 n H k H k 1 H 2 k 1 k 3 2 k k + 1 2 k = 1 n H k k 4 2 k k .

6. Concluding Remarks

In this work, we have explored a variety of special cases stemming from our main result, illustrating the richness and flexibility of the underlying identities. Thanks to the generality of Theorem 1, many further instances can be generated. In particular, whenever a closed-form expression for the partial sums of a sequence is available, our framework enables the derivation of explicit identities, as evidenced by the corollaries presented.
Moreover, the identities in these corollaries admit further refinement, leading to even more concrete formulas. As an example, Formula (40) reproduces the classical identity
j = 1 n j 4 = 1 30 n ( n + 1 ) ( 2 n + 1 ) 3 n 2 + 3 n 1 ( n N ) .
Similarly, by applying Equation (52), one can derive additional identities that extend the special cases discussed in Corollaries 10–12.
We hope that this line of investigation not only contributes to a deeper understanding of summation identities involving reciprocals of binomial coefficients but also lays a foundation for discovering new analytic results with potential applications in number theory, combinatorics, and mathematical analysis.

Author Contributions

The authors, N.B. and J.C., have equally contributed to accomplish this research work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors sincerely thank the anonymous reviewers for their invaluable feedback. Their thoughtful and constructive comments have significantly improved the quality and clarity of this paper.

Conflicts of Interest

The authors have no conflicts of interest.

References

  1. Jordan, C. Calculus of Finite Differences; Chelsea Publishing Company: New York, NY, USA, 1965. [Google Scholar]
  2. Sun, Z.-W. Super congruences and Euler numbers. Sci. China Math. 2011, 54, 2509–2536. [Google Scholar] [CrossRef]
  3. Gould, H.W.; (Department of Mathematics, West Virginia University, Morgantown, WV 26505, USA). Cominatorial Identities: A Standardized Set of Tables Listing 500 Binomial Coefficient Summations. Personal communication, 1972. [Google Scholar]
  4. Batır, N.; Sofo, A. Finite sums involving reciprocals of the binomial and central binomial coefficients and harmonic numbers. Symmetry 2021, 13, 2002. [Google Scholar] [CrossRef]
  5. Sprugnoli, R. Sums of reciprocals of the central binomial coefficients. Integers 2006, 6, #A27. [Google Scholar]
  6. Batır, N.; Chen, K.-W. Combinatorial identities involving reciprocals of the binomial and central binomial coefficients and harmonic numbers. J. Differ. Equ. Appl. 2022, 28, 222–243. [Google Scholar] [CrossRef]
  7. Apéry, R. Irrationalité de ζ(2) et ζ(3). Astérisque 1979, 61, 11–13. [Google Scholar]
  8. Guillera, J. Hypergeometric identities for 10 extended Ramanujan-type series. Ramanujan J. 2008, 15, 219–234. [Google Scholar] [CrossRef]
  9. Plouffe, S. Simon Plouffe’s Home Page. Available online: http://www.plouffe.fr (accessed on 10 July 2025).
  10. Sofo, A.; Batır, N. On finite sums and integral representations. Integers 2013, 13, #A45. [Google Scholar]
  11. Batır, N.; Choi, J. Parameterized finite binomial sums. Mathematics 2024, 12, 2450. [Google Scholar] [CrossRef]
  12. Sofo, A.; Srivastava, H.M. A family of shifted harmonic sums. Ramanujan J. 2015, 37, 89–108. [Google Scholar] [CrossRef]
  13. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Science Publishers: Amsterdam, The Netherlands; London, UK; New York, NY, USA, 2012. [Google Scholar]
  14. Sondow, J. Criteria for irrationality of Euler’s constant. Proc. Am. Math. Soc. 2003, 131, 3335–3344. [Google Scholar] [CrossRef]
  15. Gradshteyn, I.S.; Ryzhik, I.M. Tables of Integrals, Series, and Products, 6th ed.; Academic Press: Boston, MA, USA; London, UK; New York, NY, USA; San Diego, CA, USA; San Francisco, CA, USA; Sydney, Australia; Tokyo, Japan, 2000; Errata for Sixth Edition; Available online: http://www.mathtable.com/errata/gr6_errata.pdf (accessed on 30 June 2025).
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.

Share and Cite

MDPI and ACS Style

Batır, N.; Choi, J. Novel Finite Sum Identities Involving Reciprocals of Binomial Coefficients. Symmetry 2025, 17, 1318. https://doi.org/10.3390/sym17081318

AMA Style

Batır N, Choi J. Novel Finite Sum Identities Involving Reciprocals of Binomial Coefficients. Symmetry. 2025; 17(8):1318. https://doi.org/10.3390/sym17081318

Chicago/Turabian Style

Batır, Necdet, and Junesang Choi. 2025. "Novel Finite Sum Identities Involving Reciprocals of Binomial Coefficients" Symmetry 17, no. 8: 1318. https://doi.org/10.3390/sym17081318

APA Style

Batır, N., & Choi, J. (2025). Novel Finite Sum Identities Involving Reciprocals of Binomial Coefficients. Symmetry, 17(8), 1318. https://doi.org/10.3390/sym17081318

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop