CEMC Hypatia, 2011

Number theory Difficulty 2.0 Junior Prove it Canada

A set $S$ consists of all two-digit numbers such that:
- no number contains a digit of 0 or 9, and
- no number is a multiple of 11.
(a) Determine how many numbers in $S$ have a 3 as their tens digit.
(b) Determine how many numbers in $S$ have an 8 as their ones digit.
(c) Determine how many numbers are in $S$ .
(d) Determine the sum of all the numbers in $S$ .

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

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: CEMC, University of Waterloo, licensed CC-BY-NC-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.