Ask your own question, for FREE!
Mathematics 15 Online
OpenStudy (empty):

I suspect this to be true, not sure how I'd go about proving it though.

OpenStudy (jadeishere):

Um... @agent0smith

OpenStudy (empty):

Heh, whoops upper index should be this: \[(b+a-1)(b-a) \equiv \sum_{n=a}^{b-1} 2*n \mod m\]

OpenStudy (photon336):

Welcome back empty

OpenStudy (empty):

Haha thanks. I think I figured it out actually, I just realized I could prove this one. I think I'll present the real situation later if I get bored enough.

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!