olymmath

CMO 2014 Problem 6

  • Day 2

For non-empty number sets S,TS, T , define the sets S+T={s+t∣s∈S,t∈T}S+T=\{s+t\mid s\in S, t\in T\} and 2S={2s∣s∈S}2S=\{2s\mid s\in S\} . Let nn be a positive integer, and A,BA, B be two non-empty subsets of {1,2…,n}\{1,2\ldots,n\} . Show that there exists a subset DD of A+BA+B such that

  1. D+D⊆2(A+B)D+D\subseteq 2(A+B) ,
  2. ∣D∣≥∣A∣⋅∣B∣2n|D|\geq\frac{|A|\cdot|B|}{2n} , where ∣X∣|X| is the number of elements of the finite set XX .

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 cn-mo/2014/p6 · Tag JP4MR29E78 · Edit this page on GitHub · Keys: j next, k previous