17 relations: Coprime integers, Disquisitiones Arithmeticae, Euler–Jacobi pseudoprime, Fermat's little theorem, Finite field, Integer, Lagrange's theorem (number theory), Legendre symbol, Leonhard Euler, Modular arithmetic, Number theory, Oxford University Press, Parity (mathematics), Prime number, Quadratic reciprocity, Quadratic residue, Springer Science+Business Media.

## Coprime integers

In number theory, two integers and are said to be relatively prime, mutually prime, or coprime (also written co-prime) if the only positive integer (factor) that divides both of them is 1.

New!!: Euler's criterion and Coprime integers · See more »

## Disquisitiones Arithmeticae

The Disquisitiones Arithmeticae (Latin for "Arithmetical Investigations") is a textbook of number theory written in Latin by Carl Friedrich Gauss in 1798 when Gauss was 21 and first published in 1801 when he was 24.

New!!: Euler's criterion and Disquisitiones Arithmeticae · See more »

## Euler–Jacobi pseudoprime

In number theory, an odd integer n is called an Euler–Jacobi probable prime (or, more commonly, an Euler probable prime) to base a, if a and n are coprime, and where \left(\frac\right) is the Jacobi symbol.

New!!: Euler's criterion and Euler–Jacobi pseudoprime · See more »

## Fermat's little theorem

Fermat's little theorem states that if is a prime number, then for any integer, the number is an integer multiple of.

New!!: Euler's criterion and Fermat's little theorem · See more »

## Finite field

In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements.

New!!: Euler's criterion and Finite field · See more »

## Integer

An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

New!!: Euler's criterion and Integer · See more »

## Lagrange's theorem (number theory)

In number theory, Lagrange's theorem is a statement named after Joseph-Louis Lagrange about how frequently a polynomial over the integers may evaluate to a multiple of a fixed prime.

New!!: Euler's criterion and Lagrange's theorem (number theory) · See more »

## Legendre symbol

No description.

New!!: Euler's criterion and Legendre symbol · See more »

## Leonhard Euler

Leonhard Euler (Swiss Standard German:; German Standard German:; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, logician and engineer, who made important and influential discoveries in many branches of mathematics, such as infinitesimal calculus and graph theory, while also making pioneering contributions to several branches such as topology and analytic number theory.

New!!: Euler's criterion and Leonhard Euler · See more »

## Modular arithmetic

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" upon reaching a certain value—the modulus (plural moduli).

New!!: Euler's criterion and Modular arithmetic · See more »

## Number theory

Number theory, or in older usage arithmetic, is a branch of pure mathematics devoted primarily to the study of the integers.

New!!: Euler's criterion and Number theory · See more »

## Oxford University Press

Oxford University Press (OUP) is the largest university press in the world, and the second oldest after Cambridge University Press.

New!!: Euler's criterion and Oxford University Press · See more »

## Parity (mathematics)

In mathematics, parity is the property of an integer's inclusion in one of two categories: even or odd.

New!!: Euler's criterion and Parity (mathematics) · See more »

## Prime number

A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.

New!!: Euler's criterion and Prime number · See more »

## Quadratic reciprocity

In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers.

New!!: Euler's criterion and Quadratic reciprocity · See more »

## Quadratic residue

In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract mathematical concept from the branch of number theory known as modular arithmetic, quadratic residues are now used in applications ranging from acoustical engineering to cryptography and the factoring of large numbers.

New!!: Euler's criterion and Quadratic residue · See more »

## Springer Science+Business Media

Springer Science+Business Media or Springer, part of Springer Nature since 2015, is a global publishing company that publishes books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing.

New!!: Euler's criterion and Springer Science+Business Media · See more »

## Redirects here:

Euler criterion, Euler quadratic residue theorem, Euler's Criterion, Euler's quadratic residue theorem.