Search Results for ""

The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

A zero function is a function that is almost everywhere zero. The function sometimes known as "the zero function" is the constant function with constant c=0, i.e., f(x)=0 ...

The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...

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.

A function whose range is in the complex numbers is said to be a complex function, or a complex-valued function.

Given n mutually exclusive events A_1, ..., A_n whose probabilities sum to unity, then P(B)=P(B|A_1)P(A_1)+...+P(B|A_n)P(A_n), where B is an arbitrary event, and P(B|A_i) is ...

A function composed of a set of equally spaced jumps of equal length, such as the ceiling function f(x)=[x], floor function f(x)=|_x_|, or nearest integer function f(x)=[x].

A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...