Results 1 to 2 of 2

Math Help - [SOLVED] Euclids algorithm & congruence equations help

  1. #1
    Super Member
    Joined
    Oct 2007
    From
    Santiago
    Posts
    517

    [SOLVED] Euclids algorithm & congruence equations help

    Hey guys, I need help with this question. "Use Euclids algorithm to find integer solutions of the given equation and hence find solutions of the congruence equations that are also given."

    Equation: 127a + 583b = 1
    Congruence equation: 127x = 1 (mod 583)

    After doing Euclids algorithm, I found a = 101 and b = -22. But knowing this information, how do I find x in: 127x = 1 (mod 583)

    thank you!
    Last edited by mr fantastic; June 18th 2010 at 04:25 AM. Reason: Marked as solved.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Oct 2007
    From
    Santiago
    Posts
    517
    Think I got it, that's just the answer from the equation.. x = 101. So 127 X 101 = 1 (mod 583)
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 0
    Last Post: April 13th 2009, 06:53 PM
  2. Euclidan Algorithm linear congruence
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 9th 2009, 12:35 PM
  3. congruence and the Division Algorithm...
    Posted in the Advanced Algebra Forum
    Replies: 5
    Last Post: July 8th 2008, 08:56 PM
  4. Abstract Algebra: Congruence and The Division Algorithm 1
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: February 18th 2008, 12:13 PM
  5. Replies: 2
    Last Post: February 16th 2008, 03:30 PM

Search Tags


/mathhelpforum @mathhelpforum