Search Results for ""

The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

A function or transformation f in which f(z) does not overlap z. In modular function theory, a function is called univalent on a subgroup G if it is automorphic under G and ...

The word multiplicity is a general term meaning "the number of values for which a given condition holds." For example, the term is used to refer to the value of the totient ...

A positive value of n for which x-phi(x)=n has no solution, where phi(x) is the totient function. The first few are 10, 26, 34, 50, 52, ... (OEIS A005278).

A positive even value of n for which phi(x)=n, where phi(x) is the totient function, has no solution. The first few are 14, 26, 34, 38, 50, ... (OEIS A005277).

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...

For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.