Square bins

The numbers 1 through n n (inclusive) are separated into 2 bins.

For each bin, no two different numbers in it can multiply together to form a square number.

What is the largest n n for which this is possible?

If you think the answer is infinite, please put 99999 as your answer.


The answer is 8.

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

Geoff Pilling
Nov 21, 2016

The numbers 1-8 can be separated in the following way::

  • Bin 1: 1,2,3,5,6,7
  • Bin 2: 4,8

Now, once we get to 9, there is no solution. Consider only the numbers 1, 4, and 9. No two of them can be placed in the same bin since the product of any two is a square. Therefore, you would need at least 3 bins to accommodate them.

Therefore, 8 \boxed{8} is the highest value for n n .

Great question!

Unfortunately, the argument of "the case of 9 must be obtained from the case of 8" isn't valid. We need a seperate argument.

Calvin Lin Staff - 4 years, 6 months ago

Log in to reply

Good point... I've updated the solution!

Geoff Pilling - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...