PrimePower

Computes the reduced totient value for a prime-power factor p^r. The reduction is applied when the base is 2 and the exponent is 3 or greater. In such cases, the result is half of Euler's Totient function value for p^r.

Computes Euler's Totient function for the prime-power factor p^r. The result is the count of integers less than p^r that are coprime to it.

An iterator over the names of all the elements of this product.

An iterator over all the elements of this product.