Add to ORKGWe study the problem of bounding the number of primes p ≤ x in an arithmetic progression for which the largest prime factor of p − h does not exceed y.
AbstractLet k, l denote positive integers with (k, l) = 1. Denote by p(k, l) the least prime p ≡ l(m...
International audienceDenote by P the set of all primes and by P + (n) the largest prime factor of i...
summary:In this paper we establish the distribution of prime numbers in a given arithmetic progressi...
Let P denote the set of prime numbers, and let P(n) denote the largest prime factor of an integer n ...
Denote by P the set of all primes and by P (n) the largest prime factor of integer n 1 with the conv...
For any integer n ≥ 1 let P (n) and p(n) denote the greatest prime factor and smallest prime factor ...
We describe some of the machinery behind recent progress in establish-ing infinitely many arithmetic...
Abstract. Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-ty...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
In this paper we obtain lower bounds on the set of the largest prime divisors P(a(n)) of various seq...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
A finite ncreasing sequence {pn}, (n=1, 2, 3, ・・・, t) of prime numbers, (t〓3), is called an arithmet...
Copyright © 2013 Ruting Guo. This is an open access article distributed under the Creative Commons A...
AbstractFor k a non-negative integer, let Pk(n) denote the kth largest prime factor of n where P0(n)...
On the number of prime factors of a finite arithmetical progression by T. N. Shorey (Bombay) and R. ...
AbstractLet k, l denote positive integers with (k, l) = 1. Denote by p(k, l) the least prime p ≡ l(m...
International audienceDenote by P the set of all primes and by P + (n) the largest prime factor of i...
summary:In this paper we establish the distribution of prime numbers in a given arithmetic progressi...
Let P denote the set of prime numbers, and let P(n) denote the largest prime factor of an integer n ...
Denote by P the set of all primes and by P (n) the largest prime factor of integer n 1 with the conv...
For any integer n ≥ 1 let P (n) and p(n) denote the greatest prime factor and smallest prime factor ...
We describe some of the machinery behind recent progress in establish-ing infinitely many arithmetic...
Abstract. Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-ty...
AbstractLet G(x;q,a):=maxPn⩽x(Pn+1−Pn),Pn‵Pn+1‵amodq where (a, q) = 1 and Pn, Pn + 1 are consecutive...
In this paper we obtain lower bounds on the set of the largest prime divisors P(a(n)) of various seq...
AbstractIn a recent paper, K. Soundararajan showed, roughly speaking, that the integers smaller than...
A finite ncreasing sequence {pn}, (n=1, 2, 3, ・・・, t) of prime numbers, (t〓3), is called an arithmet...
Copyright © 2013 Ruting Guo. This is an open access article distributed under the Creative Commons A...
AbstractFor k a non-negative integer, let Pk(n) denote the kth largest prime factor of n where P0(n)...
On the number of prime factors of a finite arithmetical progression by T. N. Shorey (Bombay) and R. ...
AbstractLet k, l denote positive integers with (k, l) = 1. Denote by p(k, l) the least prime p ≡ l(m...
International audienceDenote by P the set of all primes and by P + (n) the largest prime factor of i...
summary:In this paper we establish the distribution of prime numbers in a given arithmetic progressi...