Exercise 4.2.3 (Number of solutions to $\sigma(x) = n$)

Find the smallest positive integer n so that σ ( x ) = n has no solutions; exactly one solution; exactly two solutions; exactly three solutions.

Answers

Proof. Some values of σ :

m 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 σ ( m ) 1 3 4 7 6 12 8 15 13 18 12 28 14 24 24 31 18 39 20 42 32 36 24

(a)
For n > 1 , n and 1 are distinct divisors of n , therefore σ ( n ) = d n d n + 1 .

If n 3 , σ ( n ) n + 1 4 , and σ ( 1 ) = 1 , σ ( 2 ) = 3 , thus σ ( x ) = 2 has no solution. Since 1 = σ ( 1 ) , the smallest positive integer n so that σ ( x ) = n has no solution is

n = 2 .

(b)
First σ ( 1 ) = 1 . By part (a), if n > 1 , σ ( n ) n + 1 , thus σ ( n ) 1 . The only solution of σ ( x ) = 1 is n = 1 . So the smallest positive integer n so that σ ( x ) = n has exactly one solution is n = 1 .

(c)
We note that σ ( 6 ) = σ ( 11 ) = 12 and the given array of values shows that the equation σ ( x ) = 12 has no other solution less that 12 . If n 12 , σ ( n ) n + 1 > 13 , so σ ( n ) 12 . Moreover, no value less that 12 has two antecedents. This shows that the smallest positive integer n so that σ ( x ) = n has exactly two solutions is n = 12 .

(d)
We note that σ ( 14 ) = σ ( 15 ) = σ ( 23 ) = 24 and the given array of values shows that the equation σ ( x ) = 24 has no other solution less that 24 . If n 24 , σ ( n ) n + 1 > 25 , so σ ( n ) 24 . Moreover, no value less that 24 has three antecedents. This shows that the smallest positive integer n so that σ ( x ) = n has exactly three solutions is n = 24 .

User profile picture
2025-01-12 16:41
Comments