Library / /75 of 151

, 2019

Number theory Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

Let $c>0$ be a real number, and suppose that for every positive integer $n$ , at least one percent of the numbers $1^c,2^c,3^c,\ldots,n^c$ are integers. Prove that $c$ is an integer.

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: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.