Sums of digits, overlaps, and palindromes.
Allouche, Jean-Paul, Shallit, Jeffrey (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Allouche, Jean-Paul, Shallit, Jeffrey (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
R.C. Baker, J. Brüdern (1991)
Monatshefte für Mathematik
Similarity:
Xiangneng Zeng, Pingzhi Yuan (2011)
Acta Arithmetica
Similarity:
R.C. Baker, J. Brüdern (1991)
Monatshefte für Mathematik
Similarity:
Alfred Moessner, George Xeroudakes (1954)
Publications de l'Institut Mathématique
Similarity:
Giudici, Michael, Hart, Sarah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Calkin, Neil J., Finch, Steven R. (1996)
Experimental Mathematics
Similarity:
Vsevolod F. Lev (2008)
Acta Arithmetica
Similarity:
Zhi-Wei Sun (2001)
Acta Arithmetica
Similarity:
Julia Brandes (2015)
Acta Arithmetica
Similarity:
We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions a, b ∈ ℕ to the equations a + b = n and a - b = n, where a is k-free and b is l-free. This is the first time that this problem has been studied with distinct powers k and l.
Tingting Wang (2012)
Acta Arithmetica
Similarity:
Sun, Zhiwei (2003)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
Trevor D. Wooley (2015)
Acta Arithmetica
Similarity:
Estimates are provided for sth moments of cubic smooth Weyl sums, when 4 ≤ s ≤ 8, by enhancing the author's iterative method that delivers estimates beyond classical convexity. As a consequence, an improved lower bound is presented for the number of integers not exceeding X that are represented as the sum of three cubes of natural numbers.
L. Carlitz (1980)
Acta Arithmetica
Similarity:
Xingwu Xia, Yongke Qu, Guoyou Qian (2014)
Colloquium Mathematicae
Similarity:
Let G be an additive abelian group of order k, and S be a sequence over G of length k+r, where 1 ≤ r ≤ k-1. We call the sum of k terms of S a k-sum. We show that if 0 is not a k-sum, then the number of k-sums is at least r+2 except for S containing only two distinct elements, in which case the number of k-sums equals r+1. This result improves the Bollobás-Leader theorem, which states that there are at least r+1 k-sums if 0 is not a k-sum.