How to show that $\sigma(n)=k$ has a finite # of solutions $k\in\mathbb{N}$?

311 Views Asked by At

I wish the question is clearly explained in the title. Thanks in advance.

1

There are 1 best solutions below

0
On BEST ANSWER

Since $n$ divides $n$ then $ k=\sigma(n) \ge n. $ Hence there are at most $k$ solutions.