Search Results for ""

Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...

Pick three points P=(x_1,y_1), Q=(x_2,y_2), and R=(x_3,y_3) distributed independently and uniformly in a unit disk K (i.e., in the interior of the unit circle). Then the ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

The distribution function D(x), also called the cumulative distribution function (CDF) or cumulative frequency function, describes the probability that a variate X takes on a ...

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

The Egyptian Mathematical Leather Roll (EMLR), dates to the Middle Kingdom, and was purchased in Egypt in 1858 by Henry Rhind, near the time when the Rhind papyrus was ...

The Eisenstein integers, sometimes also called the Eisenstein-Jacobi integers (Finch 2003, p. 601), are numbers of the form a+bomega, where a and b are normal integers, ...

A function built up of a finite combination of constant functions, field operations (addition, multiplication, division, and root extractions--the elementary operations)--and ...

The elliptic curve factorization method, abbreviated ECM and sometimes also called the Lenstra elliptic curve method, is a factorization algorithm that computes a large ...