olymmath

NMC 1998 Problem 4

  • Answer

Let nn be a positive integer. Count the number of numbers k∈{0,1,2,…,n}k \in\{0,1,2, \ldots, n\} such that (nk)\binom{n}{k} is odd. Show that this number is a power of two, i.e. of the form 2p2^{p} for some nonnegative integer pp.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2^{e(n)}

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator nordic/1998/p4 · Tag 6YR0XW7JZF · Edit this page on GitHub · Keys: j next, k previous