Welcome guest
You're not logged in.
265 users online, thereof 0 logged in

Proposition: Congruence Classes

Let $m> 0$ be a positive integer. The relation $”\equiv”$ of being congruent modulo $m$ is an equivalence relation $\equiv\subset\mathbb Z\times \mathbb Z,$ defined on the set of all integers $\mathbb Z.$ In particular, every element of the quotient set $[a]\in\mathbb Z_m$, written $a(m)$, is called the congruence class modulo $m$.

| | | | | created: 2019-04-10 21:08:18 | modified: 2019-04-11 07:34:24 | by: bookofproofs | references: [1272], [8152]

1.Proof: (related to "Congruence Classes")

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:


Bibliography (further reading)

[8152] Jones G., Jones M.: “Elementary Number Theory (Undergraduate Series)”, Springer, 1998

[1272] Landau, Edmund: “Vorlesungen ├╝ber Zahlentheorie, Aus der Elementaren Zahlentheorie”, S. Hirzel, Leipzig, 1927

FeedsAcknowledgmentsTerms of UsePrivacy PolicyImprint
© 2018 Powered by BooOfProofs, All rights reserved.