Search Results for ""

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...

The radius rho of the midsphere of a polyhedron, also called the interradius. Let P be a point on the original polyhedron and P^' the corresponding point P on the dual. Then ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

The Mills ratio is defined as m(x) = 1/(h(x)) (1) = (S(x))/(P(x)) (2) = (1-D(x))/(P(x)), (3) where h(x) is the hazard function, S(x) is the survival function, P(x) is the ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

The mode of a set of observations is the most commonly occurring value. For example, for a data set (3, 7, 3, 9, 9, 3, 5, 1, 8, 5) (left histogram), the unique mode is 3. ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...