Highly composite equal division: Difference between revisions
→Highly composite edf: in fact, both are random. Edfs tend to correspond to an edo simply becuz there are fewer edfs. |
m →Generalization: +todo |
||
Line 138: | Line 138: | ||
== Generalization == | == Generalization == | ||
{{Todo|inline=1|split page|comment=Move the definitions to [[Highly composite number]] and discuss the properties without regards to equal divisions. }} | |||
=== Extensions === | === Extensions === | ||
It is possible to define ''N''-generalized highly composite numbers as a set of numbers, for which sum of powers of divisors relative to the number is greater than all the ones before it. This means that 0-generalized highly composite numbers are plain highly composite numbers, 1-generalized are superabundant numbers, etc. | It is possible to define ''N''-generalized highly composite numbers as a set of numbers, for which sum of powers of divisors relative to the number is greater than all the ones before it. This means that 0-generalized highly composite numbers are plain highly composite numbers, 1-generalized are superabundant numbers, etc. |