Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.7.7* (Smallest values of $f(x,y)$)
Exercise 3.7.7* (Smallest values of $f(x,y)$)
Let be a reduced positive definite form. Suppose that and that . Show that must be one of the numbers , , or .
Answers
Proof. By hypothesis is a reduced positive definite formform, so
and in both cases
(and ).
Suppose that . We prove that either , or .
- Suppose that . Then , and .
-
Suppose that .
- If , then .
- If , then .
-
If , then
because this last inequality is equivalent to .
If , then , and we are done. Otherwise , but (1) shows that , so , and .
In this case,
-
If , then
Therefore
because
and by (2), .
Since , this shows that .
-
Suppose that . Then is odd.
-
If , then
because this last inequality is equivalent to .
If , then , and we are done. Otherwise, , and by (1), this implies , and . Then
- is impossible since is odd.
-
If , then
Therefore
because
and by (2),
-
-
Suppose that . Then by (3.3),
because
and by (2), .
Since , this shows that .
In all cases, either , or . In other words, if and , then must be one of the numbers , , or . □
Comments
-
I don't know if those reading these solutions are robots or humans. In both cases, please report any errors and typos in the comments.richardganaye • 2024-12-09