Clare has a project in school where she has to design a map of the United States. The only stipulation to the project is that no two adjoining states can be the same color. What is the least amount of colors Clare needs to accomplish this?
|
|||||
Technicolor Dream MapClare has a project in school where she has to design a map of the United States. The only stipulation to the project is that no two adjoining states can be the same color. What is the least amount of colors Clare needs to accomplish this? 3 guesses to Technicolor Dream Map |
|||||
Copyright © 2023 The Riddle Dude - All Rights Reserved Powered by Rodger Bliss |
Warning: Use of undefined constant bfa_comments - assumed 'bfa_comments' (this will throw an Error in a future version of PHP) in /home/customer/www/riddledude.com/public_html/wp-content/themes/atahualpa/comments.php on line 132
4
Four is correct, Boesner.
The answer is only four. The famous Four Color Theorem states that any planar graph can be colored with at most four colors.
For more information, visit: http://en.wikipedia.org/wiki/Four_color_theorem
You’re today’s winner.
How did Boesner figure that out? Good job dude! Here’s another map riddle but its tricky, if you can figure it out let me know: Where Am I Located