Scribd
Upload
88 views7 pages

Modular Arithmetic Basics and Applications

Modular arithmetic is a system where numbers reset to zero upon reaching the modulus. It uses notation like "a ≡ b (mod n)" to indicate that a and b have the same remainder when divided by n. Two numbers are congruent modulo n if their difference is a multiple of n. Solving equations in modular arithmetic involves setting two sides equal and finding the missing number that satisfies the congruence. Multiplication in modular arithmetic is done by simply multiplying the numbers and taking the result modulo n. Modular arithmetic has applications in areas like clocks, cryptography, music, number theory, and computer science.

Uploaded by

charman518
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
88 views7 pages

Modular Arithmetic Basics and Applications

Modular arithmetic is a system where numbers reset to zero upon reaching the modulus. It uses notation like "a ≡ b (mod n)" to indicate that a and b have the same remainder when divided by n. Two numbers are congruent modulo n if their difference is a multiple of n. Solving equations in modular arithmetic involves setting two sides equal and finding the missing number that satisfies the congruence. Multiplication in modular arithmetic is done by simply multiplying the numbers and taking the result modulo n. Modular arithmetic has applications in areas like clocks, cryptography, music, number theory, and computer science.

Uploaded by

charman518
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

MODULAR

ARITHMETIC
BY: CHARLIE UCHNO
INTRODUCTION

• Modular arithmetic is a system of arithmetic for integers.


• In modular arithmetic, numbers reset at zero upon reaching the modulus.
• Represented by “mod” or “%”

• In (mod 3)…
NOTATION

• To signify that numbers are in a specific modulus, the notation ‘a ≡ b (mod n)’ is used
• This is equivalent to writing ‘a mod n ≡ b mod n’

• Similarly, (a mod n) (b mod n) ≡ ab (mod n)


CONGRUENCE

• In modular, two numbers a and b are congruent in a specific modulus n if a – b is a


multiple of n.
• Expressed… a ≡ b (mod n)

• 2 ≡ 5(mod 3)
• 2 is congruent to 5 in mod 3

• 3 ≠ 6(mod 2)
• 3 is not congruent to 6 in mod 2
SOLVING FOR MISSING NUMBERS

• Remember, a – b = n * ℤ • Two numbers can be congruent in many


• Exm. 4 ≡ ? (mod 7) moduli…

• 4 ≡ b (mod 7) • Exm. 5 ≡ 13 (mod n)


• 4–b=7*ℤ • 5 – 13 = n * ℤ
• 4–b=7*0=0 • -8 = n * ℤ
• b=4 • So n can equal 1, 2, 4, or 8
• So… 4 ≡ 4 (mod 7)
MULTIPLICATION

• Just multiply the numbers…


• Exm. 5 * 3 ≡ ? (mod 4)
• 15 ≡ b (mod 4)
• 15 – b = 4 * ℤ
• 15 – b = 4 * 3 = 12
• b=3
• So… 5 * 3 ≡ 3 (mod 4)
APPLICATIONS

• Analog clocks (mod 12)


• Cryptography, moduli are used as keys in decryption
• Music, in the twelve-tone equal temperament system, notes in different octaves are
congruent in mod 12
• Number theory
• Computer science

You might also like