Prove that the vertices of a planar graph can be coloured in (at most) six different colours such that every pair of vertices joined by an edge are of different colours.
Note: a graph is planar if it can be drawn in the plane with no edges crossing. For example, three houses, each of which is connected to three utilities, is not a planar graph.
You may find it useful to use the Euler characteristic: a planar graph with
Norman painted the plane using two colours: red and yellow. Both colours are used at least once. Show that no matter how Norman does this, there is a red point and a yellow point exactly
Two players are playing a game. The first player is thinking of a finite sequence of positive integers
The letters
Find
Let
Prove that points
Paloma wrote digits from
In the triangles, Paloma started writing either the three digits at the corners added together (the sum), or the three digits at the corners multiplied together (the product). She gave up before finishing the final two triangles.
What numbers could Paloma have written in the interior of the red triangle? Demonstrate that you’ve found all of the possibilities.
Let
Let
Let
How many subsets are there of
For example, when