Algebra 5 Congruence Classes.

Slides:



Advertisements
Similar presentations
Equivalence Relations
Advertisements

1 Lect. 12: Number Theory. Contents Prime and Relative Prime Numbers Modular Arithmetic Fermat’s and Euler’s Theorem Extended Euclid’s Algorithm.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
(CSC 102) Lecture 12 Discrete Structures. Previous Lecture Summary Floor and Ceiling Functions Definition of Proof Methods of Proof Direct Proof Disproving.
Congruence class arithmetic. Definitions: a ≡ b mod m iff a mod m = b mod m. a  [b] iff a ≡ b mod m.
Complexity1 Pratt’s Theorem Proved. Complexity2 Introduction So far, we’ve reduced proving PRIMES  NP to proving a number theory claim. This is our next.
Congruence of Integers
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
Week 8 - Wednesday.  What did we talk about last time?  Cardinality  Countability  Relations.
BY MISS FARAH ADIBAH ADNAN IMK
The Integers and Division
Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.
Prep Math Competition, Lec. 1Peter Burkhardt1 Number Theory Lecture 1 Divisibility and Modular Arithmetic (Congruences)
Complex Zeros; Fundamental Theorem of Algebra
Lecture 2 Basic Number Theory and Algebra. In modern cryptographic systems,the messages are represented by numerical values prior to being encrypted and.
Section 4.3 Zeros of Polynomials. Approximate the Zeros.
Chapter 2. A lattice point is a point in R d with integer coordinates. Later we will talk about general lattice point.
1 Section Congruences In short, a congruence relation is an equivalence relation on the carrier of an algebra such that the operations of the algebra.
Chinese Remainder Theorem. How many people What is x? Divided into 4s: remainder 3 x ≡ 3 (mod 4) Divided into 5s: remainder 4 x ≡ 4 (mod 5) Chinese Remainder.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
2/17/ : Verifying Angle Relationships 1 Expectation: You will write proofs in “If, then…” form.
The theory of partitions. n = n 1 + n 2 + … + n i 7 = =
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications (5 th Edition) Kenneth H. Rosen Chapter 7 Relations.
160 as a product of its prime factors is 2 5 x 5 Use this information to show that 160 has 12 factors.
Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.
Divisibility and Modular Arithmetic
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 2 The Fundamentals: Algorithms,
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
EVEN NUMBERS EVEN NUMBERS 1 = prime 2 = prime1 3 = prime 4 = 2 x 22 5 = prime 6 = 2 x 33 7 = prime 8 = 2 x 2 x 24 9 = 3 x 3 10 = 2 x 55.
The Relation Induced by a Partition
CMPS 2433 – Coding Theory Chapter 3
Discrete Math II Howon Kim
4-2 Triangle Congruence by SSS and SAS
Garis-garis Besar Perkuliahan
College Algebra Chapter 3 Polynomial and Rational Functions
We remember that the square root of a product can be written as the product of the square roots of its factors. √(3  2) = √3√2.
Congruence class arithmetic
Reflexivity, Symmetry, and Transitivity
Great Theoretical Ideas In Computer Science
Finding Real Roots of Polynomial Equations
7.5 Zeros of Polynomial Functions
The Rational Zero Theorem
Analytic Number Theory MTH 435
Applied Discrete Mathematics Week 4: Number Theory
Discrete Math for CS CMPSC 360 LECTURE 4 Last time and recitations:
5.6 Proving Triangle Congruence by ASA & AAS
The Fundamental Theorem of Algebra
Topic 6: Number Theory Basics
Foundations of Discrete Mathematics
Modular Arithmetic and Change of Base
Discrete Math (2) Haiming Chen Associate Professor, PhD
The Rational Zero Theorem
The sum of any two even integers is even.
The Fundamental Theorem of Algebra And Zeros of Polynomials
The Rational Zero Theorem
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Congruence and Triangles
5.2 ASA Triangle Congruence
Section 10.3 Modular Arithmetic
Chapter 11: Further Topics in Algebra
Kim Correll Holly Bochsler
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Goal: The learner will use properties of special pairs of angles.
Triangle Congruency Theorems (shortcuts)
Clements MAΘ October 30th, 2014
Congruent Triangles Section 4.2.
Number Theory.
Lecture 3 Strings and Things (Section 1.1)
Lecture 2-3 Basic Number Theory and Algebra
Section 9.3 Modular Arithmetic.
Presentation transcript:

Algebra 5 Congruence Classes

Congruence classes Congruence modulo m is an equivalence relation on ℤ. Thus the equivalence classes [𝑎] 𝑚 form a partition of ℤ. [𝑎] 𝑚 is called the congruence class of a: 𝑎+(multiple of 𝑚)

Proposition 1 For 𝑎, 𝑎’ in ℤ, 𝑎≡ 𝑎 ′ (𝑚𝑜𝑑 𝑚) if and only if [𝑎] 𝑚 = [𝑎′] 𝑚

Proposition 2 Suppose [𝑎] 𝑚 and [𝑏] 𝑚 are two congruence classes and 𝑐’ in ℤ, is in both [𝑎] 𝑚 and [𝑎] 𝑚 . Then [𝑎] 𝑚 = [𝑏] 𝑚 .

ℤ/𝑚ℤ ℤ/𝑚ℤ= [0] 𝑚 , [1] 𝑚 , … [𝑚−1] 𝑚 .

Complete Sets of Representatives A complete set of representatives for ℤ/𝒎ℤ is a set of integers { 𝑟 1 ,… 𝑟 𝑚 } so that every integer is congruent modulo 𝑚 to exactly one of the numbers in the set. Thus {0, 1, 2,…𝑚−1} is a complete set of representatives for ℤ/𝑚ℤ .

Theorem 3 Primitive Root Theorem Let 𝑝 be a prime number. There exists some integer b so that {0,𝑏, 𝑏 2 , 𝑏 3 ,…, 𝑏 𝑝−1 } is a complete set of representatives for ℤ/𝑚ℤ .