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 prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...

A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...

The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

A symbol used to distinguish one quantity x^' ("x prime") from another related x. Prime marks are most commonly used to denote 1. Transformed coordinates, 2. Conjugate ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

The unique nonnegative square root of a nonnegative real number. For example, the principal square root of 9 is 3, although both -3 and 3 are square roots of 9. The concept ...

The Q-chromatic polynomial, introduced by Birkhoff and Lewis (1946) and termed the "Q-chromial" by Bari (1974), is an alternate form of the chromatic polynomial pi(x) defined ...