Search Results for ""

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

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 projective module generalizes the concept of the free module. A module M over a nonzero unit ring R is projective iff it is a direct summand of a free module, i.e., of some ...

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

A Proth number that is prime, i.e., a number of the form N=k·2^n+1 for odd k, n a positive integer, and 2^n>k. Factors of Fermat numbers are of this form as long as they ...

If there is no integer 0<x<p such that x^2=q (mod p), i.e., if the congruence (35) has no solution, then q is said to be a quadratic nonresidue (mod p). If the congruence ...

A primality test that provides an efficient probabilistic algorithm for determining if a given number is prime. It is based on the properties of strong pseudoprimes. The ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

An extended rooted binary tree satisfying the following conditions: 1. Every node has two children, each colored either red or black. 2. Every tree leaf node is colored ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...