Category:Examples of Residues (Number Theory)

From ProofWiki
Jump to navigation Jump to search

This category contains examples of Residue (Number Theory).

Let $m, n \in \N$ be natural numbers.

Let $a \in \Z$ be an integer such that $a$ is not divisible by $m$.

Then $a$ is a residue of $m$ of order $n$ if and only if:

$\exists x \in \Z: x^n \equiv a \pmod m$

where $\equiv$ denotes modulo congruence.

Pages in category "Examples of Residues (Number Theory)"

This category contains only the following page.