MathDB
O 55

Source:

May 25, 2007

Problem Statement

The set MM consists of integers, the smallest of which is 11 and the greatest 100100. Each member of MM, except 11, is the sum of two (possibly identical) numbers in MM. Of all such sets, find one with the smallest possible number of elements.