Semi-\(k\)-free integers (Q2544238): Difference between revisions

Let \(k\) be a fixed integer \(\ge 2\). In this note a positive integer \(n\) is called semi-\(k\)-free, if the multiplicity of each prime factor of \(n\) is not equal to \(k\) or equivalently, if \(n\) is not divisible unitarily by the \(k\)-th power of any prime. If \(Q_k^*(x)\) denotes the number of semi-\(k\)-free integers \(\le x\), then it is proved that \[ Q_k^*(x) = \alpha_k^*x + O(x^{1/k})\] where \(\alpha_k^*x = \prod_p (1 - 1/p^k + 1/p^{k+1})\), the product being extended over all primes~\(p\).