Here’s a cute problem, called the Boolean Pythagorean Theorem problem. Here are the first few Pythagorean triples:
OK, let’s have some fun with this. Let’s write every multiple of 5 (5, 10, 15, 20, 25, 30, 35, 40, 45) in boldface:
For nearly all of these equations, there is one number that’s in boldface and one that’s not. However, there’s one that is all in one typeface: .
So here’s a question: is it possible to divide the integers so that every Pythagorean triple (not just the small ones listed above) has at least one number in boldface and another that’s not?
This May, it was proved that it’s impossible. The proof is very brute-force (from https://cosmosmagazine.com/mathematics/computer-cracks-200-terabyte-maths-proof):
The team found all triples could be multi-coloured in integers up to 7,824. As soon as they hit 7,825, it became impossible.
But to prove a solution doesn’t exist, you need to try all possibilities. There are more than ways to colour all those integers, so the scientists used a few mathematical tricks to reduce the number of combinations to trial to just under one trillion.
Two days later, with 800 processors at the University of Texas Stampede supercomputer crunching all possibilities in parallel, the team had their answer – no.
There is no way to colour the integers 1 to 7,825 in a way that leaves all Pythagorean triples multi-coloured, the team reported in arXiv.
I had to read this news article a couple of times to appreciate this: a supercomputer ran for two days on a supercomputer (without parallelization, computation time was 51,000 hours), producing an output file of 200 terabytes, comparable “to the size of the entire digitized text held by the US Library of Congress.” Wow.