Finding x and y giving small multiples k in x
2
-dy
2
=kn
We use the Euclidean algorithm. (See
paper
.)
Enter
d (> 1 and non-square):
Enter
n (≥ 2):
Enter
u (> 0, u
2
≡ d (mod n)):
Last modified 20th January 2005
Return to main page