Squarefree sums
Let be a subset of , such that no two distinct elements of S sum to a multiple of a perfect square greater than 1.
At most how many elements can have?
The answer is 5.
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.
0 solutions
No explanations have been posted yet. Check back later!