- #1
quila
- 7
- 0
Can some one tell me how to figure out if this is solvable or not?
For the Prime number p=68659,
19=x^2 mod p.
Why?
For the Prime number p=68659,
19=x^2 mod p.
Why?
OK how do you work the problem x^2 = 7 mod 67 since according to the law of quadratic recprocity there is a solution. I haverobert Ihnot said:I just ran a calculator, however, you would have to go through 25250 terms, so I had to shorten that. The fact is all odd squares are congruent to 1 Mod 8. Both 19 and 68659 and congruent to 3 Mod 8. So to solve the equation X^2 = 19 + 68659K, we must have K==2 Mod 8. Thus K=2+8J.
So we are left with the form X^2 = 19 + 137318 + 549272(J) = 137337 + 549272(J). So the program runs much faster now through values of J. J = 3156.
But, if you'd go back to how the problem is supposed to be worked, such details are unnecessary.
The equation means that 19 is congruent to x^2 modulo p, where p is a prime number. This means that when x^2 is divided by p, the remainder is equal to 19.
It depends on the value of p. If p is a prime number that satisfies certain conditions, then the equation is solvable for x. Otherwise, it may not have a solution.
The value of p=68659 is important because it determines whether the equation is solvable or not. This value is a prime number, so the equation is solvable for x.
To solve the equation, you will need to use modular arithmetic principles and techniques. You can also use tools such as a calculator or computer program to help with the calculations. Alternatively, you can consult a mathematician or attend a math course to learn more about solving equations like this one.
Yes, this equation has applications in cryptography and coding theory. It can also be used in various mathematical and scientific problems that involve modular arithmetic and prime numbers.