Search Results for ""

An l_x table is a tabulation of numbers which is used to calculate life expectancies. x n_x d_x l_x q_x L_x T_x e_x 0 1000 200 1.00 0.20 0.90 2.70 2.70 1 800 100 0.80 0.12 ...

The Lorenz attractor is an attractor that arises in a simplified system of equations describing the two-dimensional flow of fluid of uniform depth H, with an imposed ...

Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...

There are six Painlevé transcendents, corresponding to second-order ordinary differential equations whose only movable singularities are ordinary poles and which cannot be ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...

There are four varieties of Airy functions: Ai(z), Bi(z), Gi(z), and Hi(z). Of these, Ai(z) and Bi(z) are by far the most common, with Gi(z) and Hi(z) being encountered much ...