Given integers a and b, this function on the quantity a to the n plus b to the n is divisible by
Given integers a and b, this function on the quantity a to the n plus b to the n is divisible by n. The values of this function are given by the Mobius transform on the sequence of positive integers. For all n greater than 1, the splitting field of the polynomial [x to the n] minus 1 equals this function of n. This function on n can be calculated as the product of n and the quantity 1 minus p for all primes p which divide n. For any integer a relatively prime to n, a to the power of this function of n is equivalent to 1 mod n by a corollary of Lagrange's theorem. For a prime number p, this function is equal to p minus 1, since p has no divisors except 1 and itself. For 10 points, name this function on an integer n representing the number of integers less than and relatively prime to n.
Given integers a and b, this function on the quantity a to the n plus b to the n is divisible by
Euler totient function [accept Euler phi function]