Artin's conjecture on primes with prescribed primitive roots
Aspectos computacionales de los números primos (I).
Asymptotic formulae.
Asymptotic order of the square-free part of .
Average Frobenius distribution of elliptic curves
Bemerkungen über Primzahlen in kurzen Reihen
Bemerkungen zur Arbeit von S. Knapowski und P. Turán.
Beweis des Satzes, dass jede eigentlich primitive quadratische Form unendlich viele Primzahlen darzustellen fähig ist
Bombieri's theorem in short intervals
Bombieri's theorem in short intervals. II.
Bounds for the counting function of the Jordan-Pólya numbers
A positive integer is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number .
Chebyshev's method for number fields
We give an elementary proof of an explicit estimate for the number of primes splitting completely in an extension of the rationals. The proof uses binomial coefficents and extends Chebyshev's classical approach.
Chen's double sieve, Goldbach's conjecture and the twin prime problem, 2
Chen's double sieve, Goldbach's conjecture and the twin prime problem
Class numbers of elliptic function fields and the distribution of prime numbers
Compact integers and factorials
Consecutive integers in algebraic number fields.
Consequences of a theorem of Erdős-Prachar.
Correction to the paper "The divisor problem for (k, r)-integers. II".
Correction to the paper "The number of k-free and k-ary divisors of m which are prime to n".