Search Results for ""

Let f be analytic on the unit disk, and assume that 1. |f(z)|<=1 for all z and 2. f(0)=0. Then |f(z)|<=|z| and |f^'(0)|<=1. If either |f(z)|=|z| for some z!=0 or if ...

Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...

The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...

A square matrix A is a special orthogonal matrix if AA^(T)=I, (1) where I is the identity matrix, and the determinant satisfies detA=1. (2) The first condition means that A ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...

The "ternary" Champernowne constant can be defined by concatenating the ternary representations of the integers C_3 = 0.(1)(2)(1,0)(1,1)(1,2)(2,0)..._3 (1) = ...

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

Let B, A, and e be square matrices with e small, and define B=A(I+e), (1) where I is the identity matrix. Then the inverse of B is approximately B^(-1)=(I-e)A^(-1). (2) This ...

An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.

The geometric mean is smaller than the arithmetic mean, (product_(i=1)^Nn_i)^(1/N)<=(sum_(i=1)^(N)n_i)/N, with equality in the cases (1) N=1 or (2) n_i=n_j for all i,j.