Four Color Theorem
A theorem that says:
When you try to color in a map so that no two touching areas have the same color, then you only need four colors. (Note: some restrictions apply).
It was proved in 1976 by Kenneth Appel, Wolfgang Haken, and John Koch using a computer to check it.
- composite number
- composition
- compound interest
- compounding
- computation
- computer
- concave
- concentric circles
- conclusion
- concurrent lines
- conditional statement
- cone
- congruent
- conic section
- conical
- conjecture
- conjugate
- conjugate angles
- conjunction
- consecutive interior angles
- consecutive numbers
- constant
- constant of proportionality
- construction (geometry)
- continuous data