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


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


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