On prime numbers in an arithmetic progression with a prime-power difference
On prime primitive roots
On prime values of reducible quadratic polynomials
It is shown that Dickson’s Conjecture about primes in linear polynomials implies that if f is a reducible quadratic polynomial with integral coefficients and non-zero discriminant then for every r there exists an integer such that the polynomial represents at least r distinct primes.
On primitive divisors of Mersenne numbers
On primitive lattice points in planar domains
On Representing Integers as Products of the p + 1.
On rough and smooth neighbors.
We study the behavior of the arithmetic functions defined byF(n) = P+(n) / P-(n+1) and G(n) = P+(n+1) / P-(n) (n ≥ 1)where P+(k) and P-(k) denote the largest and the smallest prime factors, respectively, of the positive integer k.
On sequences of ±1's defined by binary patterns [Book]
On sets characterizing number-theoretical functions (II) (The set of "prime plus one"'s is a set of quasi-uniqueness)
On sets of weak uniform distribution
On shifted primes
On short sums of certain multiplicative functions.
On Siegel Zeros of Hecke-Landau Zeta-Functions.
On Sieve method and Goldbach problem
On sign-changes in the remainder-term of the prime-number formula, II
On sign-changes in the remainder-term of the prime-number formula, I
On sign-changes in the remainder-term of the prime-number formula, IV
On sign-changes in the remainder-term of the prime-number formula, III
On small eigenvalues of the Laplacian for ...(q). .
On smooth integers in short intervals under the Riemann Hypothesis