Problem

Source: Iran MO Third Round N1

Tags: number theory



For a natural number $n$, $f(n)$ is defined as the number of positive integers less than $n$ which are neither coprime to $n$ nor a divisor of it. Prove that for each positive integer $k$ there exist only finitely many $n$ satisfying $f(n) = k$.