Question #10950033

Computer Science help!?

1) What is 25 mod 7? What is 132 mod 111? What is -12 mod 5? 2) Compute the GCD of 410 and 226 by using the recursive GCD method. 3) What is the modular multiplicative inverse of 7a’ mod 17 = 1? 4) Through Fermat’s Little Theorem, show whether or not that 3591 a prime number.

2013-10-09 02:49:15

TELL US , if you have any answer

There is NEVER a problem, ONLY a challange!

The is a free-to-use knowledgebase.
  The was started on: 02.07.2010.
  It's free to register. Once you are a registered user, you can ask questions, or answer them.
  (Unless registration you can just answer the questions anonymously)
  Only english!!! Questions and answers in other languages will be deleted!!

Cheers: the PixelFighters


C'mon... follow us!

Made by, history, ect.