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

Simple item page
dc.creatorShevelev, Vladimir
dc.date2008-07-15
dc.date2008-07-29
dc.date.accessioned2026-07-07T09:53:07Z
dc.date.available2026-07-07T09:53:07Z
dc.descriptionWe 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.
dc.description6 pages; 4 additional theorems
dc.identifierhttps://arxiv.org/abs/0807.2332
dc.identifierhttp://arxiv.org/abs/0807.2332
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165838
dc.subjectNumber Theory
dc.subject11B83
dc.titleProcess of "Primoverization" of Numbers of the Form a^n-1
dc.typetext

Files

Collections

arXiv