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 

Advent calendar 2019

Sunday Afternoon Maths LXVII

Coloured weights
Not Roman numerals

Advent calendar 2018

Sunday Afternoon Maths LXVI

Cryptic crossnumber #2

List of all puzzles


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


Show me a random puzzle
▼ show ▼
© Matthew Scroggs 2012–2020