Search Results for ""

The cotangent function cotz is the function defined by cotz = 1/(tanz) (1) = (i(e^(iz)+e^(-iz)))/(e^(iz)-e^(-iz)) (2) = (i(e^(2iz)+1))/(e^(2iz)-1), (3) where tanz is the ...

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

A transformation in which the coordinate system is changed, leaving vectors in the original coordinate system "fixed" while changing their representation in the new ...

A transformation in which vectors are transformed in a fixed coordinate system. In contrast, a transformation in which the coordinate system is changed, leaving vectors in ...

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.

Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...

f(x)=1-2x^2 for x in [-1,1]. Fixed points occur at x=-1, 1/2, and order 2 fixed points at x=(1+/-sqrt(5))/4. The natural invariant of the map is rho(y)=1/(pisqrt(1-y^2)).

The binomial distribution gives the discrete probability distribution P_p(n|N) of obtaining exactly n successes out of N Bernoulli trials (where the result of each Bernoulli ...

A helix, sometimes also called a coil, is a curve for which the tangent makes a constant angle with a fixed line. The shortest path between two points on a cylinder (one not ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...