Multiplicative partitions of factorials are expressions of values of the factorial function as products of powers of prime numbers. They have been studied by Paul Erdős and others.[1][2][3]
The factorial of a positive integer is a product of decreasing integer factors, which can in turn be factored into prime numbers. This means that any factorial can be written as a product of powers of primes. For example,
- 1, 1, 3, 3, 10, 10, 30, 75, 220, 220, 588, 588, 1568, 3696, 11616, ... (sequence A085288 in the OEIS).
Not all sorted multiplicative partitions of a given factorial have the same length. For example, the partitions of have lengths 4, 3 and 5. In other words, exactly one of the partitions of has length 5. The number of sorted multiplicative partitions of that have length equal to is 1 for and , and thereafter increases as
Consider all sorted multiplicative partitions of that have length , and find the partition whose first factor is the largest. (Since the first factor in a partition is the smallest within that partition, this means finding the maximum of all the minima.) Call this factor . The value of is 2 for and , and thereafter grows as
- 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, ... (sequence A085290 in the OEIS).
To express the asymptotic behavior of , let
0.80939402054063913071793188059409131721595399242500030424202871504... (sequence A085291 in the OEIS).
The exact value of the constant can be written as the exponential of a certain infinite series. Explicitly,[4]
References edit
- ^ Alladi, Krishnaswami; Grinstead, Charles (1977). "On the decomposition of n! into prime powers". Journal of Number Theory. 9 (4): 452–458. doi:10.1016/0022-314x(77)90006-3.
- ^ Finch, Steven R. (2003). Mathematical Constants. Cambridge University Press. pp. 120–122. ISBN 978-0521818056.
- ^ a b Guy, Richard K. (1994). "Factorial n as the Product of n Large Factors". Unsolved Problems in Number Theory. Springer-Verlag. p. 79. ISBN 978-0387208602.
- ^ Guy, Richard K.; Selfridge, John L. (October 1998). "Factoring Factorial n". The American Mathematical Monthly. 105 (8): 766–767. doi:10.1080/00029890.1998.12004961. ISSN 0002-9890.
- ^ a b Weisstein, Eric. "Convergence Improvement". MathWorld. Retrieved 2017-05-03.
- ^ Erdős, Paul (1971). "Some problems in number theory". Computers in Number Theory. Academic Press. pp. 405–414.