Process of "Primoverization" of Numbers of the Form a^n-1

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/165838We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of numbers of the form a^n-1.6 pages; 4 additional theoremsNumber Theory11B83Process of "Primoverization" of Numbers of the Form a^n-1text