MathDB
Problems
Contests
International Contests
IMO Longlists
1978 IMO Longlists
40
Proving a combinatorial identity and finding expression
Proving a combinatorial identity and finding expression
Source:
October 30, 2010
induction
combinatorics proposed
combinatorics
Problem Statement
If
C
n
p
=
n
!
p
!
(
n
−
p
)
!
(
p
≥
1
)
C^p_n=\frac{n!}{p!(n-p)!} (p \ge 1)
C
n
p
=
p
!
(
n
−
p
)!
n
!
(
p
≥
1
)
, prove the identity
C
n
p
=
C
n
−
1
p
−
1
+
C
n
−
2
p
−
1
+
⋯
+
C
p
p
−
1
+
C
p
−
1
p
−
1
C^p_n=C^{p-1}_{n-1} + C^{p-1}_{n-2} + \cdots + C^{p-1}_{p} + C^{p-1}_{p-1}
C
n
p
=
C
n
−
1
p
−
1
+
C
n
−
2
p
−
1
+
⋯
+
C
p
p
−
1
+
C
p
−
1
p
−
1
and then evaluate the sum
S
=
1
⋅
2
⋅
3
+
2
⋅
3
⋅
4
+
⋯
+
97
⋅
98
⋅
99.
S = 1\cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \cdots + 97 \cdot 98 \cdot 99.
S
=
1
⋅
2
⋅
3
+
2
⋅
3
⋅
4
+
⋯
+
97
⋅
98
⋅
99.
Back to Problems
View on AoPS