Search Results for ""

For a partial order, the size of the longest antichain is called the width.

Given a sequence {a_k}_(k=1)^n, a partial sum of the first N terms is given by S_N=sum_(k=1)^Na_k.

A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...

An apodization function similar to the Bartlett function.

"God is or He is not...Let us weigh the gain and the loss in choosing...'God is.' If you gain, you gain all, if you lose, you lose nothing. Wager, then, unhesitatingly, that ...

In the plane, if a line intersects one side of a triangle and misses the three vertices, then it must intersect one of the other two sides. This is a special case of the ...

A theorem stated in 1882 which cannot be derived from Euclid's postulates. Given points a, b, c, and d on a line, if it is known that the points are ordered as (a,b,c) and ...

A change in a knot projection such that a pair of oppositely oriented strands are passed through another pair of oppositely oriented strands.

Let gamma be a path given parametrically by sigma(t). Let s denote arc length from the initial point. Then int_gammaf(s)ds = int_a^bf(sigma(t))|sigma^'(t)|dt (1) = ...