Show me a random puzzle
 Most recent collections 


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


Show me a random puzzle
▼ show ▼


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

© Matthew Scroggs 2019