MathDB
at least n^2 integers written in the form x+yz with x,y,z\in S

Source: Mediterranean Mathematical Olympiad 2020 P2 MMC

September 23, 2020
number theorycombinatorics

Problem Statement

Let SS be a set of n≥2n\ge2 positive integers. Prove that there exist at least n2n^2 integers that can be written in the form x+yzx+yz with x,y,z∈Sx,y,z\in S.
Proposed by Gerhard Woeginger, Austria
Back to ProblemsView on AoPS