Math

posted by .

How do I solve for negative modular arithmetic?

Here is an example: -45 mod 13 = 7, but how?

  • Math -

    a mod b = (a + nb) mod b

    so, -45 mod 13 = mod (-45 + 52) mod 13 = 7 mod 13 = 7

    Just add a big enough multiple of the modulus so you have a positive number.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. Math

    I am to find all possible values of a and b where a, b are positive integers and to show that I have found all of them.For example: "2^3 = 3^1 + 5" is a satisfied equation where(a, b) are (3,1). I know that it can be solved using modular …
  2. Geometry and Discrete Mathematics (Proofs)

    Observe that the last two digits of 7^2 are 49, the last two digits of 7^3 are 43, the last two digits of 7^4 are 01, and the last two digits of 7^5 are 07. Prove that the last two digits of 7^201 are 07. 7^2 = ...49 7^3 = ...43 7^4 …
  3. math

    Perform the modular arithmetic operation 6.9 ( mod 5)
  4. math

    Which two is true as i'm confused A) 3+7 ß 10 mod 15 17 + 9 ß 4 mod 21 12 + 14 ß 0 mod 26 B) 4+11 ß 2 mod 13 9+7 ß 4 mod 12 13 + 13 ß 1 mod 25 C) 5+9 ß 4 mod 10 16 + 13 ß 3 mod 26 12 + 7 ß 6 mod 14 d)2+7 …
  5. Math

    How do I solve for negative modular arithmetic?
  6. Math

    Which Statements of congruence are true and which are false and why?
  7. math

    Which Statements of congruence are true and which are false and why?
  8. Math

    Which Statements of congruence are true and which are false and why?
  9. Math

    Just a quick question: I'm trying to find the least residue of 7^5 mod 50. I've been messing about with Chinese remainder theorem etc... But it seems a bit easy which is throwing me off and making me think I'm solving another question. …
  10. Affine ciphers, modular inverse

    So using the inverse of 17 modulo 26 I have -3(y-4)(mod 26) first am I correct?

More Similar Questions