olymmath

KURSCHAK 2015 Problem 3

    Let Q={0,1}nQ=\{0,1\}^n , and let AA be a subset of QQ with 2n−12^{n-1} elements. Prove that there are at least 2n−12^{n-1} pairs (a,b)∈A×(Q∖A)(a,b)\in A\times (Q\setminus A) for which sequences aa and bb differ in only one term.

    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 kurschak/2015/p3 · Tag KXYZ5FPYC4 · Edit this page on GitHub · Keys: j next, k previous