Search Results for ""

Specifying two sides and the angle between them uniquely (up to geometric congruence) determines a triangle. Let c be the base length and h be the height. Then the area is ...

The Schwarzian derivative is defined by D_(Schwarzian)=(f^(''')(x))/(f^'(x))-3/2[(f^('')(x))/(f^'(x))]^2. The Feigenbaum constant is universal for one-dimensional maps if its ...

The second Morley cubic is the triangle cubic with trilinear equation It passes through Kimberling centers X_n for n=1, 1134, 1135, 1136, and 1137.

A set partition of a set S is a collection of disjoint subsets of S whose union is S. The number of partitions of the set {k}_(k=1)^n is called a Bell number.

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

A curve is simple if it does not cross itself.

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

An algorithm for computing an Egyptian fraction.

Consider (1) If the probability distribution is governed by a Markov process, then P_3(y_1,t_1;y_2,t_2|y_3,t_3) = P_2(y_2,t_2|y_3,t_3) (2) = P_2(y_2|y_3,t_3-t_2). (3) ...