olymmath

US-TST 2011 Problem 8

    Let n≥1n \geq 1 be an integer, and let SS be a set of integer pairs (a,b)(a,b) with 1≤a<b≤2n1 \leq a < b \leq 2^n . Assume ∣S∣>n⋅2n+1|S| > n \cdot 2^{n+1} . Prove that there exists four integers a<b<c<da < b < c < d such that SS contains all three pairs (a,c)(a,c) , (b,d)(b,d) and (a,d)(a,d) .

    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 us-tst/2011/p8 · Tag F24CSMV0J9 · Edit this page on GitHub · Keys: j next, k previous