Papers
Topics
Authors
Recent
Search
2000 character limit reached

Novák-Carmichael numbers and shifted primes without large prime factors

Published 22 Jun 2017 in math.NT | (1706.07343v1)

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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.