Search Results for ""

If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...

As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...

The process used to generate an expression for a covariant in the first degree of any one of the equivalent sets of coefficients for a curve.

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

A point which is a member of the set closure of a given set S and the set closure of its complement set. If A is a subset of R^n, then a point x in R^n is a boundary point of ...

The cardinal number of any set is lower than the cardinal number of the set of all its subsets. A corollary is that there is no highest aleph (aleph).

The radial curve of the catenary x = t (1) y = cosht (2) with radiant point (x_0,y_0) is given by x_r = x_0-coshtsinht (3) y_r = y_0+cosht. (4)

The cokernel of a group homomorphism f:A-->B of Abelian groups (modules, or abstract vector spaces) is the quotient group (quotient module or quotient space, respectively) ...

A generalization of Poncelet's continuity principle made by H. Schubert in 1874-1879. The conservation of number principle asserts that the number of solutions of any ...

A continuum is a decomposable continuum if and only if it is the union of two of its proper subcontinua. A continuum that is not decomposable is an indecomposable continuum.