Maths Olympiad Prep

Library / /1166 of 1394

, 2015

Number theory Difficulty 5.7 AIME, harder Prove it United States

Problem:
Let SS be the set of positive integers nn such that the inequality
ϕ(n)τ(n)n33 \phi(n) \cdot \tau(n) \geq \sqrt{\frac{n^{3}}{3}}
holds, where ϕ(n)\phi(n) is the number of positive integers knk \leq n that are relatively prime to nn, and τ(n)\tau(n) is the number of positive divisors of nn. Prove that SS is finite.

Solution

Solution:
Let SS be the set of all positive integers nn such that
ϕ(n)τ(n)n33 \phi(n) \cdot \tau(n) \geq \sqrt{\frac{n^{3}}{3}}
Define a function Φ\Phi on all positive integers nn by
Φ(n)=ϕ(n)2τ(n)2n3 \Phi(n)=\frac{\phi(n)^{2} \cdot \tau(n)^{2}}{n^{3}}
An important observation is that Φ\Phi has the property that for every relatively prime positive integers m,nm, n, we have Φ(mn)=Φ(m)Φ(n)\Phi(m n)=\Phi(m) \Phi(n).
Define another function ψ\psi on all ordered pairs (a,p)(a, p) of positive integer aa and prime number pp as follows:
ψ(a,p):=(a+1)2(11/p)2pa \psi(a, p):=\frac{(a+1)^{2}(1-1 / p)^{2}}{p^{a}}
If we express nn in its canonical form as n=i=1kpiain=\prod_{i=1}^{k} p_{i}^{a_{i}}, then we have
Φ(n)=i=1kψ(ai,pi) \Phi(n)=\prod_{i=1}^{k} \psi\left(a_{i}, p_{i}\right)
Therefore, SS is actually the set of all n=i=1kpiain=\prod_{i=1}^{k} p_{i}^{a_{i}} such that
i=1kψ(ai,pi)13 \prod_{i=1}^{k} \psi\left(a_{i}, p_{i}\right) \geq \frac{1}{3}
It is straightforward to establish the following: for every prime pp and positive integer aa,
- if p11p \geq 11, then ψ(a,p)<13\psi(a, p)<\frac{1}{3};
- if p=5p=5 and a2a \geq 2, then ψ(a,p)<13\psi(a, p)<\frac{1}{3};
- if p=3p=3 and a3a \geq 3, then ψ(a,p)<13\psi(a, p)<\frac{1}{3};
- if p=2p=2 and a5a \geq 5, then ψ(a,p)<13\psi(a, p)<\frac{1}{3};
- ψ(a,p)\psi(a, p) is always less than 13\frac{1}{\sqrt{3}} unless (a,p)=(1,3)(a, p)=(1,3) where ψ(1,3)=1627\psi(1,3)=\frac{16}{27}.
The data above shows that in the case n=pan=p^{a}, in which there is only one prime dividing nn, there are at most 8 possible nn in SS: 21,22,23,24,31,32,51,712^{1}, 2^{2}, 2^{3}, 2^{4}, 3^{1}, 3^{2}, 5^{1}, 7^{1}. If nn is divisible by at least two distinct primes,
then one of them must be 313^{1} and 313^{1} fully divides nn (that is, 32n3^{2} \nmid n). In the latter case n=3n0n=3 \cdot n_{0}. Write n0=j=1lqjbjn_{0}=\prod_{j=1}^{l} q_{j}^{b_{j}}. In order for Φ(n)13\Phi(n) \geq \frac{1}{3}, we require
j=1lψ(bj,qj)916 \prod_{j=1}^{l} \psi\left(b_{j}, q_{j}\right) \geq \frac{9}{16}
This is only possible when (b,q)=(2,2)(b, q)=(2,2), where n=12n=12. Also, note that when n=1,Φ(1)=1n=1, \Phi(1)=1, so 1S1 \in S. Hence, there are at most 10 (a finite number of) possible values of nn in SS.

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.