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

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

The prime number theorem shows that the nth prime number p_n has the asymptotic value p_n∼nlnn (1) as n->infty (Havil 2003, p. 182). Rosser's theorem makes this a rigorous ...

Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...