CEMC Fryer, 2003

Combinatorics Difficulty 2.0 Junior Prove it Canada

Determine the power-sum of the set $\{1, 10, 100, 1000, 10\,000, 100\,000, 1\,000\,000\}$ .

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.