An integral binary quadratic form is primitive when . This condition concerns its polynomial coefficients, rather than the values of a particular representing pair. For example, is primitive, while has a common divisor two and represents only even integers.
Primitivity is invariant under proper equivalence. Expanding an integer change of variables expresses every new polynomial coefficient as an integer linear combination of the old ones, so every common divisor of the old coefficients divides the new ones. The integer inverse gives the converse. Their greatest common divisor, called the content, is therefore unchanged.
A primitive representation separately means in . Even a primitive form can have nonprimitive representations: for . A representation of a prime number, however, must use a coprime pair, since a common divisor would force to divide that prime. This observation drives the discriminant criterion for prime representation by a binary quadratic form.
Articles by others on the same topic
There are currently no matching articles.