Question

Let a be an inverse of a (mod m) a) Explain what does it mean for...

Let a be an inverse of a (mod m)

a) Explain what does it mean for a to be an inverse of a (mod m) ?

b) Find the inverse of 7(mod19)

c) Solve the linear congruence 7x=3(mod19)

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

further 33=14(mod19) hence solution os x=19 and all oother solutions appear in the form 14+19k , where k is any integer

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
Let p be a prime that is congruent to 3 mod 4. Prove that there is...
Let p be a prime that is congruent to 3 mod 4. Prove that there is no solution to the congruence x2≡−1 modp. (Hint: what would be the order of x?)
Find all solutions to each congruence. (a) 2x − 3 ≡ 2 (mod 7) (b) 3x...
Find all solutions to each congruence. (a) 2x − 3 ≡ 2 (mod 7) (b) 3x + 4 ≡ 1 (mod 5) (c) 3x ≡ 6 (mod 9) (d) 14x ≡ 11 (mod 15)
Find all solutions to the system: 2x ≡ 4 (mod 5) 3x ≡ 5 (mod 7)...
Find all solutions to the system: 2x ≡ 4 (mod 5) 3x ≡ 5 (mod 7) 7x ≡ 2 (mod 13) need help with discrete math HW, please write solutions clearly, and please don't just answer wrong solution, cus then i will need to post the same question twice. i appreciate every help i can get but please let someone else help me solve the question if you're not sure about any part to avoid reposting. thanks, will rate best...
Using the extended Euclidean algorithm, find the multiplicative inverse of a. 135 mod 61 b. 7465...
Using the extended Euclidean algorithm, find the multiplicative inverse of a. 135 mod 61 b. 7465 mod 2464 c. 42828 mod 6407
Let g(x) = 25e^.04x Write the inverse of g and specify its domain. Let f(x) =...
Let g(x) = 25e^.04x Write the inverse of g and specify its domain. Let f(x) = -7x + 12. Compute and simplify the difference quotient given by (f(x+h)-f(x))/h. In triangle ABC side a =10in., side b = 5in., and∠60 degrees . Find the length of side c. (Leave your answer in radical form.) If sin x = -4/7 and x is an angle in Quadrant III, find the value of tan x. Find the value of Arcsin(− 3/2).
(a) Solve x ≡ 11 (mod 12), x ≡ 4 (mod 5), x ≡ 0 (mod...
(a) Solve x ≡ 11 (mod 12), x ≡ 4 (mod 5), x ≡ 0 (mod 7) (b) Find all the solutions of the following system: x ≡ 5 (mod 6), x ≡ 4 (mod 11), x ≡ 3 (mod 17).
Answer the following question: 1. a. Use an affine cipher x 7→ 3x + 1 (mod...
Answer the following question: 1. a. Use an affine cipher x 7→ 3x + 1 (mod 26) to encode “Baltimore”. b. Let a and b be integers. What does it mean to say a divides b? Provide a precise definition and include the proper notation. c. Let a, b, c, and n be integers with n 6= 0. Suppose that a ≡ b (mod n) and b ≡ c (mod n). Prove that a ≡ c (mod n). d. Use...
Let a, b, c, m be integers with m > 0. Prove the following: (a) ”a...
Let a, b, c, m be integers with m > 0. Prove the following: (a) ”a ≡ 0 (mod 2) if and only if a is even” and ”a ≡ 1 (mod 2) if and only if a is odd”. (b) a ≡ b (mod m) if and only if a − b ≡ 0 (mod m) (c) a ≡ b (mod m) if and only if (a mod m) = (b mod m). Recall from Definition 8.10 that (a...
Using Chinese Remainder Theorem solve for X: x = 2 (mod 3) x = 4 (mod...
Using Chinese Remainder Theorem solve for X: x = 2 (mod 3) x = 4 (mod 5) x = 5 (mod 8) I have the answer the professor gave me, but I can`t understand what`s going on. So if you could please go over the answer and explain, it would help a lot. x = 2 (mod 3) x = 3a + 2 3a + 2 = 4 (mod 5) (2) 3a = 2 (2) (mod 5) -----> why number...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT