Académique Documents
Professionnel Documents
Culture Documents
PUZZLE- 1
Hello! I am Arpita.
I am in a big
trouble. Could you
help me?
THE HOUSE
Observation
We can see that it is not possible to
do so in 1 colour. Using 1 colur made
every room in the same colour which
does not satisfy the condition given.
Now we will have to try with 2
colours.
observation
We can see that even by using 2
colours rooms like hall- corridor,
bedroom- corridor, verandah- hall,
etc. are of same colour which does
not satisfy our condition.
Now we will have to try with 3
colours.
observation
We can see that even after using 3
colours, rooms like verandahcorridor and verandah- washroom
are of same colour which does not
satisfy our condition.
Now we have to add another colour
to see if it works.
observation
We can see that using 4 colours,
there are no rooms left with same
colour and arpita can now use only 4
colours to paint the house.
PUZZLE- 2
OK! STUDENTS,
YOUR TODAYS H.W.
IS AS FOLLOWS.
h. w. given by teacher
The following drawings must be
coloured such that no 2 adjacent
areas must have same colour.
Amits method
Amit thinks that 3 colours are
enough to solve the question. He was
able to do the first part but was stuck
in the second.
Teachers method
It is not necessary that every figure
will require only 3 colours. The 4
colour theorem states that, given any
separation of a plane intocontiguous
regions, producing a figure called
amap, no more than four colours are
required to colour the regions of the
map so that no two adjacent regions
have the same colour.
PUZZLE- 3
World map
First week
Second week
Third week
Fourth week
is it really true
Is this theorem really discovered by
us, or is already discovered?
If already discovered, who discovered
it? How did he proved it?
PUZZLE- 4
mars
Divide into 196 parts each belonging to a country and
colour them to the colour of the country they belong to.
Remember the rule also. How many colours are required
now.
Observation.
Since the figure is a graph, the four
colour theorem will apply here. Using
atlas each country has been given an
area from the figure seen earlier. Still
only four colours were required. This
proves that whatever the no. of
partitions or area be, four colour
theorem will apply for every graph
irrespective of size.
Thank You