2000 character limit reached
On a problem of Chen and Liu concerning the prime power factorization of $n!$
Published 21 Oct 2011 in math.NT | (1110.4814v1)
Abstract: For a fixed prime $p$, let $e_p(n!)$ denote the order of $p$ in the prime factorization of $n!$. Chen and Liu (2007) asked whether for any fixed $m$, one has ${e_p(n2!) \bmod m:\; n\in\mathbb{Z}}=\mathbb{Z}_m$ and ${e_p(q!) \bmod m:\; q {prime}}=\mathbb{Z}_m$. We answer these two questions and show asymptotic formulas for $# {n<x: n \equiv a \bmod d,\; e_p(n2!)\equiv r \bmod m}$ and $# {q<x: q {prime}, q \equiv a \bmod d,\; e_p(q!)\equiv r \bmod m}$. Furthermore, we show that for each $h\geq 3$, we have ${n<x: n \equiv a \bmod d,\; e_p(nh!)\equiv r \bmod m} \gg x{4/(3h+1)}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.