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

For each bin, no two different numbers in it can add up to a prime number.

What is the largest \(n\) for which this is possible?

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

×

Problem Loading...

Note Loading...

Set Loading...