Linear recurrence relations, primitivity and Benford's law (Q372500)

A sequence of positive real numbers \((u_n)_{n\geq1}\) satisfies Benford's law in an integer base \(b \geq 2\) if \(\lim_{N\to\infty} |\{1\leq n\leq N: M_b(u_n) < t\}|/N = \log_b(t)\) for all \(t \in [1,b)\), where \(M_b(x)\) denotes the mantissa of \(x\), i.e., the unique element \(x b^m \in [1,b)\) with \(m \in \mathbb{Z}\). For linear recurrent sequences, the authors give conditions on the coefficients of the recurrence and the initial values that ensure Benford's law. Polynomial subsequences of linear recurrent sequences are considered as well. The main tools are the Perron-Frobenius theorem on primitive matrices and criteria for the irrationality of \(\log_b(\rho)\), where \(\rho\) is the dominant root of the characteristic polynomial of the recurrence. The authors consider only bases \(b > 2\), but I see no reason for excluding the binary case.