Note on shifted primes with large prime factors

Abstract

We denote by P+(n) the largest prime factor of the integer n. In 1935, Erd os studied the quantity Tc(x) defined by Tc(x)=|\p x: P+(p-1) pc\|, and he proved x→ ∞Tc(x)π(x)→ 0, as~c→ 1. Recently, Ding gave a quantitative form of Erd os' result, showing that x→ ∞Tc(x)π(x) 8(c-1-1). holds for 8/9< c<1. In this paper, we improve Ding's upper bound to x→ ∞Tc(x)π(x) -72 c for e-27< c<1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…