Scribd
Upload
78 views7 pages

Topic 3 - Modular Arithmetic

Modular arithmetic is a method of counting that involves dividing a number by another number and considering only the remainder. It has important applications in mathematics and computer science. Some key properties are: 1) when dividing a number by n, the remainder is written as a mod n, 2) numbers that have the same remainder when divided by n are equivalent modulo n, and 3) numbers can be added or multiplied modulo n by adding or multiplying only their remainders.

Uploaded by

Domz Sensei
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
78 views7 pages

Topic 3 - Modular Arithmetic

Modular arithmetic is a method of counting that involves dividing a number by another number and considering only the remainder. It has important applications in mathematics and computer science. Some key properties are: 1) when dividing a number by n, the remainder is written as a mod n, 2) numbers that have the same remainder when divided by n are equivalent modulo n, and 3) numbers can be added or multiplied modulo n by adding or multiplying only their remainders.

Uploaded by

Domz Sensei
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
You are on page 1/ 7

Abstract Algebra

MODULAR ARITHMETIC
FUNCTIONS
MODULAR
ARITHMETIC
QUESTION:
If it is now September,
what month will it be 25
months from now?
QUESTION:
if it is now Wednesday,
you know that in 23 days it
will be?
What is modular arithmetic?
Modular arithmetic is an
abstraction of a method of
counting that you often use.
Surprisingly, this simple idea
has numerous important
applications in mathematics
and computer science.
What is modular arithmetic?
When a=qn+r, where 3 mod 2 = 1 since 3= 1∙2+1
q is the quotient and r 6 mod 2=0 since 6=3∙2+0,
is the remainder upon 11 mod 3=2 since 11=3∙3+2,
dividing a by n, we 62 mod 85=62 since 62=0∙85+62,
write a mod n = r. -2 mod 15 = 13 since -2 =(-1)15+13
What is modular arithmetic?
In general, if a and b Example:
are integers and n is a (27∙36) mod 11
positive integer, then a
mod n = b mod n if and
only if n divides a-b.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy