Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.num-analysis.independent

Topic: Solving a set of simultaneous equations using modulo arithmetic
Replies: 1   Last Post: Dec 5, 1996 12:53 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
T.P Harte

Posts: 85
Registered: 12/7/04
Re: Solving a set of simultaneous equations using modulo arithmetic
Posted: Dec 5, 1996 12:53 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


ysr@grove.ufl.edu wrote:

: Hi,
: Could any of you please suggest a method for solving linear
: equations involving modulo arithmetic. We are not able to solve these
: using conventional methods because they involve division.

Probably needs more information...

If you mean you require solutions to equations such as:

ax + by = c

then this is (re-written in modulo terms) :

ax == c (mod y), where "==" stands for a congruence

Thus, to find x, simply multiply by te inverse of a:

a^{-1}.a.x == a^{-1}c (mod y)

x == a^{-1}c (mod y)

No division is involved as a^{-1} can be calculated, provide (a,y)=1, and then
simply multiplied. But this is so simple that I'm sure that you're probably
asking something else.

Thomas.





Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.