You're given k boxes.
Each box might only contain balls, such that there are no two which sum is a third one in this box.
How many balls can you sort, given them with the numbers 1,2,3,..., into k boxes? Find out!
The problem is a (yet) unsolved problem called the Schur number: the maximum amount you can fit into those boxes! :D
Each box might only contain balls, such that there are no two which sum is a third one in this box.
How many balls can you sort, given them with the numbers 1,2,3,..., into k boxes? Find out!
The problem is a (yet) unsolved problem called the Schur number: the maximum amount you can fit into those boxes! :D
Show More
