Modulos Math, is there any rule of thump to solve this https://www.dropbox.com/s/nrrn50admio9xls/Screenshot%202014-12-30%2011.39.44.jpg?dl=0
reduce both factors in modulo 13
2611 mod 13 135 mod 13 this?
How does this work? Can you teach me as well? :P
yes
@Jhannybean basically we want to find the remainder when \(2611\times 135\) is divided by \(13\)
\[2611 (\mod 13)\\2600+11(\mod 13)\\13\times 200+11 (\mod 13)\equiv 11\]
@mathmath333 can you describe your steps? Haha.
everybody knows this, its just the notation thats new
\[135 (\mod 13)\\130+5 (\mod 13)\\13\times 10+5 \mod 13)\equiv 5\]
yes this is very simple important formula \((ax+b) (mod ~a)\equiv b\)
Oh, I see.
oh very fast u learnt
Haha no no! I'm still putting it together.
So the modulus is the divisor.
\(a\) is the divisor and \(b\) is the remainder
yes thats one interpretation
\(2611 \mod {13}\) : |dw:1419933225237:dw|
with mod, you're looking for remainder instead of the quotient
|dw:1419933261290:dw|
Join our real-time social learning platform and learn together with your friends!