MathDB
P 38

Source:

May 25, 2007
Additive Number Theory

Problem Statement

Find the smallest possible nn for which there exist integers x1x_{1}, x2x_{2}, ⋯\cdots, xnx_{n} such that each integer between 10001000 and 20002000 (inclusive) can be written as the sum (without repetition), of one or more of the integers x1x_{1}, x2x_{2}, ⋯\cdots, xnx_{n}.
Back to ProblemsView on AoPS