It is easy to show that the following problems are equivalent.
a. When is Pn2−2an+fraca2−kP , with P Prime, k=a2modP, and n any integer, a square?
and
b. When is X2−PY2=k solvable in integers?
So, any suggestions on problem a ? How fast would an algorithm used to compute this run ?
No comments:
Post a Comment