Testing a quadratic irrational for being NSCF reduced

This program takes a quadratic surd ξ=(p + √d)/q, p > 0, q > 0, converts it to standard form if necessary and decides whether or not ξ is NSCF reduced. Unlike another algorithm, it does not find the reduced NSCF predecessor of a reduced ξ. See the paper.
Enter d (1 < d < 1015 and not a square):
Enter p: (> 0)
Enter q: (> 0)

Last modified 18th June 2010
Return to main page