CMIMC 2020 Power Problem 3.2

[system]

Let \mathcal{C} be a binary code with block length n and minimum distance 3. Prove that

|\mathcal{C}| \leq \frac{2^{n}}{n+1}