Number theory

Number theory

Industry: Mathematics

Add a new term

Contributors in Number theory

Become a Contributors

Number theory

Euler pseudoprime test

Mathematics; Number theory

A more effective pseudoprime test than the simpler Fermat test. A number N is called an Euler pseudoprime to base b if b ( N -1)/2 =( b / N ) (mod N ). (Here ( b / N ) is the Jacobi symbol.) ...

Fermat's little theorem

Mathematics; Number theory

If p is prime and b p then b ( p -1) =1(mod p ). Rephrased, this says that the order of b in the group of integers modulo p divides ( p -1).

Fermat pseudoprime test

Mathematics; Number theory

The simplest (and least effective) pseudoprime test. A number N is called an Fermat pseudoprime to base b if b ( N -1) =1(mod N ). A Fermat pseudoprime is more commonly just called a ...

Galois fields

Mathematics; Number theory

A Galois field is a field with finite number of elements. Galois fields take one of two forms: Z p - The integers modulo some prime p . F p ^ n - The polynomials with coefficients ...

Gaussian integers

Mathematics; Number theory

The ring of Gaussian integers is the extension of the integers with a symbol i which is the root of the equation x 2 =-1. Thus this ring consists of elements of the form ( n + m * i ) with the ...