Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.5.13 ($H(d) = \sum_{r>0,\, r^2 \mid d} h(d/r^2)$)
Exercise 3.5.13 ($H(d) = \sum_{r>0,\, r^2 \mid d} h(d/r^2)$)
A binary quadratic form is called primitive if . Prove that if is a form of discriminant and then is a primitive form of discriminant . If is not a perfect square, let denote the number of classes of primitive forms with discriminant . Prove that where the sum is over all positive integers such that .
Answers
Proof. Let be a form of discriminant and . We suppose that , so that .
Then , where are integers satisfying , because , so . Then is a form of discriminant , and this form is primitive since .
For every integer such that is not a perfect square, let denote the set of classes of of forms of discriminant , and let denote the set of classes of primitive forms of discriminant (these forms are supposed definite positive if ).
Let be the set of classes of forms of discriminant such that (this makes sense because the discriminant and the g.c.d. of the coefficients does not depend on the choice of a representative of the class by Problem 11).
Then
this union being a disjoint union. If , then , and , thus . So if these conditions are not satisfied. This gives
Consider now, for , the map
which sends the class of on the class of , where .
We show first that this map is well defined. If , where , then (Problem 11). There is a matrix such that , i.e.
If , then
Therefore , thus does not depend on the choice of the representative of , and so is well defined.
Moreover, is a bijection, whose reciprocal bijection sends the class of the primitive form on the class of in . This shows that
Then the equality (1) gives
So
□