A note on Selberg sieve
A note on small gaps between primes in arithmetic progressions
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
A note on sums of powers which have a fixed number of prime factors.
A note on the average order of the gcd-sum function.
A Note on the Differences Between Consecutive Primes.
A Note on the Growth of Davenport's constant.
A note on the large sieve
A note on the least prime in an arithmetic progression with a prime difference
A note on the number of -Diophantine quadruples
Let be an -tuple of positive, pairwise distinct integers. If for all the prime divisors of come from the same fixed set , then we call the -tuple -Diophantine. In this note we estimate the number of -Diophantine quadruples in terms of .
A note on the parity of the sum-of-digits function.
A note on two conjectures
A note on Waring's problem in GF (p)
A numerical bound for small prime solutions of some ternary linear equations
A prime number theorem in the theory of the Riemann zeta function.
A probabilistic setting for prime number theory
A problem in comparative prime number theory
A problem of D. H. Lehmer and its generalization (II)
A problem of Erdös on sums of two squarefull numbers
A Proof of the Prime Number Summation Formula Without Assuming the Riemann Hypothesis.
A Proof of the Prime Number Summation Formula Without Assuming the Riemann Hypothesis. (Short Communication).