21 citations · 60 across the 22 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.NT2019★ 2 cited
A lower bound for Cusick's conjecture on the digits of n+t
Lukas Spiegelhofer
Let be the sum-of-digits function in base , which returns the number of s in the base-2 expansion of a nonnegative integer. For a nonnegative integer , define…
math.NT2019
The sum-of-digits function on arithmetic progressions
Lukas Spiegelhofer, Thomas Stoll
Let be the sum-of-digits function in base , which returns the number of non-zero binary digits of a nonnegative integer . We study alon g arithmetic subsequences…
math.NT2019★ 3 cited
Approaching Cusick's conjecture on the sum-of-digits function
Lukas Spiegelhofer
Cusick's conjecture on the binary sum of digits of a nonnegative integer states the following: for all nonnegative integers we have \[ c_t=\lim_{N\rightarrow\infty}\…