totient


Also found in: Dictionary, Wikipedia.

totient

[′tō·shənt]
(mathematics)
Mentioned in ?
References in periodicals archive ?
We could perhaps then remove the totient pair (1, N - 1) as it does not form a Goldbach sum, but this is unimportant.
Thus the order of K is [phi](d), where [phi] denotes Eulers totient function.
If N [greater than or equal to] 1 the Euler totient function [phi](N) is the number of positive integers not exceeding N, which are relatively prime to N.
For the axial groups a n-fold symmetry axis first becomes possible with translational symmetry if the dimensionality equals the totient of n, which is the number of positive integers less than or equal to n which are relatively prime (no common factors) to n (21).
Compute [phi](n) = [phi](p)[phi](q) = (p - 1)(q - 1) = n - (p + q - 1), where [phi] is Euler's totient function.
Meanwhile, we denote by [PHI](N) Euler's totient function.
In determining the asymptotic behaviour of the number of 3iet factors, we shall strongly use asymptotic properties of the Euler totient function,
Above, [mu] is the Mobius (see [9, 1]) function and V> the Euler totient function.
Roskam, On an arithmetical function related to Euler's totient and the discriminantor, Fib.
e = 3) which satisfies gcd(e, [PHI](n)) = 1 and computes d satisfying de = 1 mod [phi](n) where [phi](n) is the Euler Totient function, h(*) is a coalition-resistant hash function (e.
Compute [phi](n) = [phi](p)[phi](q) = (p - 1)(q - 1) = n - (p + q -1), where [phi] is Euler's totient function.
where [phi] is Euler's totient function, that is, [phi](n) is the number of positive integers smaller that n and coprime with n.