On the \(k\)-th extension of the sieve of Eratosthenes (Q1895284)

The \(k\)th extension of the sieve of Eratosthenes operates on the set \(S_k\), the positive integers not divisible by any of the \(k\) smallest primes. The set of differences between successive multiples in \(S_k\) of a prime \(p\) \((>p_k)\) is obtained, as are rules for calculating the positions in \(S_k\) of such multiples. The efficiency of the sieving process is examined, and it is suggested that there is little advantage in taking \(k> 4\). In Lemma 9 and the table following, one should either have \(100(1-\phi(\pi_k)/\pi_k)\%\) or \((1-\phi(\pi_k)/\pi_k)\) without the percentage sign. The name Bengelloun is misspelt, in different ways, in the text and the references.