olymmath

CN-TST 2019 Problem 24

  • Test 4

Given positive integer n,kn,k such that 2≤n<2k2 \le n <2^k . Prove that there exist a subset AA of {0,1,⋯ ,n}\{0,1,\cdots,n\} such that for any x≠y∈Ax \neq y \in A , (yx){y\choose x} is even, and ∣A∣≥(k⌊k2⌋)2k⋅(n+1)|A| \ge \frac{{k\choose \lfloor \frac{k}{2} \rfloor}}{2^k} \cdot (n+1)

Dataset text AI-MO AoPS. Quoted with source.

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

Similar problems

These problems have the most words in common with this statement.

Locator cn-tst/2019/p24 · Tag 41WYRPJ8YF · Edit this page on GitHub · Keys: j next, k previous