# Every Map Needs Only 4 Colors

## Метаданные

- **Канал:** BriTheMathGuy
- **YouTube:** https://www.youtube.com/watch?v=N-RqdOC5KMs
- **Дата:** 12.05.2026
- **Длительность:** 1:08
- **Просмотры:** 33,380
- **Источник:** https://ekstraktznaniy.ru/video/51478

## Описание

Pick any map — countries, states, made-up regions, anything. To color it so no two neighbors share a color, you only ever need four. That's the four color theorem, and the proof took 124 years and a computer.

Francis Guthrie noticed it in 1852. The proof finally came in 1976 from Kenneth Appel and Wolfgang Haken — and it was the **first major theorem ever proved by computer**, reducing every possible map to 1,936 special cases that a machine checked one by one. Mathematicians were furious. Some still don't accept it.

But it's true. Four colors. Every single map. Always enough.

#shorts #math #brithemathguy

## Транскрипт

### Segment 1 (00:00 - 01:00) []

Grab any map, any map at all. States, countries, made-up regions, whatever. Now try to color it so that no two neighboring regions share the same color. You might think you'd need dozens of colors, but you don't. You only ever need four. That's the four color theorem. No matter how complicated the map, no matter how many regions, four colors is always enough. And people tried to prove this for over a hundred years. This was noticed in flag patterns in around the 1850s. But the proof didn't come until 1976, and the wild part, the proof required a computer. This team reduced every possible map to 1,936 special cases, and then a computer checked each one. It was the first major theorem proved by a computer. Mathematicians were furious, and some refused to accept it. But it's true. Four colors, every single map, always enough.