zbMATH — the first resource for mathematics

On a method to generate odd primes. (English) Zbl 1084.11507
Summary: We discuss and indirect method to generate all odd primes less than or equal to a given positive odd number \(2N+1\). We employ a bivariate linear function \(f\) to generate the set \(F\) of all composite odd integers, then the set of odd primes follows by deleting \(F\) from the set of odd positive integers. Because \(f\) is not one-to-one, we develop an algorithm which generates a minimal domain set for \(f\) to produce \(F\). The algorithm requires an a priori knowledge of the first few odd primes in \(\root 3\of {2N+1}\), however the algorithm can be used recursively.
11N05 Distribution of primes
11N35 Sieves