Let set be the set of distinct positive integers that can be represented in the form , where . Find the minimum value of the sum of 2 distinct elements in .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
g cd ( 6 , 9 6 ) = 6 , so S is simply the set of positive multiples of 6. The smallest sum of 2 distinct elements is thus 6 + 1 2 = 1 8 .