Revision as of 13:05, 27 March 2025 edit Anita5192 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 19,757 edits →Integers modulo m: ? Tag: Manual revert ← Previous edit		Revision as of 09:39, 28 March 2025 edit undo Lik Lam (talk \| contribs) 1 edit mNo edit summary Tag: Reverted Next edit →
Line 96: It is generally easier to work with integers than sets of integers; that is, the representatives most often considered, rather than their residue classes. Consequently, {{math\|(''a'' mod ''m'')}} denotes generally the unique integer {{mvar\|kr}} such that {{math\|0 ≤ ''kr'' < ''m''}} and {{math\|''kr'' ≡ ''a'' (mod ''m'')}}; it is called the '''residue''' of {{math\|''a''}} modulo {{math\|''m''}}. In particular, {{math\|1=(''a'' mod ''m'') = (''b'' mod ''m'')}} is equivalent to {{math\|''a'' ≡ ''b'' (mod ''m'')}}, and this explains why "{{math\|1==}}" is often used instead of "{{math\|≡}}" in this context.

Modular arithmetic: Difference between revisions