Sums of the digits in bases 2 and 3, I
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).
Domains
Number Theory [math.NT]
Origin : Files produced by the author(s)
Loading...