English

Nov\'ak-Carmichael numbers and shifted primes without large prime factors

Number Theory 2017-06-23 v1

Abstract

We prove some new lower bounds for the counting function NC(x)\mathcal N_{\mathcal C}(x) of the set of Nov\'ak-Carmichael numbers. Our estimates depend on the bounds for the number of shifted primes without large prime factors. In particular, we prove that NC(x)x0.7039o(1)\mathcal N_{\mathcal C}(x) \gg x^{0.7039-o(1)} unconditionally and that NC(x)xe(7+o(1))(logx)logloglogxloglogx\mathcal N_{\mathcal C}(x) \gg xe^{-(7+o(1))(\log x)\frac{\log\log\log x}{\log\log x}}, under some reasonable hypothesis.

Keywords

Cite

@article{arxiv.1706.07343,
  title  = {Nov\'ak-Carmichael numbers and shifted primes without large prime factors},
  author = {Alexander Kalmynin},
  journal= {arXiv preprint arXiv:1706.07343},
  year   = {2017}
}

Comments

7 pages