×

# Boxes and multiples

For an integer $$n \geq 3$$, John has $$n-1$$ cards numbered from 2 to $$n$$ and he wants to put them in two boxes according to the following rule:
If $$a$$ and $$b$$ are the numbers of two cards and $$b \mid 2^{a}-1$$, then the cards with these numbers are in different boxes.

What's the biggest number $$n$$ for which it is possible for John to keep following this rule?

Note by John Smith
7 months ago

Sort by:

@Jon Haussmann You're right. I made a mistake at n=7. Do you think there's any better way to prove this? I can't come up with anything other than this brute force method. · 7 months ago

I don't see any other way. And it's pretty easy to go up to $$n = 7$$, so I wouldn't call it brute force. · 7 months ago

I can only get up to $$n = 6$$.

Call the boxes box A and box B. The number 2 has to go somewhere, so let's just put it in box A.

Since 3 divides $$2^2 - 1$$, the number 3 has to go in box B. Since 3 divides $$2^4 - 1$$ and $$2^6 - 1$$, the numbers 4 and 6 have to go in box A. Since 5 divides $$2^4 - 1$$, the number 5 has to go in box B. Thus, we can place the numbers 2, 3, 4, 5, and 6. Furthermore, the placement of these numbers is forced, i.e. this is the only possible way. (We can swap the numbers in box A and box B, but it's basically the same.)

Now, 7 divides $$2^3 - 1$$ and $$2^6 - 1$$, so we cannot place the number 7 in either box. This means $$n = 6$$ is as high as we can go. · 7 months ago