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?*

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?*

It’s here! My new book of puzzles Elastic Numbers is now available on Amazon.

https://www.amazon.co.uk/Elastic-Numbers-Puzzles-Serious-Problem/dp/0995782601

https://www.amazon.com/gp/aw/d/0995782601

I hope you enjoy solving the problems as much as I enjoyed creating them.

My new book of maths puzzles is on its way! It’s packed full of interesting problems to sink your teeth into. I’ll post an update as the launch approaches.

In the meantime, here is a fantastic problem from the USA:

*It is given that is a 604-digit number beginning with a 1. How many of the numbers begin with a 4?*

From the 2000 University of Waterloo Cayley Contest:

*The leftmost digit of an integer of length 2000 digits is 3. In this integer, any two consecutive digits must be divisible by 17 or 23. The 2000th digit may be either ‘a’ or ‘b’. What is the value of a+b?*

A PuzzleCritic Original:

*Let x be the answer to this problem, where x is a positive integer, and let y be the sum of its digits. Calculate 2x-2y.*

From the 2014 American Invitational Maths Examination:

*The repeating decimals 0.ababab… and 0.abcabc… satisfy*

*0.ababab… + 0.abcabc… = 33/37.*

*Find the digits a, b and c.*

Here I present my first entry into the Vault, a collection of puzzles so well crafted, they provide the standard by which all other problems should be measured.

From the 1992 Tournament of the Towns:

*Let n be a positive integer. Prove that there is a multiple of n, the sum of whose digits is odd.*