When we work with a congruence class, we have to keep two key things in mind. First, we have to know what “n” is in the Zn. This is similar to the base referred to above. When we work with Z3,for example, we are splitting the integers (all of them) into three “classes” by talking about those that are congruent to 0, 1, and 2 (mod 3). If you remember, the integers that are congruent to 0 are -6, -3, 0, 3, 6, 0….. What do you notice about those? Which ones are congruent to 1? What do they have in common? (And so on.)
What you need to notice about these, for now, is that they partition the integers into disjoint subsets. (Do you see that?) The other thing you’ll be doing in Section 2.6 is learning to do simple arithmetic with these congruence classes and even solving some simple “equations.”
This is a really simple one, but if we take [1] + [2] in our example above does it make sense that we end up with [0]? Can you explain why that happens?
Step by stepSolved in 3 steps
- Evaluate the following problems using modular arithmetic. Write your answer as a modulus statement. 1. Evaluate 8 (mode 5) Answer: 2. Evaluate 7 (mode 4) Answer: 3. Evaluate 126 (mode 8) Answer: 4. Evaluate 255 (mode 10) Answer:arrow_forwardConvert the following sequnces between explicit and recursive: a) an=7n-11 b) an=an-1-4;a1=6arrow_forwardSuppose c is any integer. If c mod 15 = 3, what is 10c mod 15? In other words, if division of c by 15 gives a remainder of 3, what is the remainder when 10c is divided by 15? Your solution should show that you obtain the same answer no matter what integer you start with.arrow_forward
- Given a = 7+4i and b = 11+8i, what is the the multiplicative inverse c such that c*a mod b =1arrow_forwardDetermines the equivalent number, according to the indicated module, for the following numbers: a 19 (mod 3) b. 16 (mod 4) c. 267 (mod 15)arrow_forwardIdentify the notation used for each of the following concepts. a.k factorialb. The number of possible permutations of r objects that can be formed from a collection of m objectsc. The number of possible combinations of r objects that can be formed from a collection of m objectsarrow_forward
- Advanced Engineering MathematicsAdvanced MathISBN:9780470458365Author:Erwin KreyszigPublisher:Wiley, John & Sons, IncorporatedNumerical Methods for EngineersAdvanced MathISBN:9780073397924Author:Steven C. Chapra Dr., Raymond P. CanalePublisher:McGraw-Hill EducationIntroductory Mathematics for Engineering Applicat...Advanced MathISBN:9781118141809Author:Nathan KlingbeilPublisher:WILEY
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,