The hardest problems in math — explained for a 10-year-old
Imagine your friend hands you a finished jigsaw puzzle and asks: “Did I put this together correctly?”— you can check in seconds. But if they hand you a box of 1,000 scrambled pieces and say “You do it” — that takes way longer.
That's the big idea behind NP-Complete problems. Checking an answer is easy. Finding the answer might take longer than the age of the universe.
Problems that are fast to solve AND fast to check. Like multiplying two numbers.
Fast to check, but might be slow to solve. Like verifying a jigsaw vs. solving one.
The hardest NP problems. If you find a shortcut for ANY of these, you solve them all.
Each of these sounds simple — until you try to solve them perfectly for a big input.
You want to visit 10 friends' houses in one bike ride — but you want to take the shortest possible route so you're not exhausted. Easy with 3 friends. Miserable with 30.
Your backpack can only hold 8 lbs. You have a pile of stuff with different weights and fun-scores. Which combo fits AND gives you the most fun on your trip?
Color a map so that no two countries touching each other share the same color. Try to use as few colors as possible. Sounds easy — but figuring out the MINIMUM colors needed for any map is brutally hard.
Your backpack holds 8 lbs. Click items to pack them. Try to get the highest fun score without going over the weight limit!
Encryption that protects your bank account and messages uses math that's NP-hard to crack. Breaking it would take longer than the universe has existed.
Companies like Amazon and FedEx need to pack trucks and plan delivery routes. They use clever tricks to get a *good* answer fast — but nobody can guarantee the perfect answer.
Many puzzle games (Tetris, Minesweeper, even Mario!) are secretly NP-complete. Game designers use this difficulty to make levels that feel impossibly tricky.
Nobody has ever proven whether a perfect shortcut exists for NP-Complete problems — or proven it's impossible. This is called the P vs NP problem, and it's one of the 7 Millennium Prize Problems.
Solve it, and you win $1,000,000 from the Clay Mathematics Institute — plus you'd probably break all the encryption on the internet, which would be a problem.
The smartest mathematicians and computer scientists in the world have been working on it for 50+ years. Maybe you'll crack it. 🤷