For any given integer number n≥1 , the well-known Euler function is defined as the positive integer number which is no more than n and coprime with n. ω(n) is all the different prime factor numbers of n. In this paper, we use the new elementary methods to study the solutions of the equation ϕ(ns)=2ω(ns) s≥2, and give its all positive integer solutions.
展开▼
机译：对于任何给定的整数n≥1，众所周知的Euler函数定义为不大于n且与n互质的正整数。 ω（n）是n的所有不同素数。在本文中，我们使用新的基本方法研究方程ϕ（n s ）= 2 ω（ns）s≥2的解，并将其全部给出正整数解。
展开▼
