Search Results for ""

The first definition of the logarithm was constructed by Napier and popularized through his posthumous pamphlet (Napier 1619). It this pamphlet, Napier sought to reduce the ...

T-integration, which stands for "tunable numerical integration," is a fast, accurate, and numerically stable numerical integration formula given by ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

The identity element of an additive monoid or group or of any other algebraic structure (e.g., ring, module, abstract vector space, algebra) equipped with an addition. It is ...

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 ...

A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE ...

A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...

The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...