Search Results for ""

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...

The word polyhedron has slightly different meanings in geometry and algebraic geometry. In geometry, a polyhedron is simply a three-dimensional solid which consists of a ...

A prime constellation, also called a prime k-tuple, prime k-tuplet, or prime cluster, is a sequence of k consecutive numbers such that the difference between the first and ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...

If there is an integer 0<x<p such that x^2=q (mod p), (1) i.e., the congruence (1) has a solution, then q is said to be a quadratic residue (mod p). Note that the trivial ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

The sinc function sinc(x), also called the "sampling function," is a function that arises frequently in signal processing and the theory of Fourier transforms. The full name ...