2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/169804This note continues the theoretical development of deterministic integer factorization algorithms based on systems of polynomials equations. The main result establishes a new deterministic time complexity bench mark in integer factorization.20 Pages, New VersionNumber TheoryGeneral Mathematics11Y05text