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，众所周知的欧拉函数被定义为正整数，其不超过n和n的n。 ω（n）是n的不同素数数。在本文中，我们使用新的基本方法研究等式φ的解（n s ）= 2 ω（ns）s≥2，并提供所有正整数解决方案。
展开▼
