You may also like

problem icon


Draw a 'doodle' - a closed intersecting curve drawn without taking pencil from paper. What can you prove about the intersections?

problem icon

Russian Cubes

I want some cubes painted with three blue faces and three red faces. How many different cubes can be painted like that?

problem icon

N000ughty Thoughts

How many noughts are at the end of these giant numbers?

Euler's Officers

Stage: 4 Challenge Level: Challenge Level:1

This has proved to be a Tough Nut. Reading the article on Latin Squares published in September 2002 should help you to solve this.

Taking $s=1$, $2$, $3$ or $4$ you can construct $4$ different Latin squares $S^{i,j}$ of order $5$ where $S^{i,j}=si+j \pmod 5$.

Now suppose the numbers are used to denote the five ranks and consider how many different arrangements there will be if no two officers of the same rank or of the same regiment appear in the same row or in the same column.