Process of "Primoverization" of Numbers of the Form a^n-1
Number Theory
2008-07-29 v2
Abstract
We 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.
Cite
@article{arxiv.0807.2332,
title = {Process of "Primoverization" of Numbers of the Form a^n-1},
author = {Vladimir Shevelev},
journal= {arXiv preprint arXiv:0807.2332},
year = {2008}
}
Comments
6 pages; 4 additional theorems