Search Results for ""

A point at which two noncrossing branches of a curve meet with different tangents.

A formula is called satisfiable if it takes at least one true value in some interpretation.

Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...

In the American system, 10^(54).

To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

The p-adic norm satisfies |x+y|_p<=max(|x|_p,|y|_p) for all x and y.

An alternative spelling of the name "Chebyshev."

A technique is a specific method of performing an operation. The terms algorithm, method, and procedure are also used interchangeably.

One of the 14 4-polyaboloes.