Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 4.2.3 (Number of solutions to $\sigma(x) = n$)
Exercise 4.2.3 (Number of solutions to $\sigma(x) = n$)
Find the smallest positive integer so that has no solutions; exactly one solution; exactly two solutions; exactly three solutions.
Answers
Proof. Some values of :
- (a)
-
For
,
and
are distinct divisors of
, therefore
If , , and , thus has no solution. Since , the smallest positive integer so that has no solution is
- (b)
- First . By part (a), if , , thus . The only solution of is . So the smallest positive integer so that has exactly one solution is
- (c)
- We note that and the given array of values shows that the equation has no other solution less that . If , , so . Moreover, no value less that has two antecedents. This shows that the smallest positive integer so that has exactly two solutions is
- (d)
- We note that and the given array of values shows that the equation has no other solution less that . If , , so . Moreover, no value less that has three antecedents. This shows that the smallest positive integer so that has exactly three solutions is