Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.7.1 (The representations of $a$ by $f$ are proper)
Exercise 3.7.1 (The representations of $a$ by $f$ are proper)
Let be a reduced positive definite form. Show that all representations of by are proper.
Answers
Proof. Let be a reduced positive definite form. Suppose that , where are integers, and put . Then , otherwise , and then , but is a positive definite form, so .
Since , we obtain .
Put . Then , and
where . So the integer is properly represented by , and ,
By Lemma 3.24, or . But if , then , so . This contradiction shows that .
If is a reduced positive definite form, all representations of by are proper. □