dowodzenie tożsamości

kombinatorycznych
   
n
 =
n 
k n−k
   
n + 1 n
(k + 1) = (n + 1) 
k+1 k
     
n
 +
n  n + 1 
=
k k+1 k+1
 
n n
= 2n
X
 
k=0 k
 
n n
= n2n−1
X
k 
k=1 k
 
n n
= n(n − 1)2n−2
X
k(k − 1)
k=2 k
 
n n
 2k = 3n
X

k=0 k
    
k
X m n  m + n
  =
j=0 j k−j k
 2  
n
X n 2n
  = 
k=0 k n
 2  
n
X n 2n − 1
k  = n
k=0 k n−1
   
n
X k n + 1
 =
k=0 1 2
    
n
X k n + 1
 =
k=0 2 3
   
m
X k m + 1
 =
k=n n n+1
n
2k = 2n+1 − 1
X

k=0