MathDB
Problems
Contests
National and Regional Contests
Kosovo Contests
Kosovo Team Selection Test
2017 Kosovo Team Selection Test
4
2017 Kosovo TST Problem 4
2017 Kosovo TST Problem 4
Source:
March 19, 2017
combinatorics
Problem Statement
For every
n
∈
N
0
n \in \mathbb{N}_{0}
n
∈
N
0
, prove that
∑
k
=
0
[
n
2
]
2
n
−
2
k
(
n
2
k
)
=
3
n
+
1
2
\sum_{k=0}^{\left[\frac{n}{2} \right]}{2}^{n-2k} \binom{n}{2k}=\frac{3^{n}+1}{2}
∑
k
=
0
[
2
n
]
2
n
−
2
k
(
2
k
n
)
=
2
3
n
+
1
Back to Problems
View on AoPS