Search Results for ""

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

The mathematical study of knots. Knot theory considers questions such as the following: 1. Given a tangled loop of string, is it really knotted or can it, with enough ...

The function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...

If f is a schlicht function and D(z_0,r) is the open disk of radius r centered at z_0, then f(D(0,1)) superset= D(0,1/4), where superset= denotes a (not necessarily proper) ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

An integral transform which is often written as an ordinary Laplace transform involving the delta function. The Laplace transform and Dirichlet series are special cases of ...

The term "left factorial" is sometimes used to refer to the subfactorial !n, the first few values for n=1, 2, ... are 1, 3, 9, 33, 153, 873, 5913, ... (OEIS A007489). ...