This note gives a conservative Version 2 formulation of the Composite–Displacement, or Greedy–Ast, sieve. The algorithm works inside the classical 6–wheel carrier A6 = n∈N: n≡±1 (mod 6), where every prime greater than 3 occurs. For each active prime p≥5, the raw multiples of p inside the carrier split into two genuine arithmetic progressions of common difference 6p, p (6t+ 1), p (6t+ 5).
Stephen Steiner (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: