2018
DOI: 10.1017/s144678871800023x
|View full text |Cite
|
Sign up to set email alerts
|

On Values Taken by the Largest Prime Factor of Shifted Primes

Abstract: Denote by $\mathbb{P}$ the set of all prime numbers and by $P(n)$ the largest prime factor of positive integer $n\geq 1$ with the convention $P(1)=1$. In this paper, we prove that, for each $\unicode[STIX]{x1D702}\in (\frac{32}{17},2.1426\cdots \,)$, there is a constant $c(\unicode[STIX]{x1D702})>1$ such that, for every fixed nonzero integer $a\in \mathbb{Z}^{\ast }$, the set $$\begin{eqnarray}\{p\in \mathbb{P}:p=P(q-a)\text{ for some prime }q\text{ with }p^{\unicode[STIX]{x1D702}}<q\leq c(\unicode[STIX]… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…As in [9], the letters p, q, r and are always used to denote prime numbers, and d, m, and n always denote positive integers. In what follows, let a ∈ Z * and η ∈ [η 0 , 1 + 4 √ e).…”
Section: Banks-shparlinski's Argument and Sketch Of The Proof Of Theomentioning
confidence: 99%
See 3 more Smart Citations
“…As in [9], the letters p, q, r and are always used to denote prime numbers, and d, m, and n always denote positive integers. In what follows, let a ∈ Z * and η ∈ [η 0 , 1 + 4 √ e).…”
Section: Banks-shparlinski's Argument and Sketch Of The Proof Of Theomentioning
confidence: 99%
“…Moreover for 2 η < 1 + 3 4 √ 2, this estimate holds for any constant c > 1. Very recently, Wu [9] extended Banks-Shparlinski's interval ( 32 17 , 1 + 3…”
Section: Introductionmentioning
confidence: 96%
See 2 more Smart Citations
“…Moreover for 2 η < 1 + 3 4 √ 2 ≈ 2.0606, this estimate holds for any constant c > 1. Very recently, Wu [12] extended Banks-Shparlinski's interval ( 32 17 , 1 + 3 4 √ 2) to ( 32 17 , η 0 ), where η 0 ≈ 2.142 is the unique solution of the equation η − 1 − 4η log(η − 1) = 0 in (1, ∞). Banks & Shparlinski [1, page 144] also remarked that the asymptotic formula (1.1) holds for η ∈ (1, 32 17 ] if we assume the Elliott-Halberstam conjecture (see EH prime [ε] below).…”
Section: Introductionmentioning
confidence: 99%