MathDB
φ(n,m) a new function for every n

Source:

September 1, 2010
functioninequalitiesnumber theoryrelatively primeNumber theoretic functionsIMO ShortlistIMO Longlist

Problem Statement

Let ϕ(n,m),m1\phi(n,m), m \neq 1, be the number of positive integers less than or equal to nn that are coprime with m.m. Clearly, ϕ(m,m)=ϕ(m)\phi(m,m) = \phi(m), where ϕ(m)\phi(m) is Euler’s phi function. Find all integers mm that satisfy the following inequality: ϕ(n,m)nϕ(m)m\frac{\phi(n,m)}{n} \geq \frac{\phi(m)}{m} for every positive integer n.n.