Snake oil method: evaluation of sums

In this note we discuss a method for evaluating sums.

Before we start it, recall the following generating functions:
∞  
X n k
x = (1 + x)n ,
k=0
k
∞  
X n n xk
x = k+1
,
n=0
k (1 − x)
and
∞  
X 2n 1
xn = √ .
n=0
n 1 − 4x
Warning: it’s easy to confuse the first two identities, be careful whether n or
k is the running parameter.
The snake oil method is a very simple method, let’s see an example.
Problem 1.1. Find a closed form for the sum
X  n  k 
.
k
2k m
Proof. Let
X  n  k 
An = .
k
2k m
Then
∞ ∞
!
X X X  n  k 
A n xn = xn =
n=0 n=0 k
m 2k
∞
! ∞  
x2k
X k   
X n 
n
X k
= x = 2k+1
=
k=0
m n
2k k=0
m (1 − x)
 2 m
∞   k x
2
1 X k x 1 (1−x)2
= = m+1 =
1 − x k=0 m (1 − x)2 1−x

x2
1 − (1−x)2
x2m m (2x)m
= (1 − x) = (1 − x)(x/2) =
(1 − 2x)m+1 (1 − 2x)m+1
∞  
m
X r
= (1 − x)(x/2) (2x)r .
r=m
m
1
2

By comparing the coefficients of xn we get that

    
1 n − m n−m n − m − 1 n−m−1
An = m 2 − 2 =
2 m m
      
n−2m−1 n−m n − 2m n − m n−2m−1 n n−m
=2 2 − =2 .
m n−m m n−m m

So the solution consisted of the steps
An xn ,
P
(i) call An the sum, and write up
(ii) interchange the two sums,
(iii) used the above identities to find a closed form for the generating func-
tion,
(iv) find a closed form for the sum.
Problem 1.2. Find a closed form for the sum
n  
X n + k n−k
2 .
k=0
2k

Proof. Again let

n  
X n + k n−k
An = 2 .
k=0
2k
Then
∞ ∞ n   !
X X X n + k
A n xn = 2n−k xn =
n=0 n=0 k=0
2k
∞
! ∞
(2x)k
X 1 X n+k  
n
X 1
(2x) = =
k=0
2k n
2k k=0
2k (1 − 2x)2k+1
∞  k
1 X x 1 1
= = x =
1 − 2x k=0 (1 − 2x)2 1 − 2x 1 − (1−2x) 2

1 − 2x 1 − 2x 2 1 1 1 2X n 1X n
= = + = (4x) + x .
1 − 5x + 4x2 (1 − x)(1 − 4x) 3 1 − 4x 3 1 − x 3 n 3 n
Hence
n  
X n + k n−k 1
2 = (2 · 4n + 1).
k=0
2k 3

 3

Problem 1.3. Show that

X mn + k  X mn
= 2k .
k
k m k
k k

Proof. Let
X mn + k 
An = ,
k
k m
and
X mn
Bn = 2k .
k
k k
Then
∞ ∞
!
X X X mn + k 
A n xn = xn =
n=0 n=0 k
k m

∞   X  ! X ∞  
X m n+k n m xm−k
= x = =
k=0
k n
m k=0
k (1 − x)m+1
m
xm X m xm (1 + x)m

−k 1
= x = 1 + = .
(1 − x)m+1 k k (1 − x)m+1 x (1 − x)m+1
On the other hand,
∞ ∞
!
X X X mn
Bn xn = 2k xn =
n=0 n=0 k
k k

∞  
! ∞  
X m k
Xn
n
X m k xk
= 2 x = 2 k+1
=
k=0
k n
m k=0
k (1 − x)
∞   k m
(1 + x)m

1 X m 2x 1 2x
= = 1+ = .
1 − x k=0 k 1−x 1−x 1−x (1 − x)m+1
Hence An = Bn for all n. 
Problem 1.4. Find a closed form for the sum
n   
n−k 2k k
X
An = (−1) .
k=0
k n−k
4

Proof. Let
n   
n−k 2k k
X
An = (−1) .
k=0
k n − k
Then
∞ ∞ n   !
X X X 2k k
A n xn = (−1)n−k xn =
n=0 n=0 k=0
k n − k
∞     ! ∞   ∞  
X 2k k X k n−k
X 2k k k
X 2k
= x (−x) = x (1−x) = (x(1−x))k =
k=0
k n
n − k k=0
k k=0
k
∞
1 1 X
=p = = 2n xn .
1 − 4x(1 − x) 1 − 2x n=0
Hence n   
n−k 2k k
X
(−1) = 2n .
k=0
k n−k

Problem 1.5. Find a closed form for the sum
X m2m − 2k 
(−2)k .
k=0
k m − k
Proof. First we carry out a change of variable: m − k = r. Then
X m2m − 2k  X m2r
k
Am = (−2) = (−2)m−r .
k=0
k m−k r=0
r r
Then
∞ ∞
! ∞   ∞  
!
X X X m2r X 2r X m
m
Am x = (−2)m−r xm = (−2)−r (−2x)m =
m=0 m=0 r=0
r r r=0
r m=r
r
∞ ∞ r
(−2x)r
     
X 2r −r 1 X 2r x
= (−2) = =
r=0
r (1 + 2x)r+1 1 + 2x r=0 r 1 + 2x
1 1 1
= p x =√ =
1 + 2x 1 − 4 1+2x 1 − 4x2
∞  
X 2n 2n
= x .
n=0
n
m


Hence Am = 0 if m is odd, and Am = m/2 if m is even.