2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/123586This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p < q < 2p in superpolynomial time. Further, an extension of the Fermat factoring method is proposed.23 PagesNumber TheoryGeneral Mathematics11Y05, 11D09text