Search Results for ""

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

A very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their "order." The most common ...

Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...

A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...

A polynomial discriminant is the product of the squares of the differences of the polynomial roots r_i. The discriminant of a polynomial is defined only up to constant ...

If P be a point in the plane of an equilateral triangle DeltaABC, then the lengths of line segments AP, BP, and CP correspond the sides of a triangle, which is degenerate ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...