Modular Arithmetic Addition and Subtraction Modulus 9 0 mod 9 = 0 - PowerPoint PPT Presentation

Mar 19, 2024 •127 likes •212 views

Modular Arithmetic Addition and Subtraction Modulus 9 0 mod 9 = 0 9 mod 9 = 0 1 mod 9 = 1 10 mod 9 = 1 0 2 mod 9 = 2 11 mod 9 = 2 8 1 3 mod 9 = 3 12 mod 9 = 3 7 2 4 mod 9 = 4 13 mod 9 = 4 5 mod 9 = 5 14 mod 9 = 5 6 3 6 mod 9 =

Modular Arithmetic Addition and Subtraction
Modulus 9 0 mod 9 = 0 9 mod 9 = 0 1 mod 9 = 1 10 mod 9 = 1 0 2 mod 9 = 2 11 mod 9 = 2 8 1 3 mod 9 = 3 12 mod 9 = 3 7 2 4 mod 9 = 4 13 mod 9 = 4 5 mod 9 = 5 14 mod 9 = 5 6 3 6 mod 9 = 6 15 mod 9 = 6 5 4 7 mod 9 = 7 16 mod 9 = 7 8 mod 9 = 8 17 mod 9 = 8
Modulus 9 18 mod 9 = 0 27 mod 9 = 0 19 mod 9 = 1 28 mod 9 = 1 0 20 mod 9 = 2 29 mod 9 = 2 8 1 21 mod 9 = 3 30 mod 9 = 3 7 2 22 mod 9 = 4 31 mod 9 = 4 23 mod 9 = 5 32 mod 9 = 5 6 3 24 mod 9 = 6 33 mod 9 = 6 5 4 25 mod 9 = 7 34 mod 9 = 7 26 mod 9 = 8 35 mod 9 = 8
Modulus 9 -9 mod 9 = 0 -8 mod 9 = 1 0 -7 mod 9 = 2 8 1 -6 mod 9 = 3 7 2 -5 mod 9 = 4 -4 mod 9 = 5 6 3 -3 mod 9 = 6 5 4 -2 mod 9 = 7 -1 mod 9 = 8
Modulus 9 (0 + 1) mod 9 = 1 0 (1 + 5) mod 9 = 6 8 1 (8 + 3) mod 9 = 11 mod 9 = 2 7 2 (15 + 13) mod 9 = 28 mod 9 = 1 6 3 = 15 mod 9 + 13 mod 9 5 4 = (6 + 4) mod 9 = 10 mod 9 = 1
Modulus 9 0 (7 - 2) mod 9 = 5 8 1 (16 - 5) mod 9 = 11 mod 9 = 2 7 2 = 16 mod 9 - 5 mod 9 = (7 - 5) mod 9 = 2 6 3 5 4
Modulus 4 0 mod 4 = 0 1 mod 4 = 1 0 2 mod 4 = 2 3 mod 4 = 3 3 1 4 mod 4 = 0 5 mod 4 = 1 2 12 mod 4 = 0 13 mod 4 = 1
Modulus 6 0 mod 6 = 0 1 mod 6 = 1 0 2 mod 6 = 2 5 1 3 mod 6 = 3 4 mod 6 = 4 5 mod 6 = 5 4 2 6 mod 6 = 0 3 7 mod 6 = 1 8 mod 6 = 2

Recommend

Modular Arithmetic Modular Arithmetic: refresher. Notation x ( mod m ) or mod ( x , m ) -

Modular Arithmetic Modular Arithmetic: refresher. Notation x ( mod m ) or mod ( x , m ) - remainder of x divided by m in { 0 ,..., m 1 } . x is congruent to y modulo m or x y ( mod m ) if and only if ( x y ) is divisible by m .

397 views • 5 slides

Modular Arithmetic Inverses. Euclids Algorithm Modular Arithmetic: refresher. x is congruent

Modular Arithmetic Inverses. Euclids Algorithm Modular Arithmetic: refresher. x is congruent to y modulo m or x y ( mod m ) if and only if ( x y ) is divisible by m . ...or x and y have the same remainder w.r.t. m . ...or x = y

580 views • 29 slides

Lecture 14. Outline. Modular Arithmetic Fact and Secrets There exists a polynomial... Modular

Lecture 14. Outline. Modular Arithmetic Fact and Secrets There exists a polynomial... Modular Arithmetic Fact: Exactly 1 degree d polynomial with arithmetic modulo prime p contains d + 1 pts. Modular Arithmetic Fact: There is exactly 1

168 views • 4 slides

Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic:

Lecture 8. Outline. 1. Modular Arithmetic. Clock Math!!! 2. Inverses for Modular Arithmetic: Greatest Common Divisor. 3. Euclids GCD Algorithm Clock Math If it is 1:00 now. What time is it in 5 hours? 6:00! What time is it in 15 hours?

321 views • 11 slides

Lecture 7. Outline. 1. Isoperimetric inequality for hypercube. 2. Modular Arithmetic. Clock

Lecture 7. Outline. 1. Isoperimetric inequality for hypercube. 2. Modular Arithmetic. Clock Math!!! 3. Inverses for Modular Arithmetic: Greatest Common Divisor. Division!!! 4. Euclids GCD Algorithm. A little tricky here! 1 / 36

556 views • 30 slides

15-251 Great Theoretical Ideas in Computer Science Lecture 21: Modular Arithmetic November 8th,

15-251 Great Theoretical Ideas in Computer Science Lecture 21: Modular Arithmetic November 8th, 2016 Next 3 lectures Modular arithmetic + Group theory (a more abstract and general framework) + Cryptography (in particular,

1.03k views • 85 slides

Today. Summary: polynomials. Farewell (for now) to modular arithmetic... Set of d + 1 points

Today. Summary: polynomials. Farewell (for now) to modular arithmetic... Set of d + 1 points determines degree d polynomial. Modular arithmetic modulo a prime. Encode secret using degree k 1 polynomial: Add, subtract, commutative,

431 views • 7 slides

Number Theory A bit more depth. . . modular arithmetic primes Euclids algorithm

1 Number Theory A bit more depth. . . modular arithmetic primes Euclids algorithm Chinese remainder theorem Eulers totient function Eulers theorem 2 Modular Arithmetic m; n integers, n > 0

2.23k views • 15 slides

Midterm 2 Review. Midterm format Modular Arithmetic Inverses and GCD Midterm Topics: Notes 6-14.

Midterm 2 Review. Midterm format Modular Arithmetic Inverses and GCD Midterm Topics: Notes 6-14. Modular Arithmetic. Inverses. GCD/Extended-GCD. x has inverse modulo m if and only if gcd ( x , m ) = 1 . Time: 120 minutes Proof Idea:

282 views • 5 slides

Integer Representation Representation of integers: unsigned and signed Modular arithmetic and

Wellesley CS 240 Integer Representation Representation of integers: unsigned and signed Modular arithmetic and overflow Sign extension Shifting and arithmetic Multiplication Casting 1 Fixed-width integer encodings Unsigned non-negative

475 views • 24 slides

Objectives Congruences: Modular Arithmetic Euler Totient Function Fermats Little

Introduction to Number Theory Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives Congruences: Modular Arithmetic Euler Totient

666 views • 15 slides

Section 4: Lab 1 Tips, Modular Arithmetic, & CBC-MAC CSE 484 / CSE M 584 Administrivia

Section 4: Lab 1 Tips, Modular Arithmetic, & CBC-MAC CSE 484 / CSE M 584 Administrivia Final deadline for Lab 1 is next Office hours are available Friday @ 11:59pm ! w e N Run the md5sum command on Friday (12:30-2:30pm)

512 views • 25 slides

Lecture 21: Midterm 2 Review. Modular Arithmetic Inverses and GCD Example: p = 7, q = 11.

Lecture 21: Midterm 2 Review. Modular Arithmetic Inverses and GCD Example: p = 7, q = 11. Professor Walrand. x has inverse modulo m if and only if gcd ( x , m ) = 1 . N = 77 . Wrapping up his lectures for other course this week. ( p 1 )( q

208 views • 5 slides

PRIME, MODULAR ARITHMETIC, AND By: Tessa Xie & Meiyi Shi OBJECTIVES Examine Primes In

PRIME, MODULAR ARITHMETIC, AND By: Tessa Xie & Meiyi Shi OBJECTIVES Examine Primes In Term Of Additive Properties & Modular Arithmetic To Prove There Are Infinitely Many Primes To Prove There Are Infinitely Many Primes of

331 views • 10 slides

Numb3rs 11 2 10 3 Lecture 5 9 4 Modular Arithmetic 8 5 7 6 Story So Far Quotient and

0 12 1 Numb3rs 11 2 10 3 Lecture 5 9 4 Modular Arithmetic 8 5 7 6 Story So Far Quotient and Remainder GCD Euclid s algorithm to compute gcd(a,b) L(a,b) { au + bv | u,v Z } = { n gcd(a,b) | n Z } Primes

449 views • 22 slides

Modular Arithmetic (Almost remainder, except for 12 and 0 are equivalent.) What time is it in 5

Modular Arithmetic (Almost remainder, except for 12 and 0 are equivalent.) What time is it in 5 hours? 6:00! What time is it in 15 hours? 16:00! Actually 4:00. 16 is the same as 4 with respect to a 12 hour clock system. CS70 Summer 2016

81 views • 5 slides

Modular Arithmetic Cunsheng Ding HKUST, Hong Kong February 14, 2017 Cunsheng Ding (HKUST, Hong

Modular Arithmetic Cunsheng Ding HKUST, Hong Kong February 14, 2017 Cunsheng Ding (HKUST, Hong Kong) Modular Arithmetic February 14, 2017 1 / 23 Contents The Floor and Ceiling Function 1 Greatest Common Divisor 2 Euclidean Algorithm 3

367 views • 23 slides

B11.1 Divisibility Can we equally share n muffins among m persons without cutting a muffin?

Discrete Mathematics in Computer Science October 28, 2020 B11. Divisibility & Modular Arithmetic Discrete Mathematics in Computer Science B11. Divisibility & Modular Arithmetic B11.1 Divisibility Malte Helmert, Gabriele R oger

307 views • 6 slides

Using Modular Arithmetic to Reliably Encode Authentication Information Within Messages Consisting

Using Modular Arithmetic to Reliably Encode Authentication Information Within Messages Consisting of Port Connection Sequences Patrick F. Wilbur - wilburpf@clarkson.edu Department of Mathematics & Computer Science, Clarkson University

229 views • 9 slides

cse 311: foundations of computing Spring 2015 Lecture 10: Functions, Modular arithmetic [this

cse 311: foundations of computing Spring 2015 Lecture 10: Functions, Modular arithmetic [this special lecture was given by a 5-year-old] a little recap So far: - Propositional logic - Logic to build circuits - Predicates and quantifiers -

597 views • 22 slides

Numb3rs 11 2 10 3 Modular Arithmetic 9 4 8 5 7 6 Congruence For a modulus m and

0 12 1 Numb3rs 11 2 10 3 Modular Arithmetic 9 4 8 5 7 6 Congruence For a modulus m and two integers a and b, we say a b (mod m) if m|(a-b) Typically, we shall consider modulus > 0 a b (mod 0) a=b a b (mod 1)

342 views • 13 slides

The Algebra and Arithmetic of Vector-Valued Modular Forms on 0 (2) Richard Gottesman

The Algebra and Arithmetic of Vector-Valued Modular Forms on 0 (2) Richard Gottesman richard.b.gottesman@gmail.com Queens University October 7, 2018 Thanks to the conference organizers for creating such a fantastic conference! Notation

746 views • 25 slides

cse 311: foundations of computing Spring 2015 Lecture 11: Modular arithmetic and applications

cse 311: foundations of computing Spring 2015 Lecture 11: Modular arithmetic and applications arithmetic mod 7 0 6 1 a + 7 b = (a + b) mod 7 2 5 a 7 b = (a b) mod 7 3 4 + 0 1 2 3 4 5 6 0 1 2 3 4 5 6 X 0 0 1 2

390 views • 27 slides

T-79.159 Cryptography and Data Security Lecture 6: Modular Arithmetic Kaufman et al: Ch 7

T-79.159 Cryptography and Data Security Lecture 6: Modular Arithmetic Kaufman et al: Ch 7 -Prime numbers Stallings: Ch 8 -Euclids algorithm -Chinese remainder theorem -Eulers totient function -Eulers theorem 1 Prime Numbers

730 views • 6 slides