2016/11/24 by Jean‐Marc Deshouillers, Laurent Habsieger, Deshouillers, Jean-Marc +5
Mathematics · #Analytic Number Theory Research #Benford’s Law and Fraud Detection #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1611.08180
Let b ≥ 2 be an integer and let s b (n) denote the sum of the digits of the representation of an integer n in base b. For sufficiently large N , one has Cardn ≤ N : |s 3 (n) -- s 2 (n)| ≤ 0.1457205 log n \textgreater N 0.970359. The proof only uses the separate (or marginal) distributions of the values of s 2 (n) and s 3 (n).