Wednesday, 30 November 2011

nt.number theory - When is Pn22an+fraca2kP , with P Prime, k=a2modP, a square?

It is easy to show that the following problems are equivalent.



a. When is Pn22an+fraca2kP , with P Prime, k=a2modP, and n any integer, a square?



and



b. When is X2PY2=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