An Upper Estimate for the Overpseudoprime Counting Function
Number Theory
2009-09-29 v8
Abstract
We prove that the number of overpseudoprimes to base 2 not exceeding x does not exceed x^(3/4)(1+o(1)).
Cite
@article{arxiv.0807.1975,
title = {An Upper Estimate for the Overpseudoprime Counting Function},
author = {Vladimir Shevelev},
journal= {arXiv preprint arXiv:0807.1975},
year = {2009}
}
Comments
8 pages; addition: there exist infinitly many overpseudoprimes;correction of estimate and addition of a new section