From the people behind the Alan Turing Cryptography Competition.
The Puzzles
1 of 15 points available,
until 29 Mar, 3:59 pm
1 of 15 points available,
until 29 Mar, 3:59 pm
1 of 15 points available,
until 29 Mar, 3:59 pm
1 of 15 points available,
until 29 Mar, 3:59 pm
1 of 15 points available,
until 29 Mar, 3:59 pm
1 of 15 points available,
until 29 Mar, 3:59 pm
3 of 15 points available,
until 23 Mar, 4:41 pm
3 of 15 points available,
until 23 Mar, 4:46 pm
Due: Fri 29 Mar, 4 pm
Countdown clock:

# Puzzle 3

Dom and Mina really like playing dominoes. They have some unusual sets of dominoes, including one particularly rare set comprising dominoes with numbers, ranging from 1 to 100, rather than spots. There is exactly one domino of each possible configuration, that is, for every pair of distinct whole numbers $$m$$ and $$n$$ between 1 and 100 there is a domino with $$m$$ on one side and $$n$$ on the other. There are no dominoes with the same number on each side. For example, the domino 2-5 is the same as 5-2, and there is just one of these. There are no blanks.

Dom and Mina arrange the dominoes into the longest possible single line of dominoes (as is usual with dominoes, the top of one domino is allowed to touch the bottom of another domino only if the numbers on the top of the first domino and the bottom of the second domino are the same). How many dominoes are left over?