Maths Olympiad Prep

Library / /35 of 71

Number theory Difficulty 5.1 AIME, harder Prove it United States

Problem:
Prove that for every integer nn greater than 11,
σ(n)ϕ(n)n21 \sigma(n) \phi(n) \leq n^{2}-1
When does equality hold?

Solution

Solution:
Note that
σ(mn)ϕ(mn)=σ(m)ϕ(m)σ(n)ϕ(n)(m21)(n21)=(mn)2(m2+n21)<(mn)21 \sigma(m n) \phi(m n) = \sigma(m) \phi(m) \sigma(n) \phi(n) \leq (m^{2}-1)(n^{2}-1) = (m n)^{2} - (m^{2} + n^{2} - 1) < (m n)^{2} - 1
for any pair of relatively prime positive integers (m,n)(m, n) other than (1,1)(1,1). Now, for pp a prime and kk a positive integer, σ(pk)=1+p++pk=pk+11p1\sigma\left(p^{k}\right) = 1 + p + \cdots + p^{k} = \frac{p^{k+1}-1}{p-1} and ϕ(pk)=pk1ppk=(p1)pk1\phi\left(p^{k}\right) = p^{k} - \frac{1}{p} \cdot p^{k} = (p-1) p^{k-1}. Thus,
σ(pk)ϕ(pk)=pk+11p1(p1)pk1=(pk+11)pk1=p2kpk1p2k1 \sigma\left(p^{k}\right) \phi\left(p^{k}\right) = \frac{p^{k+1}-1}{p-1} \cdot (p-1) p^{k-1} = (p^{k+1}-1) p^{k-1} = p^{2k} - p^{k-1} \leq p^{2k} - 1
with equality where k=1k=1. It follows that equality holds in the given inequality if and only if nn is prime.

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.