For any given positive integer n ≥ 1, the Euler function φ（n） is defined to be the number of positive integers not exceeding n, which is relatively prime to n. o：（n） is defined to be the number of different pri...For any given positive integer n ≥ 1, the Euler function φ（n） is defined to be the number of positive integers not exceeding n, which is relatively prime to n. o：（n） is defined to be the number of different prime divisors of n. In order to know the solvability of the function of φ（φ（φ（n））） = 2^ω（n）, properties of the number theoretical function φ（φ（n）） is studied in the paper.展开更多
基金the National Natural Science Foundation of China(10671056)
文摘For any given positive integer n ≥ 1, the Euler function φ（n） is defined to be the number of positive integers not exceeding n, which is relatively prime to n. o：（n） is defined to be the number of different prime divisors of n. In order to know the solvability of the function of φ（φ（φ（n））） = 2^ω（n）, properties of the number theoretical function φ（φ（n）） is studied in the paper.
