Search Results for ""

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

Also known as araneidan, this curve owes its name to its spider-like shape. It is given by the polar equation r=a(sin(ntheta))/(sin[(n-1)theta]), where a>0 and n>2 is an ...

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 ...

The partial differential equation u_t+u_x+uu_x-u_(xxt)=0 (Benjamin et al. 1972; Arvin and Goldstein 1985; Zwillinger 1997, p. 130). A generalized version is given by u_t-del ...

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...

A financial measure of a fund's sensitivity to market movements which measures the relationship between a fund's excess return over Treasury Bills and the excess return of a ...

Let the nth composition of a function f(x) be denoted f^((n))(x), such that f^((0))(x)=x and f^((1))(x)=f(x). Denote the composition of f and g by f degreesg(x)=f(g(x)), and ...

Let alpha(z),gamma(z):(a,b)->R^3 be curves such that |gamma|=1 and alpha·gamma=0, and suppose that alpha and gamma have holomorphic extensions alpha,gamma:(a,b)×(c,d)->C^3 ...

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...