5. If a-l is the inverse of a modulo m and b-1 the inverse of b modulo m, show that a--1 is the inverse of ab modulo m. ot be on odd

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
Topic Video
Question
Can you do #5
Julo
we see that
10. Write a computer program that determines if an element a is invertible mod-
to the congruence 3x = 7 (mod 17) is x = 8 (mod 17). Then the
7. If m is composite, what is the value (m – 1)! mod m in the standard residue
6.3-1.17 = 1, so the inverse of 3 modulo 17 is 6. Hence the solution
119/7= 17. Applying the extended Euclidean Algorithm.
solutions to 21x = 49 (mod 119) are 8, 25, 42, 59, 76, 93, and 110
Exercises for Section 3.2
1. Determine the invertible elements modulo 15, 17, and 32.
2. Determine the inverse of 67 modulo 119.
3. Determine all solutions to the congruences 7x = 5 (mod 13) and 4r =6
(mod 18).
4. Solve the following linear congruences.
(a) 11x = 28 (mod 37).
(b) 42x = 90 (mod 156).
J 5. If a-l is the inverse of a modulo m and b-1 the inverse of b modulo m,
show that a- is the inverse of ab modulo m.
6. Let p be an odd prime.
(a) What are the possible values of x mod p so that x is its own inverse
modulo p?
(b) Consider the product 1 · 2 . . (p – 1) = (p – 1)! (mod p). Show
pairing the elements with their inverses that (p – 1)! = -1 (mod P.
This result is known as Wilson's Theorem. (Does this match wiui
your conjecture in Exercise 3.1.23?)
system? Conclude that (m – 1)! = -1 (mod m) implies that m is pin
8. Use Exercise 6 to answer the following questions:
(a) Determine 65! mod 67.
(b) If p is a prime number, what is (p – 2)! mod p?
9. Show that if p = 4k + 1 is prime, then [(2k)!]² :
= -1 (mod p).
ulo m, and if it is, the program computes the inverse.
11. Write a computer program to solve linear congruences modulo t.
Transcribed Image Text:Julo we see that 10. Write a computer program that determines if an element a is invertible mod- to the congruence 3x = 7 (mod 17) is x = 8 (mod 17). Then the 7. If m is composite, what is the value (m – 1)! mod m in the standard residue 6.3-1.17 = 1, so the inverse of 3 modulo 17 is 6. Hence the solution 119/7= 17. Applying the extended Euclidean Algorithm. solutions to 21x = 49 (mod 119) are 8, 25, 42, 59, 76, 93, and 110 Exercises for Section 3.2 1. Determine the invertible elements modulo 15, 17, and 32. 2. Determine the inverse of 67 modulo 119. 3. Determine all solutions to the congruences 7x = 5 (mod 13) and 4r =6 (mod 18). 4. Solve the following linear congruences. (a) 11x = 28 (mod 37). (b) 42x = 90 (mod 156). J 5. If a-l is the inverse of a modulo m and b-1 the inverse of b modulo m, show that a- is the inverse of ab modulo m. 6. Let p be an odd prime. (a) What are the possible values of x mod p so that x is its own inverse modulo p? (b) Consider the product 1 · 2 . . (p – 1) = (p – 1)! (mod p). Show pairing the elements with their inverses that (p – 1)! = -1 (mod P. This result is known as Wilson's Theorem. (Does this match wiui your conjecture in Exercise 3.1.23?) system? Conclude that (m – 1)! = -1 (mod m) implies that m is pin 8. Use Exercise 6 to answer the following questions: (a) Determine 65! mod 67. (b) If p is a prime number, what is (p – 2)! mod p? 9. Show that if p = 4k + 1 is prime, then [(2k)!]² : = -1 (mod p). ulo m, and if it is, the program computes the inverse. 11. Write a computer program to solve linear congruences modulo t.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Discrete Probability Distributions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
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,