Start with any number of counters in any number of piles. 2 players take it in turns to remove any number of counters from a single pile. The loser is the player who takes the last counter.
Choose any 3 digits and make a 6 digit number by repeating the 3
digits in the same order (e.g. 594594). Explain why whatever digits
you choose the number will always be divisible by 7, 11 and 13.
Consider all two digit numbers (10, 11, . . . ,99). In writing down
all these numbers, which digits occur least often, and which occur
most often ? What about three digit numbers, four digit numbers and
so on?
Take any two positive numbers. Calculate the arithmetic and geometric means. Repeat the calculations to generate a sequence of arithmetic means and geometric means. Make a note of what happens to the two sequences.