olymmath

BALTIC-WAY 2015 Problem 10

    A subset SS of {1,2,…,n}\{1,2, \ldots, n\} is called balanced if for every a∈Sa \in S there exists some b∈S,b≠ab \in S, b \neq a, such that a+b2∈S\frac{a+b}{2} \in S as well.

    (a) Let k>1k>1 be an integer and let n=2kn=2^{k}. Show that every subset SS of {1,2,…,n}\{1,2, \ldots, n\} with ∣S∣>3n4|S|>\frac{3 n}{4} is balanced.

    (b) Does there exist an n=2kn=2^{k}, with k>1k>1 an integer, for which every subset SS of {1,2,…,n}\{1,2, \ldots, n\} with ∣S∣>2n3|S|>\frac{2 n}{3} is balanced?

    Solution of part (a). Let m=n−∣S∣m=n-|S|, thus m<n4m<\frac{n}{4} and (as nn is a multiple of 4 ) m≤n4−1m \leq \frac{n}{4}-1. Let a∈Sa \in S. There are n2−1\frac{n}{2}-1 elements in {1,2,…,n}\{1,2, \ldots, n\} distinct from aa and with the same parity as aa. At most mm of those elements are not in SS, hence at least n2−1−m≥n4\frac{n}{2}-1-m \geq \frac{n}{4} of them are in SS. For each such bb, the number a+b2\frac{a+b}{2} is an integer, and all of these at least n4\frac{n}{4} numbers are distinct. But at most m<n4m<\frac{n}{4} of them are not in SS, so at least one is a member of SS. Hence SS is balanced.

    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

    Locator baltic-way/2015/p10 · Tag C277HHWZ9K · Edit this page on GitHub · Keys: j next, k previous