Category:Modulo Division

From ProofWiki
Jump to navigation Jump to search

This category contains results about Modulo Division.
Definitions specific to this category can be found in Definitions/Modulo Division.

Let $m \in \Z$ be an integer.

Let $\Z_m$ be the set of integers modulo $m$:

$\Z_m = \set {0, 1, \ldots, m - 1}$

The operation of division modulo $m$ is defined on $\Z_m$ as:

$a \div_m b$ equals the integer $q \in \Z_m$ such that $b \times_m q \equiv a \pmod m$

and is possible only if $q$ is unique modulo $m$.

This happens if and only if $a$ and $m$ are coprime.

Subcategories

This category has the following 3 subcategories, out of 3 total.

Pages in category "Modulo Division"

This category contains only the following page.