Problem

Source: Regional Olympiad - Federation of Bosnia and Herzegovina 2018

Tags: Sets, number theory, binomial coefficients



$a)$ Prove that for all positive integers $n \geq 3$ holds: $$\binom{n}{1}+\binom{n}{2}+...+\binom{n}{n-1}=2^n-2$$where $\binom{n}{k}$ , with integer $k$ such that $n \geq k \geq 0$, is binomial coefficent $b)$ Let $n \geq 3$ be an odd positive integer. Prove that set $A=\left\{ \binom{n}{1},\binom{n}{2},...,\binom{n}{\frac{n-1}{2}} \right\}$ has odd number of odd numbers