The Euler’s Totient Function and the General Group Theory

Abstract

Euler’s totient function is useful in many ways. It is used in the encryption systems (such as the RSA), which is used for security purposes. The function deals with the prime number theory, and it is useful in the calculation of large calculations also. In this paper, efforts are intensified to calculate the number of distinct cyclic subgroups for a class of finite p-groups.