We present an algorithm to invert the Euler function \varphi(m). The algorithm, for a given integer n\ge 1, in polynomial time ``on average'', finds theset \Psi(n) of all solutions m to the equation \varphi(m) =n. In fact, in the worst case the set \Psi(n) is exponentially large and cannot be ... more >>>