Library / /88 of 99

, 2019

Number theory Difficulty 3.0 AMC 10/12 Prove it United Kingdom

An integer is said to be chunky if it consists only of non-zero digits by which it is divisible when written in base 10. For example, the number $936$ is Chunky since it is divisible by $9$ , $3$ and $6$ . How many chunky integers are there between $13$ and $113$ ?

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.