MathDB
O 29

Source:

May 25, 2007
modular arithmeticinductionceiling functioninequalitiesnumber theory

Problem Statement

Let AA be a set of NN residues (modN2)\pmod{N^2}. Prove that there exists a set BB of NN residues (modN2)\pmod{N^2} such that the set A+B={a+b∣a∈A,b∈B}A+B=\{a+b \vert a \in A, b \in B \} contains at least half of all the residues (modN2)\pmod{N^2}.
Back to ProblemsView on AoPS