Large prime factors on short intervals
From MaRDI portal
Publication:4958675
Abstract: We show that for all large enough the interval contains numbers with a prime factor Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the same problem for the longer intervals We also incorporate some ideas from Harman's book `Prime-detecting sieves' (2007). The main new ingredient that we use is the iterative argument of Matom"aki and Radziwi{l}{l}(2016) for bounding Dirichlet polynomial mean values, which is applied to obtain Type II information. This allows us to take shorter intervals than in the above-mentioned previous works. We have also had to develop ideas to avoid losing any powers of when applying Harman's sieve method.
Recommendations
Cites work
- scientific article; zbMATH DE number 3863300 (Why is no real title available?)
- scientific article; zbMATH DE number 3695312 (Why is no real title available?)
- scientific article; zbMATH DE number 3458746 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- A Brun-Titschmarsh theorem for multiplicative functions.
- Almost primes in almost all short intervals
- Another note on smooth numbers in short intervals
- Introduction to analytic and probabilistic number theory. Transl. from the 3rd French edition by Patrick D. F. Ion
- Multiplicative functions in short intervals
- NUMBERS WITH A LARGE PRIME FACTOR III
- Numbers with a Large Prime Factor IV
- Numbers with a large prime factor. II
- On the largest prime factor of integers
- Opera de cribro
- Prime-detecting sieves
- The difference between consecutive primes. II
- The largest prime factor of the integers in an interval
- The largest prime factor of the integers in an interval, II
This page was built for publication: Large prime factors on short intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958675)