关于超伪素数计数函数的上界估计
数论
2009-09-29 v8
摘要
我们证明了以2为底的超伪素数中不超过x的个数不超过x^(3/4)(1+o(1))。
引用
@article{arxiv.0807.1975,
title = {An Upper Estimate for the Overpseudoprime Counting Function},
author = {Vladimir Shevelev},
journal= {arXiv preprint arXiv:0807.1975},
year = {2009}
}
备注
8 pages; addition: there exist infinitly many overpseudoprimes;correction of estimate and addition of a new section