Number theoryDifficulty 5.7AIME, harderProve itUnited States
Problem: Let S be the set of positive integers n such that the inequality ϕ(n)⋅τ(n)≥3n3 holds, where ϕ(n) is the number of positive integers k≤n that are relatively prime to n, and τ(n) is the number of positive divisors of n. Prove that S is finite.
Solution
Solution: Let S be the set of all positive integers n such that ϕ(n)⋅τ(n)≥3n3 Define a function Φ on all positive integers n by Φ(n)=n3ϕ(n)2⋅τ(n)2 An important observation is that Φ has the property that for every relatively prime positive integers m,n, we have Φ(mn)=Φ(m)Φ(n). Define another function ψ on all ordered pairs (a,p) of positive integer a and prime number p as follows: ψ(a,p):=pa(a+1)2(1−1/p)2 If we express n in its canonical form as n=∏i=1kpiai, then we have Φ(n)=i=1∏kψ(ai,pi) Therefore, S is actually the set of all n=∏i=1kpiai such that i=1∏kψ(ai,pi)≥31 It is straightforward to establish the following: for every prime p and positive integer a, - if p≥11, then ψ(a,p)<31; - if p=5 and a≥2, then ψ(a,p)<31; - if p=3 and a≥3, then ψ(a,p)<31; - if p=2 and a≥5, then ψ(a,p)<31; - ψ(a,p) is always less than 31 unless (a,p)=(1,3) where ψ(1,3)=2716. The data above shows that in the case n=pa, in which there is only one prime dividing n, there are at most 8 possible n in S: 21,22,23,24,31,32,51,71. If n is divisible by at least two distinct primes, then one of them must be 31 and 31 fully divides n (that is, 32∤n). In the latter case n=3⋅n0. Write n0=∏j=1lqjbj. In order for Φ(n)≥31, we require j=1∏lψ(bj,qj)≥169 This is only possible when (b,q)=(2,2), where n=12. Also, note that when n=1,Φ(1)=1, so 1∈S. Hence, there are at most 10 (a finite number of) possible values of n in S.
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.