Talk:Sequence: smallest number with exactly n divisors: Difference between revisions
Talk:Sequence: smallest number with exactly n divisors (view source)
Revision as of 12:54, 13 April 2019
, 5 years ago→The Combinatronics
Line 13:
4 4 25 1296
</pre>
By examination I can now produce S(1)..S(8). S(9) may be 36, S(10) may be 48 and(S12) may be 72, but being greater than 30 there may be a smaller value with 3 primes.<br>For 3 primes the number of factors is 1+A1+A2+A3+A1*A2+A1*A3+A2*A3+A1*A2*A3 and are good upto 2*3*5*7 (210). 2*3*5 has 8 factors
|