4383_Notes_4o2_Zn

4383_Notes_4o2_Zn - Math 4383 Section 4.2 Extra Page 1 of 5...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Math 4383 Section 4.2 Extra Page 1 of 5 Number Theory Chapter 4 Section 4.2 Extra Information on Congruence Any set of n integers that are incongruent modulo n is called a complete set of residues mod n. The standard set is the set of numbers 0,1,2,, n-1. For every integer k, define the congruence class of k mod n by ( 29 [ ] { : mod } k x x k n = Remember that congruence is an equivalence relation which means that [k] = [x] if and only if ( 29 mod k x n THE SETS ARE THE SAME!!!! If we look at all the congruence classes mod n for all the integers, there are only n distinct sets. These can be represented as the congruence classes of 0, 1, 2, 3, , n-1 Consider the SET where each element is a distinct congruence class mod n. For each distinct set, we use the integer k between 0 and n-1 which is contained in the set as the representative member Call this set Z n { } [0],[1],[2],...,[ 1] n n =- Operations corresponding the addition and multiplication are defined by...
View Full Document

Page1 / 5

4383_Notes_4o2_Zn - Math 4383 Section 4.2 Extra Page 1 of 5...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online