Hey guys, jsut wondering how to figure out this question: Find an integer so that mod 173.
Follow Math Help Forum on Facebook and Google+
Suppose you have such that . Then such that , so . Now apply the extended Euclidean algorithm to and : . Hence is a solution. This method holds more generally. If , then such that if and only if . If this is the case, then the same method works.
Originally Posted by Giraffro . <---- I DONT KNOW HOW YOU GOT THIS LINE.... Hence is a solution. Hey my writting in blue explains what my problem is.. I understand how you got the line 1 = ...... but dont know how you got the 3 = .....
Anyone can explain? thank you
Originally Posted by jvignacio Hey my writting in blue explains what my problem is.. I understand how you got the line 1 = ...... but dont know how you got the 3 = ..... Just multiply the '1=...' line by 3 to get the '3=...' line and .
View Tag Cloud