olymmath

HMIC 2017 Problem 5

    Let SS be the set {−1,1}n\{-1,1\}^{n}, that is, nn-tuples such that each coordinate is either -1 or 1 . For

    s=(s1,s2,…,sn),t=(t1,t2,…,tn)∈{−1,1}ns=\left(s_{1}, s_{2}, \ldots, s_{n}\right), t=\left(t_{1}, t_{2}, \ldots, t_{n}\right) \in\{-1,1\}^{n}

    define s⊙t=(s1t1,s2t2,…,sntn)s \odot t=\left(s_{1} t_{1}, s_{2} t_{2}, \ldots, s_{n} t_{n}\right). Let cc be a positive constant, and let f:S→{−1,1}f: S \rightarrow\{-1,1\} be a function such that there are at least (1−c)⋅22n(1-c) \cdot 2^{2 n} pairs (s,t)(s, t) with s,t∈Ss, t \in S such that f(s⊙t)=f(s)f(t)f(s \odot t)=f(s) f(t). Show that there exists a function f′f^{\prime} such that f′(s⊙t)=f′(s)f′(t)f^{\prime}(s \odot t)=f^{\prime}(s) f^{\prime}(t) for all s,t∈Ss, t \in S and f(s)=f′(s)f(s)=f^{\prime}(s) for at least (1−10c)⋅2n(1-10 c) \cdot 2^{n} values of s∈Ss \in S.

    Dataset text NuminaMath olympiads. 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 hmic/2017/p5 · Tag FTJSVX1XJJ · Edit this page on GitHub · Keys: j next, k previous