From the Tournament of the Towns:
A balance and a set of metal weights are given, with no two the same. If any pair of these weights is placed in the left pan of the balance, then it is always possible to counterbalance them with one or several of the remaining weights placed in the right pan. What is the smallest possible number of weights in the set?
A stunner from the Baltic Way:
A family wears clothes of three colours: red, blue and green, with a separate identical laundry bin for each colour. At the beginning of the first week, all the bins are empty. Each week, the family generates 10kg of laundry (the proportion of each colour might vary week to week). The laundry is sorted by colour and placed in the bins. Next, the heaviest bin (only one if there are several) is emptied and its contents washed.
What is the minimum requirement (in kg) of each bin?
From the Netherlands Junior Maths Olympiad:
There is a kangaroo in the centre of each square of a 5-by-5 grid of squares. Lightning strikes, and each kangaroo simultaneously jumps one square up, down, left or right. What is the greatest possible number of empty squares that could remain?
From the 2003 Tournament of the Towns:
Each term in a sequence of positive integers is obtained from the previous term by adding it to its largest digit. What is the greatest possible number of successive odd terms in such a sequence?
Here I present one of my favourites; a problem of rare invention. From the 1998 Tournament of the Towns:
(Two-person case) Two robbers stole a bag of coins from a merchant. Each coin is worth an integer number of pennies. It is known that if any single coin is removed from the bag, then the remaining coins can be divided fairly among the two robbers (that is, they both get coins with the same total value in pennies).
Prove that after one coin is removed, the number of coins remaining is even.
(General case) A gang of robbers stole a bag of coins from a merchant. Each coin is worth an integer number of pennies. It is known that if any single coin is removed from the bag, then the remaining coins can be divided fairly among the robbers (that is, they all get coins with the same total value in pennies).
Prove that after one coin is removed, the number of coins remaining is divisible by the number of robbers.
It’s here! My new book of puzzles Elastic Numbers is now available on Amazon.
I hope you enjoy solving the problems as much as I enjoyed creating them.
Happy New Year! From the 2004 Georg Mohr Contest:
Find all positive integers n such that a 2n x 2n chessboard can be covered by non-overlapping L-pieces, each covering 4 squares. Rotations and reflections are allowed.