Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Recurso digital |
| Giella: | itáliagiella |
| Almmustuhtton: |
Zenodo
2026
|
| Fáttát: | |
| Liŋkkat: | https://doi.org/10.5281/zenodo.18630244 |
| Fáddágilkorat: |
Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Sisdoallologahallan:
- <p>This work presents the theoretical formalization of the GC-60 modular model, which constitutes the structural foundation of the MicroPrime engine for the construction and marking of multiples within translated numerical windows.</p> <p>The model is based on the decomposition N=60R+10+r</p> <p><br>with rrr belonging to the set of residues coprime with 60. Within this compressed representation, the progression of multiples of an odd integer ppp, coprime with 60, is described as a discrete affine dynamical system in the coordinate space (R,r). The global component evolves linearly in the index R, while the local component follows a cyclic modular dynamics determined exclusively by 2p mod 60.</p> <p>The formalization presented here follows a previously developed conceptual experiment that was empirically verified through C++ implementations. These implementations were designed to demonstrate the structural reliability of a translational marking framework, formulated independently from traditional sieve constructions based on explicit number enumeration, including classical wheel-based reductions modulo 30, 60, or 210.</p> <p>GC-60 is not introduced as a new primality criterion and does not alter the theoretical requirement of considering divisors up to sqrt{N}. The model does not modify the fundamental logic of MicroPrime, but provides a structurally compact representation of multiple progression based on scale separation between global growth and local modular dynamics.</p> <p>The present PDF document is written in Italian and contains the complete mathematical formalization of the model. The associated computational implementations and experimental validation are available in the GitHub repository.</p>