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


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


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