Abstract : Let b ≥ 2 be an integer and let s b (n) denote the sum of the digits of the representationof an integer n in base b. For sufficiently large N , one has Card{n ≤ N : |s 3 (n) − s 2 (n)| ≤ 0.1457232 log n} > N 0.970359. The proof only uses the separate distributions of the values of s 2 (n) and s 3 (n).
https://hal.archives-ouvertes.fr/hal-02480241 Contributor : Jean-Marc DeshouillersConnect in order to contact the contributor Submitted on : Saturday, February 15, 2020 - 5:13:49 PM Last modification on : Friday, December 3, 2021 - 12:20:05 PM Long-term archiving on: : Saturday, May 16, 2020 - 12:51:01 PM
Jean-Marc Deshouillers, Laurent Habsieger, Shanta Laishram, Bernard Landreau. Sums of the digits in bases 2 and 3, I. Number Theory - Diophantine Problems, Uniform Distribution and Applications, 2017. ⟨hal-02480241⟩