Search Results for ""

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

Given a random variable X with continuous and strictly monotonic probability density function f(X), a quantile function Q_f assigns to each probability p attained by f the ...

A function f(x) is said to be antiperiodic with antiperiod p if -f(x)=f(x+np) for n=1, 3, .... For example, the sine function sinx is antiperiodic with period pi (as well as ...

The interesting function defined by the definite integral G(x)=int_0^xsin(tsint)dt, illustrated above (Glasser 1990). The integral cannot be done in closed form, but has a ...

An integer n is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...

Any real function u(x,y) with continuous second partial derivatives which satisfies Laplace's equation, del ^2u(x,y)=0, (1) is called a harmonic function. Harmonic functions ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...

A completely multiplicative function, sometimes known as linear or totally multiplicative function, is an arithmetic function f(n) such that f(mn)=f(m)f(n) holds for each ...

The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...

A symmetric function on n variables x_1, ..., x_n is a function that is unchanged by any permutation of its variables. In most contexts, the term "symmetric function" refers ...