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

Abstract

We prove some new lower bounds for the counting function N 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 N C(x) x0.7039-o(1) unconditionally and that N C(x) xe-(7+o(1))( x) x x, under some reasonable hypothesis.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…