A new upper bound for finite additive bases
C. Sinan Güntürk, Melvyn B. Nathanson (2006)
Acta Arithmetica
Similarity:
C. Sinan Güntürk, Melvyn B. Nathanson (2006)
Acta Arithmetica
Similarity:
Jaroslav Nešetřil, Oriol Serra (2004)
Acta Arithmetica
Similarity:
G. Horváth (2007)
Acta Arithmetica
Similarity:
Tang, Chi-Wu, Tang, Min (2010)
Integers
Similarity:
Lee, Jaewoo (2010)
Integers
Similarity:
Paul Erdös, Melvyn Nathanson (1989)
Acta Arithmetica
Similarity:
Ioannis Konstantoulas (2013)
Acta Arithmetica
Similarity:
We study representation functions of asymptotic additive bases and more general subsets of ℕ (sets with few nonrepresentable numbers). We prove that if ℕ∖(A+A) has sufficiently small upper density (as in the case of asymptotic bases) then there are infinitely many numbers with more than five representations in A+A, counting order.
Sándor, Csaba (2008)
Integers
Similarity:
Aleksandar Krapež, M.A. Taylor (1985)
Publications de l'Institut Mathématique
Similarity:
Georges Grekos (1998)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Pushkin, L. (2002)
Lobachevskii Journal of Mathematics
Similarity:
Paul Balister, Jeffrey Paul Wheeler (2009)
Acta Arithmetica
Similarity: