Homepage › Solution manuals › Johannes Buchmann › Binary Quadratic Forms › Exercise 3.7.5
Exercise 3.7.5
Let be a prime number with . Prove that the form is primitive if and only if does not divide the conductor of .
Answers
Proof. Since , and are well defined.
Assume first that .
-
Assume that
divides the conductor
. Then
for some integer
.
By definition of the conductor, is a discriminant, thus there are integers such that . By definition of , . Therefore
This equality shows that . Thus , so (here is odd). This proves that is not primitive.
To conclude, if is primitive, then does not divide the conductor of .
-
Conversely, assume that
is not primitive. Then
Write , where are integers.
Since , we obtain therefore is a discriminant, of the form , and , where .
By definition of the conductor, is the largest positive integer such that is a discriminant, thus , where .
We must show that . If not, the equality , where , shows that , thus , where , and . Then is a discriminant, in contradiction with the definition of the conductor. This contradiction shows that .
It remains the case .
-
Assume that
divides
. Then
. As in the case
,
, and the equality (1) becomes
Therefore is even, and , and .
If , then (see the definition (3.10)). The equality (2) shows that or is even, and , thus , so . Therefore is not primitive.
If , then . The equality (2) shows that and are odd, and , thus , so is even. Therefore is not primitive.
-
Conversely, assume that
is not primitive. Then
and
are even. Write
.
Then , where .
By definition of the conductor, is the largest positive integer such that is a discriminant, thus , where .
We must show that . If not, the equality shows that . Write . Then , where is odd, thus . But then is a discriminant, in contradiction with the definition of the conductor . This contradiction shows that .