Department of Mathematics
University College Dublin

UCD Openday 2005
Mathematics Problem

Fill out the entry form.

You must follow the rules.





Cube and Square
a problem about
colouring without repetition
  1. A square Q is composed of nine 1cm x 1cm x1cm coloured blocks (see sketch, Q1 )and has
    • 3 distinct colours in each of its 3 rows,
    • 3 distinct colours in each of its 3 columns
    • and 3 distinct colours on each of its 2 diagonals
    Find the least possible number of distinct colours needed to construct such a square.
  2. A cube K is composed of twenty seven 1cm x 1cm x 1cm coloured blocks (see sketch Q2)
    • in such a way that each of the 9 squares found in K (see sketch) are as in (1)
    • and with 3 distinct colours in each of its four superdiagonals (see sketch).
    Find the least possible number of distinct colours needed to construct such a cube.
Page maintained by
jbquig@ucd.ie

Revised 15 Mar 2005.