2016
DOI: 10.1142/s1793042116500196
|View full text |Cite
|
Sign up to set email alerts
|

Another note on smooth numbers in short intervals

Abstract: Abstract. We prove that, for any positive constants δ and ε and every large enough x, the interval [x, x+ √ x(log x) 7/3+δ ] contains numbers whose all prime factors are smaller than x ε .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

2
2
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 10 publications
(16 reference statements)
2
2
0
Order By: Relevance
“…The later conjecture is motivated by attempts at rigorously estimating the running time of Lenstra's elliptic curve factoring algorithm [24,Section 6]. Our result also improves on earlier work of Croot [4], Matomäki [27,28] and Balog [1]. Finally for small fixed ε, a more difficult to state variant of Theorem 2 (see section 2) shows that C(ε) = ρ(1/ε) −13 is admissible, where ρ(u) is the Dickman-de Brujin function.…”
Section: Introductionsupporting
confidence: 76%
See 1 more Smart Citation
“…The later conjecture is motivated by attempts at rigorously estimating the running time of Lenstra's elliptic curve factoring algorithm [24,Section 6]. Our result also improves on earlier work of Croot [4], Matomäki [27,28] and Balog [1]. Finally for small fixed ε, a more difficult to state variant of Theorem 2 (see section 2) shows that C(ε) = ρ(1/ε) −13 is admissible, where ρ(u) is the Dickman-de Brujin function.…”
Section: Introductionsupporting
confidence: 76%
“…This improves on earlier work of Matomäki [28] and unpublished work of Hafner [13]. It would be interesting, in view of applications towards the complexity of Lenstra's elliptic curve factoring algorithm, to extend Corollary 6 to significantly smoother numbers (and one would naturally need somewhat longer intervals [x, x + ψ(x)] with a ψ(x) depending on the smoothness under consideration), even under the assumption of the Riemann Hypothesis.…”
Section: Corollarysupporting
confidence: 61%
“…This is interesting especially in light of the recent result of Matomäki and Radziwiłł [15] (given there as a corollary of their much more general theorem on multiplicative functions) that for all > 0 there is a constant C = C( ) such that the intervals [x, x + C √ x] contain x -smooth numbers (this was previously known only for intervals [x, x + x 1/2 log 7/3+δ x], cf. [14]). The main idea in this paper is to combine their argument with the methods used for finding numbers with large prime factors in [x, x + x 1/2+ ], so that we can reduce the length of the interval as much as possible.…”
Section: Introduction and Resultsmentioning
confidence: 99%
“…x ǫ -smooth numbers (this was previously known only for intervals [x, x + x 1/2 log 7/3+δ x], cf. [14]). The main idea in the current manuscript is to combine their argument with the methods used for finding numbers with large prime factors in [x, x + x 1/2+ǫ ], so that we can reduce the length of the interval as much as possible.…”
mentioning
confidence: 99%