Ask your own question, for FREE!
Mathematics 22 Online
OpenStudy (christos):

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

ganeshie8 (ganeshie8):

reduce both factors in modulo 13

OpenStudy (christos):

2611 mod 13 135 mod 13 this?

OpenStudy (jhannybean):

How does this work? Can you teach me as well? :P

ganeshie8 (ganeshie8):

yes

ganeshie8 (ganeshie8):

@Jhannybean basically we want to find the remainder when \(2611\times 135\) is divided by \(13\)

OpenStudy (mathmath333):

\[2611 (\mod 13)\\2600+11(\mod 13)\\13\times 200+11 (\mod 13)\equiv 11\]

OpenStudy (jhannybean):

@mathmath333 can you describe your steps? Haha.

ganeshie8 (ganeshie8):

everybody knows this, its just the notation thats new

OpenStudy (mathmath333):

\[135 (\mod 13)\\130+5 (\mod 13)\\13\times 10+5 \mod 13)\equiv 5\]

OpenStudy (mathmath333):

yes this is very simple important formula \((ax+b) (mod ~a)\equiv b\)

OpenStudy (jhannybean):

Oh, I see.

OpenStudy (mathmath333):

oh very fast u learnt

OpenStudy (jhannybean):

Haha no no! I'm still putting it together.

OpenStudy (jhannybean):

So the modulus is the divisor.

OpenStudy (mathmath333):

\(a\) is the divisor and \(b\) is the remainder

ganeshie8 (ganeshie8):

yes thats one interpretation

ganeshie8 (ganeshie8):

\(2611 \mod {13}\) : |dw:1419933225237:dw|

ganeshie8 (ganeshie8):

with mod, you're looking for remainder instead of the quotient

OpenStudy (jhannybean):

|dw:1419933261290:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!