Ricardo Adonis Caraccioli Abrego

An Incremental Euler–Fermat Prime-Generation Machine: Modular Scheduling, Residual Prime Extraction, and Finite Validation

This work presents an incremental prime-generation machine based on Euler’s polynomial (E(n)=n^2+n+41), the base-2 Fermat test, and a modular schedule of previously discovered factors. The method distinguishes between direct primes produced by the polynomial and residual primes e...