Article thumbnail
Location of Repository

PROCESS OF ”PRIMOVERIZATION ” OF NUMBERS OF THE FORM a n − 1

By Vladimir Shevelev

Abstract

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. 1

OAI identifier: oai:CiteSeerX.psu:10.1.1.247.4046
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0807.2332... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.