Skip to main content Accessibility help

On the number of primes p for which p+a has a large prime factor

  • Morris Goldfeld (a1)

For any fixed integer a and real variables x, y with y < x let Na(x, y) denote the number of primes px for which p + a has at least one prime factor greater than y. As an elementary application of the following deep theorem of Bombieri on arithmetic progressions,

Theorem (Bombieri, [1]). For any constant A > 0, there exists a positive constant B such that ifwith l = log x, then for x > 1

where Φ(x; m, a) denotes the number of primes less than x which are congruent to a mod m;

we shall prove the following theorem:

Theorem 1. Let a be any fixed integer and let x > e. We then have

where the double sum is taken over primes p and q.

Hide All
1.Bombieri, E., “On the large sieve”, Mathematika, 12 (1965), 201225.
2.Hardy, and Wright, , An introduction to the theory of numbers (Oxford, 1965), 348349.
3.Pracher, K., Primzahlverteilung (Springer, 1957), 4445.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

  • ISSN: 0025-5793
  • EISSN: 2041-7942
  • URL: /core/journals/mathematika
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed