Is there an easier way to work this out without actually counting the amount of numbers?
I have started to count and have realised that nearly only numbers which are only divisible only by 1,2, half of n, and n have for factors.
Is there an easier way to work this out without actually counting the amount of numbers?
I have started to count and have realised that nearly only numbers which are only divisible only by 1,2, half of n, and n have for factors.
Copyright © 2021 JogjaFile Inc.
Hint: If $n=p_1^{e_1}\cdots p_m^{e_m}$, then the number of divisors of $n$ is exactly $(e_1+1)\cdots(e_m+1) \ge 2^m$.
Or, if you want an ad hoc solution, consider this: