The positive integer n is said to be a nasty number if there exists a positive integer g such that each of the roots of the quadratic equations \(x^ 2+gx+n=0\) and \(x^ 2+gx-n=0\) is a rational integer. It is not difficult to show that n is nasty if and only if \(g=s^ 2+t^ 2\) where s and t are positive integers and \(s>t\). n is said to be a primary nasty number if s and t are relatively prime and of opposite parity; and g is said to be a generator of n. If g can be expressed as a sum of two such squares in h distinct ways then g will generate exactly h primary nasty numbers. Given g, it is shown here how to determine h and find the corresponding nasty numbers.
This page was built for publication: Generators of primary nasty numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762194)
