Topic: Modular Arithmetic
Not finding your answer? Try searching the web for Modular Arithmetic
Answers to Common Questions
What is modular arithmetic?
n. A form of arithmetic dealing with integers in which all numbers having the same remainder when divided by a whole number are considered equivalent: Clocks use modular arithmetic with modulus 12, so 4 hours after 9 o'clock is 1 o'clock. Read More »
Source: http://www.answers.com/topic/modular-arithmetic
Which mathematician discovered modular arithmetic?
According to Wikipedia, Carl Friedrich Gauss invented it. Quote Wikipedia, "Modular arithmetic was introduced by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae , published in 1801." Read More »
Source: http://wiki.answers.com/Q/Which_mathematician_discovered_modular_...
What is the difference between modular arithmetic and ordinary ar...
In ordinary arithmetic, the resulting value will be from an infinite set of values but in case modular arithmetic, resulting value will be from a finite set of values. Open in Google Docs Viewer Open link in new tab Open link in new window ... Read More »
Source: http://wiki.answers.com/Q/What_is_the_difference_between_modular_...
Featured Content:
Modular Arithmetic
More Common Questions
Answers to Other Common Questions
9^2010 (mod 10) ≡ (-1)^2010 (mod 10) ≡ 1 (mod 2010) ============ 7^777 (mod 9) ≡ (-2)^777 (mod 9) ≡ ((-2)^3)^259 (mod 9) ≡ (-8)^259 (mod 9) ≡ -8^259 (mod 9) ≡ -(-1)^259 (mod 9) ≡ -(-1) (mod 9) ≡ 1 (mod 9) ========== M^2010 (mod 8) I don´t k...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20110326123037AAn41fE
Any kind of calculation where numbers "wrap around" uses modular arithmetic. Think about math on a clock: If it's 8 o'clock now, in 7 hours it will be 3 o'clock. 8 + 7 = 3 (mod 12). The basic laws of even and add numbers (odd + odd = even, ...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20090302064857AAFTPNU
If you're asking if the modulo operation has an inverse, the answer is no. Consider that 8 + 4 modulo 10 = 2 and 18 + 4 modulo 10 also = 2 So, if you tell me the modulus is 10 and the residue is 2, how can I determine a unique value? I can'...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20070915132516AAxJYVt
First, the easy question… How do you get 64 (mod 5) = 4, and 512 (mod 5) = 2 64 mod 5 = ? 5 * ( (64/5) - INT(64/5) ) = ? 5 * ( 12.8 - INT(12.8) ) = ? 5 * ( 12.8 - 12 ) = ? 5 * ( 0.8 ) = ? 5 * 0.8 = 4 512 mod 5 = ? 5 * ( (512/5) - INT(512/5)...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20120415110547AAoHXvo
Fermat's little theorem explicitly tells you a simple fact about exponents in modular arithmetic over a prime. For any value a not 0, a^p = a (mod p), or a^(p-1) = 1 (mod p) So this gives you an easy way to evaluate huge exponents in modula...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20120321200921AA6IzkY
Wikipedia is always a good place to start to learn any basics of just about any topic including modular arithmetic. Generally there are references to other websites that can help you if you start there. The other web sites I have provided a...
Read More »
Source: http://answers.yahoo.com/question/index?qid=20090223191514AAeY0Os
