if $x=d(n)$ is the number of divisors in of $n$, what is the tightest lower-bound for $n$ only given $x$?
|
2 | copy edit | ||
what What is the lower bound for a Highly highly composite numbers? |
||||
|
|
1 |
|
||
what is the lower bound for a Highly composite numbersif $x=d(n)$ is the number of divisors in $n$, what is the tightest lower-bound for $n$ only given $x$?
|
||||
