Search Results for ""

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

where _2F_1(a,b;c;z) is a hypergeometric function and _3F_2(a,b,c;d,e;z) is a generalized hypergeometric function.

Thâbit ibn Kurrah's rules is a beautiful result of Thâbit ibn Kurrah dating back to the tenth century (Woepcke 1852; Escott 1946; Dickson 2005, pp. 5 and 39; Borho 1972). ...

A number D that possesses no common divisor with a prime number p is either a quadratic residue or nonresidue of p, depending whether D^((p-1)/2) is congruent mod p to +/-1.

n divides a^n-a for all integers a iff n is squarefree and (p-1)|(n-1) for all prime divisors p of n. Carmichael numbers satisfy this criterion.

The name for the set of integers modulo m, denoted Z/mZ. If m is a prime p, then the modulus is a finite field F_p=Z/pZ.

A star polygon-like figure {p/q} for which p and q are not relatively prime. Examples include the hexagram {6/2}, star of Lakshmi {8/2}, and nonagram {9/3}.

If p^k is the highest power of a prime p dividing the order of a finite group G, then a subgroup of G of order p^k is called a Sylow p-subgroup of G.

Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then Sylvester's signature is the ...

For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...