Hostname: page-component-7dd5485656-npwhs Total loading time: 0 Render date: 2025-10-30T16:58:10.985Z Has data issue: false hasContentIssue false
  • English
  • Français

PRIMES IN BEATTY SEQUENCES IN SHORT INTERVALS

Part of: Multiplicative number theory

Published online by Cambridge University Press:  17 February 2016

Glyn Harman
Glyn Harman*
Affiliation:
Royal Holloway, University of London, Egham, Surrey TW20 0EX, U.K. email G.Harman@rhul.ac.uk
Get access

Abstract

In this paper we show that sieve methods used previously to investigate primes in short intervals and corresponding Goldbach-type problems can be modified to obtain results on primes in Beatty sequences in short intervals.

MSC classification

Primary: 11N13: Primes in progressions
Secondary: 11N36: Applications of sieve methods

Information

Type
Research Article
Information
Mathematika , Volume 62 , Issue 2 , 2016 , pp. 572 - 586
Copyright
Copyright © University College London 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Baker, R. C., Diophantine Inequalities (LMS Monographs (New Series) 1 ), Clarendon (Oxford, 1986).Google Scholar
Baker, R. C. and Harman, G., The three primes theorem with almost equal summands. Philos. Trans. R. Soc. Lond. A 356 1998, 763–780.CrossRefGoogle Scholar
Baker, R. C., Harman, G. and Pintz, J., The exceptional set for Goldbach’s problem in short intervals. In Sieve Methods, Exponential Sums and Their Applications in Number Theory, Cambridge University Press (Cambridge, 1997), 11–54.Google Scholar
Baker, R. C., Harman, G. and Pintz, J., The difference between consecutive primes II. Proc. Lond. Math. Soc. (3) 83 2001, 532–562.Google Scholar
Baker, R. C. and Zhao, L., Gaps between primes in Beatty sequences. Preprint, 2014,arXiv:1411.2989 [math.NT].Google Scholar
Banks, W. D. and Shparlinski, I., Prime numbers in Beatty sequences. Colloq. Math. 115 2009, 147–157.Google Scholar
Brüdern, J. and Kawada, K., The localisation of primes in arithmetic progressions of irrational modulus. Colloq. Math. 123 2011, 53–61.Google Scholar
Harman, G., Prime-detecting Sieves (London Mathematical Society Monographs Series 33 ), Princeton University Press (Princeton, NJ, 2007).Google Scholar
Harman, G., Primes in intersections of Beatty sequences. J. Integer Seq. 18 2015, Article 15.7.3.Google Scholar
Heath-Brown, D. R. and Iwaniec, H., On the difference between consecutive primes. Invent. Math. 55 1979, 49–69.CrossRefGoogle Scholar
Huxley, M. N. and Iwaniec, H., Bombieri’s theorem in short intervals. Mathematika 22 1975, 188–194.CrossRefGoogle Scholar
Jutila, M., Mean value estimates for exponential sums with applications to L-functions. Acta Arith. 57 1991, 93–114.Google Scholar
Lü, G. and Sun, H., The ternary Goldbach–Vinogradov theorem with almost equal primes from the Beatty sequence. Ramanujan J. 30 2013, 153–161.Google Scholar
Maynard, J., Small gaps between primes. Ann. of Math. (2) 181(1) 2015, 383–413.CrossRefGoogle Scholar
Vaughan, R. C., The Hardy–Littlewood Method (Cambridge Tracts in Mathematics 80 ), 2nd edn., Cambridge University Press (Cambridge, 1997).CrossRefGoogle Scholar
Vaughan, R. C., The general Goldbach problem with Beatty primes. Ramanujan J. 34 2014, 347–359.Google Scholar
Zhan, T., On the representation of large odd integer as a sum of three almost equal primes. Acta Math. Sinica 7 1991, 259–272.Google Scholar