Fast multiplication of small numbers.
On Shank's algorithm for modular square roots.
A criterion for non-automaticity of sequences.
An estimate for Frobenius' Diophantine problem in three dimensions.
Achieving snaky.
The greatest common divisor of two recursive functions.
Lower bounds for -ary codes with large covering radius.
Primes in short arithmetic progressions
On Fabry's gap theorem
By combining Turán’s proof of Fabry’s gap theorem with a gap theorem of P. Szüsz we obtain a gap theorem which is more general then both these theorems.
On the powerful part of
We show that is powerfull for integers at most, thus answering a question of P. Ribenboim.
Sumsets avoiding squarefree integers
The exponential sum over squarefree integers
The irrationality of some number theoretical series
Lower bounds for expressions of large sieve type
We show that the large sieve is optimal for almost all exponential sums.
Finiteness of a class of Rabinowitsch polynomials
We prove that there are only finitely many positive integers such that there is some integer such that is 1 or a prime for all , thus solving a problem of Byeon and Stark.
The prime number theorem for Beurling's generalized numbers. New cases
An improvement on Olson's constant for ℤₚ ⊕ ℤₚ
Corrigendum to "An improvement on Olson's constant for ℤₚ ⊕ ℤₚ" (Acta Arith. 141 (2010), 311-319)
On the number of integers represented by systems of Abelian norm forms
Improving on the Brun-Titchmarsh theorem
Page 1 Next