Das 6k ±1-Komposit–Displacement–Sieb: Eine 6–Wheel–Eratosthenes–Implementierung mit Least–Prime–Factor–Besitz

Key Points

• This note formulates a conservative version of the Composite Displacement or Greedy Tree Sieve algorithm.
• Implements a 6-Wheel carrier A6 for numbers congruent to ±1 (mod 6).
• Analyzes raw multiples of each active prime p ≥ 5.
• Investigates the decomposition of multiples into two arithmetic progressions.
• Each prime number greater than 3 is included in the sieving process.
• Arithmetical progressions are identified with a common difference of 6p.