A divisibility theorem for factorials (Q1584641): Difference between revisions

Motivated by results of \textit{I. Kastanas} [Am. Math. Mon. 101, 179 (1994)] and \textit{S. Akbik} [Int. J. Math. Math. Sci. 22, 655-658 (1999; Zbl 0972.11009)] the following problem is considered: If \(P(n)\) denotes the largest prime factor of \(n\), let \(\tilde{n}=\prod_{p|n, p\leq P(n)} p^{\nu_p(n)}\), where \(\nu_p(n)\) is the exponent of the highest power of \(p\) dividing \(n\). For any function \(f(x)\geq 1\) put \(\mathcal{S}(f,x)=\{n\leq x: \tilde{n}^{f(x)} \text{ does not divide } P(n)!\}\). The authors show that we have \(|\mathcal{S}(f,x)|=o(x)\) for the cardinality \(|\mathcal{S}|\) of \(\mathcal{S}\) if and only if \(\lim_{x\to\infty} (\log f(x))/\log x=0\). Besides this, also a formula for the density \(\delta(c)\) of the set of positive integers \(n\leq x\) all of those prime factors are \(\leq x^c\) for a fixed \(c\geq 0\) is proved.