2000 character limit reached
Novák-Carmichael numbers and shifted primes without large prime factors (1706.07343v1)
Published 22 Jun 2017 in math.NT
Abstract: We prove some new lower bounds for the counting function $\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 $\mathcal N_{\mathcal C}(x) \gg x{0.7039-o(1)}$ unconditionally and that $\mathcal N_{\mathcal C}(x) \gg xe{-(7+o(1))(\log x)\frac{\log\log\log x}{\log\log x}}$, under some reasonable hypothesis.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.