On Benford's law to variable base (Q1387689)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Benford's law to variable base |
scientific article; zbMATH DE number 1160171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Benford's law to variable base |
scientific article; zbMATH DE number 1160171 |
Statements
On Benford's law to variable base (English)
0 references
6 October 1998
0 references
Given two real numbers \(y\neq 0\) and \(b>1\), we can write \(| y|= mb^k\), where \(1\leq m<b\) and \(k\) is an integer. Here \(m=m(y,b)\) is called the mantissa of \(y\), while \(k=k (y,b)\) is called the exponent of \(y\) to the base \(b\). If \(y\) is a random variable, then the distribution function \(M(b,x): =P[m(y,b) <x]\) is called the mantissa distribution of \(y\) to the base \(b\). In a number of cases, \(m\) is logarithmically distributed: \(M(b,x)= \log_bx\) for \(1<x <b\). This phenomenon is called Benford's law to the base \(b\). From the main result of the present paper it follows that the approximation by Benford's law becomes worse as \(b\to\infty\), but it gets better as \(b\to 1+0\).
0 references
first-digit problem
0 references
Benford's law
0 references
products of random variables
0 references
sums of random variables
0 references
discrepancy
0 references
0 references
0 references
0 references
0 references
0 references
0.86929095
0 references