An inequality related to the sieve of Eratosthenes (Q6048606)

Let \(\Phi(x,y)\) be the number of \(n\le x\) which have no prime factors \(p\le y\). In the recent paper [\textit{K. Fan}, Integers 22, Paper A26, 12 p. (2022; Zbl 1517.11122)] in the list of references the first author proved that for \(2\le y\le x\), one has \(\Phi(x,y)<x/\log y\). It is a theorem of Buchstab that for \(u=\log x/\log y\), one has \[ \Phi(x,y)=\frac{x}{\log y}\left(\omega(u)+O\left(\frac{1}{\log y}\right)\right),\tag{1} \] where \(\omega(u)\) satisfies \(u\omega(u)=1\) on \([1,2]\) and \((u\omega(u))'=\omega(u-1)\) for \(u\in (2,\infty)\). It turns out that \(\omega(u)\) has a minimal value of \(1/2\) at \(u=2\) and a maximal value of \(M_0=0.567\ldots\) at \(u=2.76322\ldots\). Motivated by the above facts the authors present some explicit consequences of the above asymptotic. For example, their Theorem 1 shows that for \(3\le y\le {\sqrt{x}}\), one has \(\Phi(x,y)<0.6x/\log y\). The same inequality holds in the range \(2\le y\le {\sqrt{x}}\) and \(x\ge 10\). For the proofs they use numerically explicit estimates for primes due to \textit{J. B. Rosser} and \textit{L. Schoenfeld} [Ill. J. Math. 6, 64--94 (1962; Zbl 0122.05001)] and \textit{J. Büthe} [Math. Comput. 87, No. 312, 1991--2009 (2018; Zbl 1450.11095)] and others as well as a numerically explicit version of the upper bound in Selberg's sieve.