Modulo arithmetic

[Krack_CAT]

Hi,

Can you all please explain something about this topic. I have seen in many post, geniuses using this "mod" stuff for solving big problems like a^b % c.

I think this is a fundamentally important topic and would like to know more indepth. can the gurus please contribute to this.

Thank You

[skylark]

Originally Posted by Krack_CAT

Hi,

Can you all please explain something about this topic. I have seen in many post, geniuses using this "mod" stuff for solving big problems like a^b % c.

I think this is a fundamentally important topic and would like to know more indepth. can the gurus please contribute to this.

Thank You

Hey,

I agree! I think - and folks, who know this pls correct me if I'm wrong - modulo arithmetic has its basis in Number Theory. For the past couple of days, I've been trying to find some good online resource or book that would help in clearing these fundas but haven't been too succesful

I did kick off with something extremely elemetary though (which I hadn't actually realized before):

Something like, any no. can be expresed as: n= p*q + n (mod p)

So say... what would be the remainder of 47*62/31 - I tried doing it by expressing it in the above form. Then increase it to 3 nos. etc... Anyway, I guess you're probably aware of this but thought I'd mention it.

Would be nice if someone could help out in getting started with this.

P.S. Unrelated but a nice site: http://www.thiel.edu/mathproject/atps/tbloc.htm

[ashish abraham]

Originally Posted by skylark

Something like, any no. can be expresed as: n= p*q + n (mod p)

So say... what would be the remainder of 47*62/31 - I tried doing it by expressing it in the above form.

well.. there is no need to make it complicated.. 62 is a multiple of 31 n so it wud give a remainder of 0...

quant materials of the coaching institutes will suffice to learn these n i doubt if there is a need to start a separate thread 4 this..