olymmath

ISL 1989 Problem 54

    Let n=2k−1n = 2k - 1 where k≥6k \geq 6 is an integer. Let TT be the set of all n−n- tuples (x1,x2,…,xn)(x_1, x_2, \ldots, x_n) where xi∈{0,1}x_i \in \{0,1\} ∀i={1,2,…,n}\forall i = \{1,2, \ldots, n\} For x=(x1,x2,…,xn)∈Tx = (x_1, x_2, \ldots, x_n) \in T and y=(y1,y2,…,yn)∈Ty = (y_1, y_2, \ldots, y_n) \in T let d(x,y)d(x,y) denote the number of integers jj with 1≤j≤n1 \leq j \leq n such that xi≠xjx_i \neq x_j , in particular d(x,x)=0.d(x,x) = 0. Suppose that there exists a subset SS of TT with 2k2^k elements that has the following property: Given any element x∈T,x \in T, there is a unique element y∈Sy \in S with d(x,y)≤3.d(x, y) \leq 3. Prove that n=23.n = 23.

    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 isl/1989/p54 · Tag 5JT6VJTY9V · Edit this page on GitHub · Keys: j next, k previous