Maths Olympiad Prep

Library / /17 of 151

, 2015

Number theory Difficulty 6.0 National Olympiad Prove it Hungary

Show that for every positive real number c>0c>0 there is a positive integer nn such that φ(σ(n))>cn\varphi\big(\sigma(n)\big)>cn. (For an arbitrary postive integer kk, φ(k)\varphi(k) denotes the number of positive integers not exceeding kk that are co-prime with kk. σ(k)\sigma(k) is the sum of positive divisors of kk.)
Proposed by: Barnabás Szabó, Budapest
(5 pont)

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.