← All problems

Erdős Problem #912 — Distinct exponents in factorial factorizations

1 year old · traced to

For each integer n≥2n\ge 2, write the prime factorisation of n!n! as

n!=∏p≤npkp(n),n!=\prod_{p\le n}p^{k_p(n)},

where the product is over primes and kp(n)=vp(n!)k_p(n)=v_p(n!) is the exponent of pp. Define

h(n)=#{kp(n):p≤n},h(n)=\#\{k_p(n):p\le n\},

so that exponents that occur for more than one prime are counted only once. The question is to prove that there is a constant c>0c>0 such that, as nn tends to infinity through the integers,

h(n)∼c(nlog⁡n)1/2.h(n)\sim c\left(\frac{n}{\log n}\right)^{1/2}.

Erdős Problem #912 Erdős (1982)

Background

Erdős’s 1982 account identifies the problem as joint work with J. L. Selfridge. It records that they had proved the order of magnitude of h(n)h(n) and presents the sharper asymptotic as a substantial further question, noting the difficulty of controlling gaps between consecutive primes. The basic arithmetic link is Legendre’s formula, kp(n)=∑j≥1⌊n/pj⌋k_p(n)=\sum_{j\ge1}\lfloor n/p^j\rfloor: the statistic counts distinct values of these prime-dependent exponents, not primes or prime factors counted with multiplicity. Erdős (1982)

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.