0% found this document useful (0 votes)
19 views2 pages

Potwb 15 GS 08 P

This document presents two problems involving coloring maps with the minimum number of colors such that no adjacent regions have the same color. The first problem asks how many colors are needed to color the provinces and territories of Canada, where regions are not considered adjacent if separated by water. The second problem asks the same question for a map of European countries, and hints that one should start coloring the smallest countries first.

Uploaded by

scribd-in-action
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views2 pages

Potwb 15 GS 08 P

This document presents two problems involving coloring maps with the minimum number of colors such that no adjacent regions have the same color. The first problem asks how many colors are needed to color the provinces and territories of Canada, where regions are not considered adjacent if separated by water. The second problem asks the same question for a map of European countries, and hints that one should start coloring the smallest countries first.

Uploaded by

scribd-in-action
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

WWW.C E M C .U WAT E R LO O.

C A | T h e C E N T R E fo r E D U C AT I O N i n M AT H E M AT I C S a n d CO M P U T I N G

Problem of the Week


Problem B
Colour Me Happy!
a) Below is a map of Canada and its provinces and territories. What is the
fewest number of colours required to colour each province and territory so
that no two adjacent (side-by-side) regions are the same colour?

Regions that meet only at a corner could be the same colour. You may
assume that regions separated by a body of water are not adjacent.
b) Now consider a map of Europe. What is the fewest number of colours
needed so that no two adjacent countries are the same colour?
Hint: Start with the smallest countries (i.e., San Marino, Vatican City,
Liechtenstein, Luxembourg).

WWW.C E M C .U WAT E R LO O.C A | T h e C E N T R E fo r E D U C AT I O N i n M AT H E M AT I C S a n d CO M P U T I N G

Strand

Geometry and Spatial Sense

You might also like