Draw a regular polygon. Connect all its vertices to every other vertex. For example, if you picked a pentagon or a hexagon, the result would look as follows:
Colour the regions of your shape so that no two regions which share an edge are the same colour. (Regions which only meet at one point can be the same colour.)
What is the least number of colours which this can be done with?

Show answer & extension


Show me a random puzzle
 Most recent collections 

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

Sunday Afternoon Maths LXV

Cryptic crossnumber #1
Breaking Chocolate
Square and cube endings

List of all puzzles


star numbers dodecagons balancing sums crosswords prime numbers geometry coins proportion factors routes sum to infinity dates christmas probabilty volume time integers probability angles triangle numbers games area dice ellipses square roots multiplication 2d shapes cryptic crossnumbers chocolate means scales speed mean averages unit fractions squares surds sequences symmetry addition factorials coordinates perimeter sport crossnumbers integration wordplay functions ave remainders advent shapes graphs cards clocks quadratics taxicab geometry grids menace people maths doubling circles parabolas differentiation bases complex numbers money rectangles square numbers numbers cryptic clues planes irreducible numbers folding tube maps percentages number floors pascal's triangle chess multiples division rugby algebra chalkdust crossnumber logic colouring arrows regular shapes polygons calculus lines 3d shapes odd numbers perfect numbers palindromes trigonometry cube numbers triangles spheres fractions books partitions shape digits hexagons indices


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2019