Library / /34 of 60

, 2016

Number theory Difficulty 6.0 National Olympiad Prove it United Kingdom

A positive integer is called charming if it is equal to $2$ or is of the form $3^i 5^j$ where $i$ and $j$ are non-negative integers. Prove that every positive integer can be written as a sum of different charming integers.

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

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