Separately, put each of 23, -3, -16, and 140 into your calculator. Then, add or subtract 13 repeatedly until you reach the smallest possible positive result. In each case, what is that number?

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
3 questions
 
Separately, put each of 23, -3, -16, and 140 into your calculator. Then, add or subtract 13 repeatedly until you reach the smallest possible positive result. In each case, what is that number?
 
For a modulus n > 1, consider the relation on Z where two integers x and y are considered
related whenever x y = kn for some integer k, in which case we will write x = y( mod n)
Select all that apply:
This relation is reflexive since every integer is related to itself.
This relation is symmetric since if x is related to y then y is related to x.
This relation is transitive since if x is related to y and y related to z then x is related to z
This relation is an equivalence relation because it is reflexive, symmetric, and transitive.
This relation forms a partition of the integers into n equivalence classes.
Each equivalence class contains related elements, each pair of which differs by a multiple of n
Each class can be represented by one of the possible remainders when dividing an integer by n.
We may perform arithmetic on the classes, similar to how we may perform arithmetic with a clock.
Transcribed Image Text:For a modulus n > 1, consider the relation on Z where two integers x and y are considered related whenever x y = kn for some integer k, in which case we will write x = y( mod n) Select all that apply: This relation is reflexive since every integer is related to itself. This relation is symmetric since if x is related to y then y is related to x. This relation is transitive since if x is related to y and y related to z then x is related to z This relation is an equivalence relation because it is reflexive, symmetric, and transitive. This relation forms a partition of the integers into n equivalence classes. Each equivalence class contains related elements, each pair of which differs by a multiple of n Each class can be represented by one of the possible remainders when dividing an integer by n. We may perform arithmetic on the classes, similar to how we may perform arithmetic with a clock.
Why are the integers 23, -3, -16, and 140 all equivalent modulo 13? Select all that apply.
Each pair of these numbers differs by a multiple of 13.
These numbers all have the same remainder when dividing by 13.
These numbers all belong to the same equivalence class modulo 13.
Each of these numbers reduces modulo 13 to the same number.
Transcribed Image Text:Why are the integers 23, -3, -16, and 140 all equivalent modulo 13? Select all that apply. Each pair of these numbers differs by a multiple of 13. These numbers all have the same remainder when dividing by 13. These numbers all belong to the same equivalence class modulo 13. Each of these numbers reduces modulo 13 to the same number.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,