Is there even a way to solve this?
Let S be a set of 3 integers, and , that use every integer once, 1 through 5, where . Let G be a set of different integers, and , that only use all integers once, 1 through 4, where . Find .
The answer is 64.
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.
1 solution
The numbers are 1 3 , 4 , and 5 2 in set S. In set G, they are 3 , 4 , and 1 2 . Thus 1 2 + 5 2 is 64.