Question

Verify that(50!)2≡−1 (mod 101).

Verify that(50!)2≡−1 (mod 101).

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

Homework Answers

Answer #1

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
7. a. Verify the following congruences: 105 ≡ 5 (mod 20) 189 ≡ 9 (mod 15)...
7. a. Verify the following congruences: 105 ≡ 5 (mod 20) 189 ≡ 9 (mod 15) b. Verify that ( 105 + 30 ) ≡ ( 5 + 10 ) (mod 20) c. Try to show that in general, if M≡a (mod L) and N≡b (mod L) then M+N≡a+b (mod L)
solve the following set of simultaneous congruence x=1 mod (2) x= 2 mod(3) x =3:mod (5)...
solve the following set of simultaneous congruence x=1 mod (2) x= 2 mod(3) x =3:mod (5) x= 4 mod (11)
Find two values of integerx, such thatx≡1 (mod 5),x≡2 (mod 9) andx≡ −1(mod 11).
Find two values of integerx, such thatx≡1 (mod 5),x≡2 (mod 9) andx≡ −1(mod 11).
For each a ∈Z,   a≠0 (mod 3) then a^2=1 (mod 3)
For each a ∈Z,   a≠0 (mod 3) then a^2=1 (mod 3)
Find - 50 mod 7
Find - 50 mod 7
Solve the system of congruences: x = 1 (mod 3) x = 2 (mod 4) x...
Solve the system of congruences: x = 1 (mod 3) x = 2 (mod 4) x = 2 (mod 5)
Find the smallest positive integer x such that: x mod 2=1 x mod 3=2 and x...
Find the smallest positive integer x such that: x mod 2=1 x mod 3=2 and x mod 5=3 What is the next integer with this property?
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
Solve the linear congruence x = 2 mod (7) x = 1 mod (3)
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...
Say that x^2 = y^2 mod n, but x != y mod n and x !=...
Say that x^2 = y^2 mod n, but x != y mod n and x != −y mod n. Show that 1 = gcd(x − y, n) implies that n divides x + y, and that this is not possible, Show that n is non-trivial
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT