totient

(redirected from Euler's totient function)
Also found in: Encyclopedia, Wikipedia.

totient

(ˈtəʊʃənt)
n
(Mathematics) a quantity of numbers less than, and sharing no common factors with, a given number
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
References in periodicals archive ?
Rivest-Shamir-Adleman (RSA) encryption algorithm which is based on the combination of prime factorization, Euler's totient function, Euler's totient theorem and Extended Euclidean Algorithm (EEA) is used to compute the private key for decryption process.
For any real number x [greater than or equal to] 1, k is the smallest natural number such that n divides Near Pseudo Smarandache function K(n), [phi](n) denotes the Euler's totient function. Then we have the asymptotic formula