Erdős Problem #646 — Even Prime-Adic Valuations in Factorials
For a prime and a positive integer , let denote the exponent of in the prime factorization of . The question is whether, for every finite set of primes, there are infinitely many positive integers such that
Equivalently, each prime in divides to an even exponent. The original formulation specifies distinct primes; this set formulation includes that condition. Erdős Problem #646 On a problem of Chen and Liu concerning the prime power factorization of n! (arXiv:1110.4814)
Background
The question concerns the simultaneous behavior of several prime exponents in a factorial. Legendre’s formula expresses each exponent both as a sum of floor terms and through the base- digit sum :
This connects the parity condition to the arithmetic of the digits of the same integer in several different bases. On a problem of Chen and Liu concerning the prime power factorization of n! (arXiv:1110.4814)
Erdős and Graham highlighted the difficulty of even proving that, for any fixed number of primes, some factorial has all the corresponding exponents even. The problem appeared in their 1980 work and was also recorded by Erdős in 1997. Berend’s solution broadened the parity question to divisibility of the exponents by an arbitrary fixed modulus. Erdős Problem #646 On a problem of Chen and Liu concerning the prime power factorization of n! (arXiv:1110.4814) Erdős, Some of my favourite unsolved problems (1997)
Progress summary
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.