Thursday, 19 May 2016

number theory - Solve linear congruence for x : 34x51(textmod;85)


Solve the linear congruence for x : 34x51(mod85)




I found using the Euclidean Algorithm that the GCD is 17. Because the GCD evenly divides 51, there equivalence should be solvable. I made a Diophantine equation to solve: 34p85q=17



From using the Euclidean Algorithm I have:



85=234+17




34=217+0



17=85234



I do not know where to go from here in order to make this model the Diophantine equation in order to solve for p, and I'm not entirely sure what to do with the solution when I get it, because I am solving for x.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...