Next Article in Journal
A Gastrointestinal Image Classification Method Based on Improved Adam Algorithm
Previous Article in Journal
On Sequential Warped Products Whose Manifold Admits Gradient Schouten Harmonic Solitons
Previous Article in Special Issue
Bisection Series Approach for Exotic 3F2(1)-Series
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Parameterized Finite Binomial Sums

1
Department of Mathematics, Nevşehir Haci 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.
Mathematics 2024, 12(16), 2450; https://doi.org/10.3390/math12162450
Submission received: 26 June 2024 / Revised: 27 July 2024 / Accepted: 5 August 2024 / Published: 7 August 2024
(This article belongs to the Special Issue Integral Transforms and Special Functions in Applied Mathematics)

Abstract

:
We offer intriguing new insights into parameterized finite binomial sums, revealing elegant identities such as k = 0 , k n m + n ( 1 ) k n k m + n k = ( 1 ) n m + n n ( H m H n ) , where n , m are non-negative integers and H n is the harmonic number. These formulas beautifully capture the intricate relationship between harmonic numbers and binomial coefficients, providing a fresh and captivating perspective on combinatorial sums.

1. Introduction and Preliminaries

By using a known identity and mathematical induction, Sun [1] proved the following remarkable identity: For n N ,
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 .
Here and elsewhere, N denotes the set of positive integers. Sofo and Batır [2] provided an alternate representation to Equation (1): For n N , the following identity holds:
k = 1 n 1 k 2 n + k k = H n 2 + k = 1 n ( 1 ) k + 1 k n k H n + k .
Here and throughout, H n denotes the classical harmonic number, defined as
H n = k = 1 n 1 k ( n N ) ,
and H 0 : = 0 . In this article, an empty sum is conventionally interpreted as zero wherever it appears. Indeed, they went further by deriving a general formula for the sums
k = 1 n 1 k m n + k k n N ; m Z 0 .
Here and throughout, Z η denotes the set of integers greater than or equal to some integer η . Additional specific instances of (4), including (2), when m = 0 and m = 1 , yield the following identities:
k = 1 n 1 n + k k = 1 n 1 1 n + 1 2 n n n Z 2 ,
and
k = 1 n 1 k n + k k = 1 n 1 n 2 n n ( n N ) .

1.1. Main Results

In this work, we present a new perspective on parameterized finite binomial sums, with the main results provided herein.
Theorem 1 extends identity (6) by incorporating a parameter t, which can be any complex number. This extension allows for the derivation of numerous other intriguing identities based on different choices of the parameter t.
Theorem 1. 
Let m , n Z 0  and  t C . Then, the following identity holds:
k = 1 m ( 1 ) k t n + k k n + k k = ( 1 + t ) n H m H n + k = 1 n 1 k 1 + 1 t k ( 1 ) n m + n n k = 0 k n m + n ( 1 ) k m + n k ( 1 + t ) k n k .
The particular case when m = n gives the following identity:
k = 1 n ( 1 ) k t n + k k n + k k = k = 1 n ( 1 + t ) n k 1 + 1 t k ( 1 ) n 2 n n k = 0 k n 2 n ( 1 ) k n k 2 n k ( 1 + t ) k .
Theorem 2 presents a novel finite summation identity involving the binomial coefficient, the harmonic number, and a parameter t, which can be any complex number. This identity enables the derivation of numerous other intriguing identities through various choices of the parameter t.
Theorem 2. 
Let m , n Z 0  and  t C . Then,
k = 1 m ( 1 ) k H k 1 t k + n k n + k k = k = 0 m 1 ( 1 ) k + 1 H k t k + 1 + n k n + k + 1 k + 1   = 1 2 H m 2 H n 2 H m ( 2 ) H n ( 2 ) ( 1 + t ) n + ( 1 + t ) n k = 1 n H n H k 1 k 1 + 1 t k + ( 1 ) n + 1 H m m + n n k = 0 k n m + n ( 1 ) k n k m + n k ( 1 + t ) k + ( 1 ) n + 1 m + n n k = 0 k n m + n ( 1 ) k ( n k ) 2 m + n k ( 1 + t ) k .
The particular case m = n gives
k = 1 n ( 1 ) k H k 1 t k + n k n + k k = H n ( 2 ) ( 1 + t ) n + ( 1 + t ) n k = 1 n H n H k 1 k 1 + 1 t k + ( 1 ) n + 1 H n 2 n n k = 0 k n 2 n ( 1 ) k n k 2 n k ( 1 + t ) k + ( 1 ) n + 1 2 n n k = 0 k n 2 n ( 1 ) k ( n k ) 2 2 n k ( 1 + t ) k .
In addition to providing alternative proofs for Equations (5) and (6), we also derive formulas for the following similar identities as particular cases of our main results:
k = 1 m ϵ k k p n + k k and k = 1 m ϵ k H k k p n + k k ,
where m , n Z 0 , ϵ { 1 , 1 } , and p = 0 , 1 .

1.2. Required Functions, Notations, and Lemmas

To support our objectives, we revisit the definitions and properties of certain special functions and numbers. The well-known gamma function, Γ ( z ) , is given by
Γ ( z ) = 0 u z 1 e u d u ( ( z ) > 0 ) ,
where ( z ) denotes the real part of a complex number z. The gamma function Γ ( z ) can be analytically continued to the entire complex plane, except at the non-positive integers, where it has simple poles (refer to [3] (Section 1.1)). The psi function, also known as the digamma function, is denoted by ψ ( z ) , and is defined as the logarithmic derivative of the gamma function:
ψ ( z ) = Γ ( z ) Γ ( z ) z C Z 0 .
The polygamma function ψ q ( z ) is defined by
ψ q ( z ) : = d q d z q { ψ ( z ) } = 1 q + 1 q ! r = 0 1 r + z q + 1 = 1 q + 1 q ! ζ ( q + 1 , z ) q N , z C Z 0 ,
where ψ 0 ( z ) = ψ ( z ) , and ζ ( s , z ) is the generalized (or Hurwitz) zeta function, defined by
ζ ( s , z ) : = j = 0 1 ( j + z ) s ( s ) > 1 , z C Z 0 ,
and ζ ( s , 1 ) = : ζ ( s ) is the Riemann zeta function. Here and throughout, Z denotes the set of integers less than or equal to some integer . The polygamma functions satisfy the following functional equation (refer to [4] (Equation (1.13))):
ψ ( q ) ( z + ) ψ ( q ) ( z ) = ( 1 ) q q ! j = 1 1 ( z + j 1 ) q + 1 , q Z 0 .
The harmonic numbers of order s, signified as H n ( s ) , are defined by
H n ( s ) = k = 1 n 1 k s ( n N ; s C ) .
Here, and in subsequent discussions, C represents the set of complex numbers. Also, H 0 ( s ) : = 0 . When s = 1 , we obtain the classical harmonic numbers H n ( 1 ) : = H n in (3). The following relations are recalled: for n Z 0 ,
ψ ( n + 1 ) = ψ ( 1 ) + H n = γ + H n ,
where γ is Euler–Mascheroni constant (see, for instance, [3] (Section 1.2)), and
H n ( m + 1 ) = ζ ( m + 1 ) + ( 1 ) m m ! ψ ( m ) ( n + 1 ) ,
where m N and n Z 0 (see, for example, [5] (Equation (1.25))).
A generalized binomial coefficient s t can be defined, in terms of the gamma function, by
s t = Γ ( s + 1 ) Γ ( t + 1 ) Γ ( s t + 1 ) ( s C Z 1 , t C ) .
It is clear from (13) that, for n , k Z 0 ,
n k = n ! k ! ( n k ) ! if n k , 0 if k > n .
We now present a series of lemmas, which will be used in the next section to prove the main results.
Lemma 1. 
Let k Z 0 . Also, let m , n Z 0 with m > n . Then, the following identities hold:
lim x 0 x Γ ( x k ) = ( 1 ) k k ! ;
lim x k ψ ( x ) Γ ( x ) = ( 1 ) k 1 k ! ;
lim x k ψ 2 ( x ) ψ ( x ) Γ ( x ) = 2 ( 1 ) k 1 k ! ψ ( k + 1 ) ;
lim x n d d x x m = lim x n x m ( ψ ( x + 1 ) ψ ( x m + 1 ) ) = ( 1 ) m n 1 ( m n ) m n ;
lim x n x m ψ ( x m + 1 ) = ( 1 ) m n ( m n ) m n ;
lim x n x m x m x n = ( 1 ) m n m n ;
lim x n x m ψ ( x m + 1 ) x m x n m n ( x n ) 2 = ( 1 ) m n ψ ( m n + 1 ) m n .
Proof. 
The proofs of (15), (16), and (17) can be found in [4] (Lemma 1.2) (see also [6]).
To prove (18), let L 1 represent the left-hand side of (18). Using (14), we have
L 1 = lim x n x m ( ψ ( x + 1 ) ψ ( x m + 1 ) ) = lim x n x m ψ ( x m + 1 ) = n ! m ! lim x n ψ ( x m + 1 ) Γ ( x m + 1 ) = n ! m ! lim y ( m n 1 ) ψ ( y ) Γ ( y ) ,
which, upon employing (16), leads to
L 1 = ( 1 ) m n 1 ( m n ) m n .
Formula (19) is proved in the course of the proof of (18).
To prove (20), let L 2 represent the left-hand side of (20). Using (13), we find
L 2 = n ! ( m n ) m ! lim x n 1 ( x n ) Γ ( x m + 1 ) .
Setting x n = y in the last limit and using (15), we obtain
L 2 = n ! ( m n ) m ! lim y 0 1 y Γ ( y ( m n 1 ) ) = ( 1 ) m n m n .
To prove (21), let L 3 represent the left-hand side of (21). By using (13), we find
L 3 = n ! m ! lim x n 1 ( x n ) Γ ( x m + 1 ) I 1 × lim x n ψ ( x m + 1 ) ( x n ) ( x m ) ( m n ) x n I 2 .
Applying (15), we have
I 1 = ( 1 ) m n 1 ( m n 1 ) ! .
Letting x n = u , we obtain
I 2 = lim u 0 ψ ( u η ) u ( u η 1 ) η 1 u ,
where η : = m n 1 . From (10), we derive the following specific identities: for k Z 0 ,
ψ ( u k ) = ψ ( u + 1 ) 1 u j = 1 k 1 u j ,
and
ψ ( u k ) = ψ ( u + 1 ) + 1 u 2 + j = 1 k 1 ( u j ) 2 .
Using (24), we obtain
I 2 = lim u 0 1 u u ( u η 1 ) ψ ( u + 1 ) 1 u j = 1 η 1 u j η + 1 1 = lim u 0 ( u η 1 ) ψ ( u + 1 ) lim u 0 u η 1 u + η + 1 u + j = 1 η u η 1 u j = ( η + 1 ) ψ ( 1 ) ( η + 1 ) H η 1 .
Using (11) and the following known (easily derivable) identity,
ψ ( z + 1 ) = ψ ( z ) + 1 z ,
we obtain
I 2 = ( η + 1 ) ψ ( 1 ) ( η + 1 ) H η 1 = ( η + 1 ) ψ ( η + 2 ) = ( m n ) ψ ( m n + 1 ) .
Finally, substituting the results in (23) and (26) into (22), we prove the identity (21). □
Lemma 2. 
Let x R Z 1  and  t C . Also let m , n Z 0 with m > n . Then, the following identities hold:
lim x n k = 0 m x k ϕ k ( x ) t k = ( 1 + t ) n H n k = 0 n n k H k t n k k = 1 m n ( 1 ) k t n + k k n + k k ,
where
ϕ k ( x ) : = ψ ( x + 1 ) ψ ( x k + 1 ) ;
lim x n k = n + 1 m x k ψ 2 ( x k + 1 ) ψ ( x k + 1 ) t k = 2 k = 1 m n ( 1 ) k ψ ( k ) t n + k k n + k k .
Here and elsewhere, let R represent the set of real numbers.
Proof. 
Split the sum k = 0 m ϕ k ( x ) t k into two parts as follows:
k = 0 m x m ϕ k ( x ) t k = k = 0 n x k ϕ k ( x ) t k + k = n + 1 m x k ϕ k ( x ) t k .
Taking the limit x n on the first sum of the right-hand side of (30), with the aid of (11) and n k = n n k , we have
lim x n k = 0 n x k ϕ k ( x ) t k = k = 0 n n k ψ ( n + 1 ) ψ ( n k + 1 ) t k = ( 1 + t ) n H n k = 0 n n k H k t n k .
For the second sum of the right-hand side of (30), by virtue of (14), we have
lim x n k = n + 1 m x k ψ ( x + 1 ) t k = 0 .
Therefore, it follows from (13) that
lim x n k = n + 1 m x k ϕ k ( x ) t k = lim x n k = n + 1 m x k ψ ( x k + 1 ) t k = lim x n k = n + 1 m n ! k ! ψ ( x k + 1 ) Γ ( x k + 1 ) t k .
Setting k n 1 = k and then deleting the prime on k, we obtain
lim x n k = n + 1 m x k ϕ k ( x ) t k = k = 0 m n 1 n ! ( n + k + 1 ) ! lim x n ψ ( x n k ) Γ ( x n k ) t n + k + 1 = k = 0 m n 1 n ! ( n + k + 1 ) ! lim y k ψ ( y ) Γ ( y ) t n + k + 1 ( y : = x n k ) .
Utilizing (16) to simplify the last sum gives
lim x n k = n + 1 m x k ϕ k ( x ) t k = k = 0 m n 1 ( 1 ) k ( n + k + 1 ) n + k k t n + k + 1 = k = 1 m n ( 1 ) k k n + k k t n + k .
Taking the limit on both sides of (30) as x tends to n, and using (31) and (32), we obtain the identity (27).
The detailed steps are omitted. □
Lemma 3. 
Let m , n Z 0 with n < m . Then, the following identity holds:
lim x n { ψ 2 ( x m + 1 ) ψ ( x m + 1 ) 2 ( m n ) ψ ( x m + 1 ) ( x n ) ( x m ) 2 ( m n ) ( x n ) 2 ( x m ) } = ψ 2 ( m n ) ζ ( 2 ) H m n 1 ( 2 ) + 2 ψ ( m n ) m n .
Proof. 
Let L 4 be the left-hand side of (33). Setting x n = y and L = m n 1 , we obtain
L 4 = lim y 0 ψ 2 ( y L ) ψ ( y L ) 2 ( L + 1 ) ψ ( y L ) y ( y L 1 ) 2 ( L + 1 ) y 2 ( y L 1 ) .
Using (24) and (25), we obtain
L 4 = lim y 0 [ ψ 2 ( y + 1 ) ψ ( y + 1 ) + j = 1 L 1 y j 2 2 ψ ( y + 1 ) j = 1 L 1 y j j = 1 L 1 ( y j ) 2 + 2 y L 1 j = 1 L 1 y j ψ ( y + 1 ) ] = lim y 0 [ j = 1 L 1 y j ψ ( y + 1 ) 2 ψ ( y + 1 ) j = 1 L 1 ( y j ) 2 + 2 y L 1 j = 1 L 1 y j ψ ( y + 1 ) ] .
Using (11), we have
L 4 = ψ 2 ( L + 1 ) ψ ( 1 ) H L ( 2 ) + 2 L + 1 ψ ( L + 1 ) ,
which, upon setting L = m n 1 with the aid of (9), leads to the right-hand side of (33). □

2. Proofs of Main Results

This section provides proofs of our main results, Theorems 1 and 2.
Proof of Theorem 1. 
We begin by recalling the following known identity (see [7] (Equation (1), p. 186)): for m Z 0 , x C , and t C ,
k = 0 m x k t k = ( 1 ) m x m k = 0 m ( 1 ) k m k x m x k ( 1 + t ) k .
Differentiating both sides of this equality with respect to the variable x gives
k = 0 m x k ϕ k ( x ) t k = ( 1 ) m x m ϕ m ( x ) k = 0 m ( 1 ) k m k x m x k ( 1 + t ) k + ( 1 ) m x m k = 0 m ( 1 ) k m k m k ( x k ) 2 ( 1 + t ) k ,
where ϕ k ( x ) is given as in (28). Let n Z 0 with n < m . Let us separate the nth term from the two sums on the right-hand side of (34), rearrange the extracted terms and the remaining sums, and then take the limit of both sides of the resulting expressions as x n . Then, we obtain the following identity:
lim x n k = 0 m x k ϕ k ( x ) t k = ( 1 ) m lim x n f 4 ( x ) + ( 1 ) m + n m n ( 1 + t ) n lim x n f 1 ( x ) f 2 ( x ) + ( 1 ) m lim x n f 3 ( x ) k = 0 n 1 ( 1 ) k m k n m n k ( 1 + t ) k + ( 1 ) m lim x n f 3 ( x ) k = n + 1 m ( 1 ) k m k n m n k ( 1 + t ) k ,
where
f 1 ( x ) = ψ ( x + 1 ) x m x m x n ,
f 2 ( x ) = x m ψ ( x m + 1 ) x m x n m n ( x n ) 2 ,
f 3 ( x ) = x m ϕ m ( x ) ,
and
f 4 ( x ) = x m { k = 0 n 1 ( 1 ) k m k m k ( x k ) 2 ( 1 + t ) k + k = n + 1 m ( 1 ) k m k m k ( x k ) 2 ( 1 + t ) k } .
By making respective use of (14), (18), (20), and (21), we obtain the following four identities:
lim x n f 1 ( x ) = ψ ( n + 1 ) ( 1 ) m n m n ;
lim x n f 2 ( x ) = ( 1 ) m n ψ ( m n + 1 ) m n ;
lim x n f 3 ( x ) = ( 1 ) m n 1 ( m n ) m n ;
lim x n f 4 ( x ) = 0 .
Substituting the results in (36), (37), (38), and (39) into (35), with the aid of (11) and (27), we obtain
  k = 1 m n ( 1 ) k t n + k k n + k k = ( 1 + t ) n H m n k = 0 n n k H k t n k ( 1 ) n m n k = 0 n 1 ( 1 ) k n k m k ( 1 + t ) k + k = n + 1 m ( 1 ) k n k m k ( 1 + t ) k .
Replacing m with m + n in Equation (40) and using the known formula (see [8] (Equation (1)); see also [9]):
k = 0 n n k H k t k = ( 1 + t ) n H n k = 1 n 1 k ( 1 + t ) k ,
we obtain the desired identity (7). □
Proof of Theorem 2. 
Differentiating both sides of (34) with respect to x, we find
k = 0 m x k ϕ k ( x ) 2 + ϕ k ( x ) t k = ( 1 ) m x m ( ϕ m ( x ) ) 2 + ϕ m ( x ) k = 0 m ( 1 ) k m k x m x k ( 1 + t ) k + 2 ( 1 ) m x m ϕ m ( x ) k = 0 m ( 1 ) k m k m k ( x k ) 2 ( 1 + t ) k 2 ( 1 ) m x m k = 0 m ( 1 ) k m k m k ( x k ) 3 ( 1 + t ) k ,
where ϕ k ( x ) is given as in (28).
Let m , n Z 0 with n < m . Breaking up the sum on the left-hand side of (42) into two summations, extracting the nth terms of the three sums on the right-hand side of the equation separately, and finally taking the limit of both sides of the resultant equality as x tends to n, we obtain
lim x n k = 0 n x k ϕ k ( x ) 2 + ϕ k ( x ) t k T 1 + lim x n k = n + 1 m x k ϕ k ( x ) 2 + ϕ k ( x ) T 2 t k = ( 1 ) m + n m n ( 1 + t ) n lim x n g 1 ( x ) 2 g 2 ( x ) + g 3 ( x ) Q 1 + ( 1 ) m lim x n x m ( ϕ m ( x ) ) 2 + ϕ m ( x ) Q 2 k = 0 k n m ( 1 ) k m k n m n k ( 1 + t ) k + 2 ( 1 ) m lim x n x m ϕ m ( x ) Q 3 k = 0 k n m ( 1 ) k m k m k ( n k ) 2 ( 1 + t ) k 2 ( 1 ) m lim x n x m 0 k = 0 k n m ( 1 ) k m k m k ( n k ) 3 ( 1 + t ) k ,
where
g 1 ( x ) : = ψ 2 ( x + 1 ) + ψ ( x + 1 ) x m x m x n ,
g 2 ( x ) : = ψ ( x + 1 ) x m ψ ( x m + 1 ) x m x n m n ( x n ) 2 ,
g 3 ( x ) : = x m x m x n [ ψ 2 ( x m + 1 ) ψ ( x m + 1 ) 2 ( m n ) ψ ( x m + 1 ) ( x n ) ( x m ) 2 ( m n ) ( x n ) 2 ( x m ) ] .
Using (11) and (12) in the limiting result in T 1 , with the aid of [10] (Equation (40)), we obtain
T 1 = k = 0 n n k H n H n k 2 + H n k ( 2 ) H n ( 2 ) t k = 2 ( 1 + t ) n k = 1 n H k 1 k ( 1 + 1 t ) k .
Employing the definition of ϕ k ( x ) in (28), we have
T 2 = ψ 2 ( n + 1 ) ψ ( n + 1 ) k = n + 1 m lim x n x k 0 t k 2 ψ ( n + 1 ) k = n + 1 m lim x n x k ψ ( x k + 1 ) t k I 1 + k = n + 1 m lim x n x k ψ 2 ( x k + 1 ) ψ ( x k + 1 ) t k I 2 .
Letting k n 1 = k in the sum I 1 , and then deleting the prime on k, with the aid of (16), we obtain
I 1 = k = 0 m n 1 n ! ( n + k + 1 ) ! lim x n ψ ( x n k ) Γ ( x n k ) t n + k + 1 = k = 0 m n 1 n ! ( n + k + 1 ) ! · lim u k ψ ( u ) Γ ( u ) t n + k + 1 ( u = x n k ) = k = 1 m n ( 1 ) k t n + k k n + k k .
Similarly, we derive
I 2 = k = n + 1 m n ! k ! lim x n ψ 2 ( x k + 1 ) ψ ( x k + 1 ) Γ ( x k + 1 ) t k = k = 0 m n 1 n ! ( n + k + 1 ) ! lim y k ψ 2 ( y ) ψ ( y ) Γ ( y ) t n + k + 1 .
Using (17) in the limit of the last equality gives
I 2 = 2 k = 1 m n ( 1 ) k ψ ( k ) k n + k k t n + k .
Substituting the values of I 1 and I 2 in (46) and (47) into (45), we obtain
T 2 = 2 k = 1 m n ( 1 ) k H k 1 k n + k k t n + k 2 H n k = 1 m n ( 1 ) k t n + k k n + k k .
Applying (7) to the second sum in the above T 2 , we have
T 2 = 2 k = 1 m n ( 1 ) k H k 1 k n + k k t n + k + 2 H n ( 1 ) n m n k = 0 k n m ( 1 ) k n k m k ( 1 + t ) k 2 H n ( 1 + t ) n H m n H n + k = 1 n 1 k ( 1 + 1 t ) k .
By using (15), we have
lim x n g 1 ( x ) = ψ 2 ( n + 1 ) + ψ ( n + 1 ) ( 1 ) m n m n .
By using (21), we have
lim x n g 2 ( x ) = ψ ( n + 1 ) ( 1 ) m n ψ ( m n + 1 ) m n .
By using (20) and (33), we have
lim x n g 3 ( x ) = ( 1 ) m n m n ψ 2 ( m n ) ζ ( 2 ) H m n 1 ( 2 ) + 2 ψ ( m n ) m n .
Using (49), (50) and (51), we obtain
Q 1 = ( 1 ) m n m n H n H m n 2 H n ( 2 ) H m n ( 2 ) .
We find that
Q 2 = n ! m ! { lim x n ψ 2 ( x + 1 ) + ψ ( x + 1 ) Γ ( x m + 1 ) 0 2 ψ ( n + 1 ) lim x n ψ ( x m + 1 ) Γ ( x m + 1 ) + lim x n ψ 2 ( x m + 1 ) ψ ( x m + 1 ) Γ ( x m + 1 ) } .
Setting K = m n 1 , we have
Q 2 = n ! m ! 2 ψ ( n + 1 ) lim y K ψ ( y ) Γ ( y ) + lim y K ψ 2 ( y ) ψ ( y ) Γ ( y ) ,
which, upon employing (16) and (17), yields the following value:
Q 2 = 2 ( 1 ) m n 1 ( m n ) m n ψ ( n + 1 ) ψ ( m n ) .
By using (16), we find that
Q 3 = n ! m ! lim x n ψ ( x + 1 ) Γ ( x m + 1 ) 0 n ! m ! lim x n ψ ( x m + 1 ) Γ ( x m + 1 ) = n ! m ! lim y ( m n 1 ) ψ ( y ) Γ ( y ) ( y = x m + 1 ) = ( 1 ) m n 1 ( m n ) m n ,
where we have used (14) in the first line.
Substituting the values of T 1 , T 2 , Q 1 , Q 2 , and Q 3 obtained in (44), (48), (52), (53), and (54) into (43), respectively, we obtain
2 ( 1 + t ) n k = 1 n H k 1 k 1 + 1 t k + 2 k = 1 m n ( 1 ) k H k 1 t n + k k n + k k 2 H n k = 1 m n ( 1 ) k t n + k k n + k k = H n H m n 2 H n ( 2 ) H m n ( 2 ) ( 1 + t ) n + 2 ( 1 ) n m n H n H m n k = 0 k n m ( 1 ) k n k m k ( 1 + t ) k 2 ( 1 ) n m n k = 0 k n m ( 1 ) k ( n k ) 2 m k ( 1 + t ) k .
Finally, employing Theorem 1, and replacing m by m + n in the resultant identity, we obtain the desired result (8). □

3. Particular Cases and Remarks

This section offers specific instances of the main results along with pertinent remarks.
Setting t = 1 in Equation (7) yields the identity presented in the following corollary.
Corollary 1. 
Let m , n N . Then,
k = 1 m 1 k n + k k = 1 n 1 1 m + n n .
The special case m = n leads to the following result:
k = 1 n 1 k n + k k = 1 n 1 1 2 n n ,
which recovers the result (6).
Setting t = 1 in Equation (7) yields the identity presented in the following corollary.
Corollary 2. 
Let m , n Z 0 . Then,
k = 1 m ( 1 ) k k n + k k = 2 n H m H n + k = 1 n 1 k 2 k ( 1 ) n m + n n k = 0 k n m + n m + n k ( 2 ) k n k .
In the particular case when m = n , this gives
k = 1 n ( 1 ) k k n + k k = k = 1 n 2 n k k ( 1 ) n 2 n n k = 0 k n 2 n 2 n k ( 2 ) k n k .
Corollary 3. 
Let m N and n Z 2 . Then,
k = 0 m 1 n + k k = n n 1 1 1 m + n n 1 .
The particular case when m = n gives the following identity:
k = 0 n 1 n + k k = n n 1 1 1 2 n n 1 ,
which recovers the result (5).
Proof. 
Differentiating both sides of (7) with respect to t, and setting t = 1 in the resulting identity, we obtain
k = 0 m 1 1 n + k k = n n 1 1 1 m + n 1 n 1 ,
which, upon replacing m with m + 1 , leads to the desired identity (55). □
Corollary 4. 
Let m Z 0  and  n Z 2 . Then,
k = 0 m ( 1 ) k n + k k = n 2 n 1 H m + 1 H n 1 + k = 1 n 1 1 k 2 k n ( 1 ) n m + n n 1 k = 0 k n 1 m + n m + n k ( 2 ) k n 1 k .
The particular case m = n yields
k = 0 n ( 1 ) k n + k k = n 2 n 1 1 n + 1 n + 1 + k = 1 n 1 1 k 2 k n ( 1 ) n 2 n n 1 k = 0 k n 1 2 n 2 n k ( 2 ) k n 1 k .
Proof. 
Differentiating both sides of (7) with respect to t, using the following identities:
n + 1 k + 1 n k = n + 1 k + 1 and n n k = n k ,
and putting t = 1 in the resulting identity, we have
k = 1 m ( 1 ) k n + k 1 k 1 = n 2 n 1 H m n k = 1 n 1 n 1 k H k n ( 1 ) n m + n 1 n 1 k = 1 k n m + n ( 1 ) k m + n 1 k 1 2 k 1 n k .
Set k 1 = k in the sum on the left hand side and in the third sum on the right hand side, and then delete the prime on k, and use (41) with u = 1 . Finally, replacing m with m + 1 in both sides of the last resulting identity, we obtain the desired identity (56). □
Setting t = 0 in (7) gives the identity stated in the following corollary.
Corollary 5. 
Let m , n Z 0 . Then,
k = 0 k n m + n ( 1 ) k n k m + n k = ( 1 ) n m + n n ( H m H n ) .
The special case m = n gives
k = 0 k n 2 n ( 1 ) k n k 2 n k = 0 .
Remark 1. 
Putting n = 0 in Equation (57) yields the classical identity due to Euler: For m Z 0 ,
k = 1 m ( 1 ) k 1 k m k = H m .
In this context, Equation (57) offers an intriguing and novel generalization of Equation (58).
By substituting t = 1 into (8), we obtain the identity presented in the following corollary.
Corollary 6. 
Let m Z 0  and  n N . Then,
k = 1 m H k 1 k n + k k = 1 n 2 n H m + 1 n 2 m + n n .
The particular case m = n gives
k = 1 n H k 1 k n + k k = 1 n 2 n H n + 1 n 2 2 n n .
Remark 2. 
Applying H k 1 = H k 1 k in (59) and using (1), we derive
k = 1 n H k k n + k k = n H n + 1 n 2 2 n n H n 1 ( 2 ) + 3 k = 1 n 1 k 2 2 k k .
By setting t = 1 into (8), we derive the identity shown in the following corollary.
Corollary 7. 
Let m , n Z 0 . Then,
k = 1 m ( 1 ) k H k 1 k n + k k = H m 2 H n 2 H m ( 2 ) H n ( 2 ) 2 n 1 + 2 n k = 1 m H n H k 1 k 2 k ( 1 ) n H m m + n n k = 0 k n m + n m + n k ( 2 ) k n k ( 1 ) n m + n n k = 0 k n m + n m + n k ( 2 ) k ( n k ) 2 .
The particular case when m = n gives
k = 1 n ( 1 ) k H k 1 k n + k k = H n ( 2 ) 2 n 1 + 2 n k = 1 m H n H k 1 k 2 k ( 1 ) n H n 2 n n k = 0 k n 2 n 2 n k ( 2 ) k n k ( 1 ) n 2 n n k = 0 k n 2 n 2 n k ( 2 ) k ( n k ) 2 .
Corollary 8. 
Let n Z 0 and t C . Then,
k = 1 n n k t k k 2 = k = 1 n ( H n H k 1 ) ( 1 + t ) k k H n 2 + H n ( 2 ) 2 .
Proof. 
Setting m = 0 in (8), we obtain
k = 1 n ( 1 ) k n k ( 1 + t ) k k 2 = k = 1 n H n H k 1 k 1 + 1 t k H n 2 + H n ( 2 ) 2 .
Then, replacing t with 1 + t t in the both sides of the above identity, we obtain the desired identity (60). □
Corollary 9. 
Let n N and t C . Then,
k = 1 n n k t k k 3 = k = 1 n H n H k 1 k j = 1 k ( 1 + t ) j 1 j .
Proof. 
Integrating both sides of Equation (60) over [ 0 , t ] , after dividing both sides by t, the proof follows. We omit the details. □
Setting t = 0 in (8) and using (57), we obtain the identity offered in the following corollary.
Corollary 10. 
Let m , n Z 0 . Then,
k = 0 k n m + n ( 1 ) k ( n k ) 2 m + n k = ( 1 ) n + 1 m + n n 2 H m H n 2 + H n ( 2 ) + H m ( 2 ) .
The particular case when m = n provides
k = 0 k n 2 n ( 1 ) k ( n k ) 2 2 n k = ( 1 ) n 1 2 n n H n ( 2 ) .
Corollary 11. 
Let m N and n Z 2 . Then,
k = 1 m H k n + k k = n n 1 1 n 1 H m + 1 n + m n 1 1 ( n 1 ) n + m n 1 .
The special case when m = n gives
k = 1 n H k n + k k = n n 1 1 n 1 H n + 1 2 n n 1 1 ( n 1 ) 2 n n 1 .
Proof. 
Differentiating both sides of (8) with respect to t and setting t = 1 in the resulting identity, we obtain
k = 1 m 1 H k n + k k = n ( n 1 ) 2 n H m ( n 1 ) m + n 1 n 1 n ( n 1 ) 2 m + n 1 n 1 .
Replacing m with m + 1 in the just preceding identity, we obtain the desired identity (61). □
Corollary 12. 
Let m , n N . Then,
k = 1 m ( 1 ) k 1 H k n + k k = n 2 n 2 H m + 1 2 H n 2 H m + 1 ( 2 ) H n ( 2 ) + 2 n 1 k = 1 n ( n + k ) ( H n H k 1 ) k 2 k + ( 1 ) n n H m + 1 m + n n 1 k = 0 k + 1 n m + n ( 1 ) k n k 1 m + n k 2 k + ( 1 ) n n m + n n 1 k = 0 k + 1 n m + n ( 1 ) k ( n k 1 ) 2 m + n k 2 k .
The special case when m = n offers
k = 1 n ( 1 ) k 1 H k n + k k = n 2 n 1 H n n + 1 H n ( 2 ) + 2 n 1 k = 1 n ( n + k ) ( H n H k 1 ) k 2 k + ( 1 ) n n H n + 1 2 n n 1 k = 0 k + 1 n 2 n ( 1 ) k n k 1 2 n k 2 k + ( 1 ) n n 2 n n 1 k = 0 k + 1 n 2 n ( 1 ) k ( n k 1 ) 2 2 n k 2 k .
Proof. 
By differentiating both sides of Equation (8) with respect to t, then setting t = 1 in the resulting expression, and finally replacing m with m + 1 in the last resulting identity, we derive the desired identity (62). □
Corollary 13. 
Let n Z 0 and m Z 1 . Then,
k = 2 m 1 k ( k 1 ) n + k k = ( 1 ) n H m 1 H n n + 1 + ( 1 ) n n + 1 k = 1 n ( 1 ) k k n k + 1 ( n + 1 ) m + n 1 + n k = 1 k n + 1 m + n ( 1 ) k n k + 1 m + n k .
The particular case when m = 1 offers
k = 1 n ( 1 ) n k n k + 1 n + 1 k = H n k = 1 n ( 1 ) k k n k .
Proof. 
Replacing t with t in (7), we have
( 1 ) n k = 1 m t n + k k n + k k = H m H n ( 1 t ) n + k = 1 n ( 1 ) k t k ( 1 t ) n k k ( 1 ) n m + n n k = 0 k n m + n ( 1 ) k m + n k ( 1 t ) k n k .
Integrating both sides of this equality from t = 0 to t = 1 and using the well-known gamma-beta functional equation, we obtain
k = 1 m 1 k ( n + k + 1 ) n + k k = ( 1 ) n H m H n n + 1 + ( 1 ) n n + 1 k = 1 n ( 1 ) k k n k 1 m + n n k = 0 k n m + n ( 1 ) k ( k + 1 ) n k m + n k .
Using n + 1 k + 1 n k = n + 1 k + 1 , we obtain
k = 1 m 1 k ( n + k + 1 ) n + k k = k = 1 m 1 k ( k + 1 ) n + k + 1 k + 1 = k = 2 m + 1 1 k ( k 1 ) n + k k
and
1 m + n n k = 0 k n m + n ( 1 ) k ( k + 1 ) ( n k ) m + n k = 1 ( n + 1 ) m + n + 1 n + 1 k = 0 k n m + n m + n + 1 k + 1 ( 1 ) k n k = 1 ( n + 1 ) m + n + 1 n + 1 k = 1 k n + 1 m + n m + n + 1 k ( 1 ) k 1 n k + 1 .
Using (66) and (67) in (65) and replacing m with m 1 , the desired identity (63) follows. □
Remark 3. 
Setting t = 1 in (60), we obtain
k = 1 m ( 1 ) k 1 k 2 m k = 1 2 H m 2 + H m ( 2 ) ( m Z 0 ) .
By using (64) and (68), along with the partial fractions
1 k 2 ( k + 1 ) = 1 k 2 1 k + 1 k + 1 ,
and
1 k ( k + 1 ) 2 = 1 k 1 ( k + 1 ) 2 1 k + 1 ,
we obtain the following identities: For m Z 0 ,
k = 1 m ( 1 ) k 1 k 2 ( k + 1 ) m k = 1 1 m + 1 H m + 1 2 H m 2 + H m ( 2 ) ;
k = 1 m ( 1 ) k 1 k ( k + 1 ) 2 m k = 2 + 1 m + 1 + 1 ( m + 1 ) 2 + m + 2 m + 1 H m .
To derive Equation (70), we utilize the subsequent identity
k = 1 m ( 1 ) k 1 ( k + 1 ) 2 m k = 1 1 ( m + 1 ) 2 H m m + 1 ( m Z 0 ) ,
for which we also use Equation (68) and the well-known binomial identity
m k + m k 1 = m + 1 k .
The following identities are similar to those found above:
k = 1 m ( 1 ) k 1 k 3 m k = 1 6 H m 3 + 1 2 H m H m ( 2 ) + 1 3 H m ( 3 ) ;
k = 1 m ( 1 ) k 1 k 4 m k = 1 24 H m 4 + 1 4 H m 2 H m ( 2 ) + 1 8 H m ( 2 ) 2 + 1 3 H m H m ( 3 ) + 1 4 H m ( 4 ) ;
k = 1 m ( 1 ) k 1 k 5 m k = 1 120 H m 5 + 1 12 H m 3 H m ( 2 ) + 1 8 H m H m ( 2 ) 2 + 1 6 H m 2 H m ( 3 ) + 1 6 H m ( 2 ) H m ( 3 ) + 1 4 H m H m ( 4 ) + 1 5 H m ( 5 ) ;
k = 1 m ( 1 ) k 1 k 6 m k = 1 720 H m 6 + 1 48 H m 4 H m ( 2 ) + 1 16 H m 2 H m ( 2 ) 2 + 1 48 H m ( 2 ) 3 + 1 18 H m 3 H m ( 3 ) + 1 6 H m H m ( 2 ) H m ( 3 ) + 1 18 H m ( 3 ) 2 + 1 8 H m 2 H m ( 4 ) + 1 8 H m ( 2 ) H m ( 4 ) + 1 5 H m H m ( 5 ) + 1 6 H m ( 6 ) ;
k = 1 m ( 1 ) k 1 k 3 ( k + 1 ) m k = 1 6 H m 3 + 1 2 H m H m ( 2 ) + 1 3 H m ( 3 ) 1 2 H m 2 1 2 H m ( 2 ) 1 + 1 m + 1 + H m ;
k = 1 m ( 1 ) k 1 k 4 ( k + 1 ) m k = 1 24 H m 4 + 1 4 H m 2 H m ( 2 ) + 1 8 H m ( 2 ) 2 + 1 3 H m H m ( 3 ) + 1 4 H m ( 4 ) 1 6 H m 3 1 2 H m H m ( 2 ) 1 3 H m ( 3 ) + 1 2 H m 2 + 1 2 H m ( 2 ) + 1 1 m + 1 H m ,
where m Z 0 .
Identities (71), (72), (73), and (74) can be derived by applying Equations (11) and (12) to the corresponding formulas obtained from MATHEMATICA 13.0. Indeed, a generalized formula that encompasses the identities (68), (71), (72), and (73) as special cases is presented in [11] (Corollary 3.2).
Formula (75) can be obtained by using the same method in (69), along with Equations (64), (68), and (71).
Formula (76) can be derived by using the same method in (69), along with Equations (64), (68), (71), and (72).

4. Concluding Remarks

We have conducted a thorough analysis of the following finite parameterized binomial 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 Z 0 , ϵ { 1 , 1 } , and p = 0 , 1 . Our study includes numerous corollaries that underscore the significance of our findings.
Our results appear to be novel in the existing literature, and we believe that our methodology is at least as important as the results themselves. By applying our method to the third, fourth, and higher derivatives of Equation (2) with respect to the variable x, many additional parameterized finite binomial sums involving harmonic numbers can be derived.
Infinite versions of the sums we explored can be found in [12]. For further parameterized finite binomial sums, we direct readers to [13].

Author Contributions

Writing—original draft, N.B. and J.C.; Writing—review and editing, N.B. and J.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Acknowledgments

The authors express their sincere gratitude to the anonymous reviewers for their invaluable feedback. Their constructive and encouraging comments have significantly enhanced the quality of this paper.

Conflicts of Interest

The authors have no conflicts of interest.

References

  1. Sun, Z.-W. Super congruences and Euler numbers. Sci. China Math. 2011, 54, 2509–2535. [Google Scholar] [CrossRef]
  2. Sofo, A.; Batır, N. On finite sums and integral representations. Integers 2013, 13, A45. [Google Scholar]
  3. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Inc.: Amsterdam, The Netherlands, 2012. [Google Scholar]
  4. Batır, N.; Choi, J. Certain logarithmic integrals and associated Euler sums. J. Math. Anal. Appl. 2024, 538, 128365. [Google Scholar] [CrossRef]
  5. Alzer, H.; Choi, J. Four parametric linear Euler sums. J. Math. Anal. Appl. 2020, 484, 123661. [Google Scholar] [CrossRef]
  6. Batır, N.; Choi, J. Four types of variant Euler harmonic sums. Appl. Anal. Discret. Math. 2024, in press. [Google Scholar] [CrossRef]
  7. Gould, H. Solution to advanced problem H-219. Fibonacci Quart. 1975, 13, 185–187. [Google Scholar]
  8. Batır, N.; Sofo, A. A unified treatment of certain classes of combinatorial identities. J. Integer. Seq. 2021, 24, 21.3.2. [Google Scholar]
  9. Batır, N. Finite binomial sum identities with harmonic numbers. J. Integer. Seq. 2021, 24, 21.4.3. [Google Scholar]
  10. Batır, N. Combinatorial identities involving harmonic numbers. Integers 2020, 20, A25. [Google Scholar]
  11. Batır, N. On some combinatorial identities and harmonic sums. Int. J. Number Theory 2017, 13, 1695–1709. [Google Scholar] [CrossRef]
  12. Batır, N. Parametric binomial sums involving harmonic numbers. Rev. Real Acad. Cienc. Exactas FíSicas Nat. Ser. A Mat. 2021, 115, 91. [Google Scholar] [CrossRef]
  13. Batır, N.; Chen, K.-W. Combinatorial identities involving reciprocals of the binomial and central binomial coefficients and harmonic numbers. J. Differ. Equations Appl. 2022, 28, 222–243. [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.

Share and Cite

MDPI and ACS Style

Batır, N.; Choi, J. Parameterized Finite Binomial Sums. Mathematics 2024, 12, 2450. https://doi.org/10.3390/math12162450

AMA Style

Batır N, Choi J. Parameterized Finite Binomial Sums. Mathematics. 2024; 12(16):2450. https://doi.org/10.3390/math12162450

Chicago/Turabian Style

Batır, Necdet, and Junesang Choi. 2024. "Parameterized Finite Binomial Sums" Mathematics 12, no. 16: 2450. https://doi.org/10.3390/math12162450

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