# Champernowne constant

In mathematics, the Champernowne constant C10 is a transcendental real constant whose decimal expansion has important properties. It is named after economist and mathematician D. G. Champernowne, who published it as an undergraduate in 1933.[1] The number is defined by concatenating the base 10 representations of the positive integers:

C10 = 0.12345678910111213141516...  (sequence A033307 in the OEIS).

Champernowne constants can also be constructed in other bases similarly; for example,

C2 = 0.11011100101110111... 2

and

C3 = 0.12101112202122... 3.

The Champernowne word or Barbier word is the sequence of digits of C10 obtained by writing it in base 10 and juxtaposing the digits:[2][3]

12345678910111213141516...  (sequence A007376 in the OEIS)

More generally, a Champernowne sequence (sometimes also called a Champernowne word) is any sequence of digits obtained by concatenating all finite digit-strings (in any given base) in some recursive order.[4] For instance, the binary Champernowne sequence in shortlex order is

0 1 00 01 10 11 000 001 ... (sequence A076478 in the OEIS)

where spaces (otherwise to be ignored) have been inserted just to show the strings being concatenated.

## Properties

A real number x is said to be normal if its digits in every base follow a uniform distribution: all digits being equally likely, all pairs of digits equally likely, all triplets of digits equally likely, etc. A number x is said to be normal in base b if its digits in base b follow a uniform distribution.

If we denote a digit string as [a0, a1, ...], then, in base 10, we would expect strings [0], [1], [2], …, [9] to occur 1/10 of the time, strings [0,0], [0,1], ..., [9,8], [9,9] to occur 1/100 of the time, and so on, in a normal number.

Champernowne proved that ${\displaystyle C_{10}}$ is normal in base 10,[1] while Nakai and Shiokawa proved a more general theorem, a corollary of which is that ${\displaystyle C_{b}}$ is normal in base ${\displaystyle b}$ for any b.[5] It is an open problem whether ${\displaystyle C_{k}}$ is normal in bases ${\displaystyle b\neq k}$. For example, it is not known if ${\displaystyle C_{10}}$ is normal in base 9. For example, 54 digits of ${\displaystyle C_{10}}$ is 0.123456789101112131415161718192021222324252627282930313. When we express this in base 9 we get ${\displaystyle {0.10888888853823026326512111305027757201400001517660835887}_{9}}$.

Kurt Mahler showed that the constant is transcendental.[6] The irrationality measure of ${\displaystyle C_{10}}$ is ${\displaystyle \mu (C_{10})=10}$, and more generally ${\displaystyle \mu (C_{b})=b}$ for any base ${\displaystyle b\geq 2}$.[7]

The Champernowne word is a disjunctive sequence. A disjunctive sequence is an infinite sequence (over a finite alphabet of characters) in which every finite string appears as a substring

## Series

The definition of the Champernowne constant immediately gives rise to an infinite series representation involving a double sum, ${\displaystyle C_{10}=\sum _{n=1}^{\infty }10^{-\delta _{10}(n)}\sum _{k=10^{n-1}}^{10^{n}-1}{\frac {k}{10^{n(k-10^{n-1}+1)}}},}$ where ${\displaystyle \delta _{10}(n)=9\sum _{\ell =1}^{n-1}10^{\ell -1}\ell }$ is the number of digits between the decimal point and the first contribution from an n-digit base-10 number; these expressions generalize to an arbitrary base b by replacing 10 and 9 with b and b − 1 respectively. Alternative forms are ${\displaystyle C_{b}=\sum _{n=1}^{\infty }n\cdot b^{-\left(\sum \limits _{k=1}^{n}\left\lceil \log _{b}(k+1)\right\rceil \right)}}$ and ${\displaystyle C_{b}=\sum _{n=1}^{\infty }n\cdot b^{-\left(n+\sum \limits _{k=1}^{n-1}\left\lfloor \log _{b}(k+1)\right\rfloor \right)},}$ where ${\displaystyle \lfloor x\rfloor }$ and ${\displaystyle \lceil x\rceil }$ denote the floor and ceiling functions.[8][9]

Returning to the first of these series, both the summand of the outer sum and the expression for ${\displaystyle \delta _{b}(n)}$ can be simplified using the closed form for the two-dimensional geometric series: ${\displaystyle \sum _{k=n}^{\infty }ka^{k}=a^{n}{\frac {n-(n-1)a}{(1-a)^{2}}}.}$

The resulting expression for ${\displaystyle \delta _{b}(n)}$ is ${\displaystyle \delta _{b}(n)=(b-1)\sum _{\ell =1}^{n-1}b^{\ell -1}\ell ={\frac {1}{b-1}}\left(1+b^{n-1}((b-1)n-b)\right),}$ while the summand of the outer sum becomes {\displaystyle {\begin{aligned}b^{-\delta _{b}(n)}\sum _{k=b^{n-1}}^{b^{n}-1}{\frac {k}{b^{n(k-b^{n-1}+1)}}}&=b^{-\delta _{b}(n)}b^{n(b^{n-1}-1)}\left(\sum _{k=b^{n-1}}^{\infty }{\frac {k}{b^{nk}}}-\sum _{k=b^{n}}^{\infty }{\frac {k}{b^{nk}}}\right)\\&={\frac {b^{2n-1}-b^{n-1}+1}{\left(b^{n}-1\right)^{2}}}b^{-\delta _{b}(n)}-{\frac {b^{2n}-b^{n}+1}{\left(b^{n}-1\right)^{2}}}b^{-\delta _{b}(n+1)}.\end{aligned}}} Summing over all n ≥ 1 gives ${\displaystyle C_{b}={\frac {b}{(b-1)^{2}}}-\sum _{n=1}^{\infty }\left({\frac {b^{2n}-b^{n}+1}{\left(b^{n}-1\right)^{2}}}-{\frac {b^{2n+1}-b^{n}+1}{\left(b^{n+1}-1\right)^{2}}}\right)b^{-\delta _{b}(n+1)}.}$ Observe that in the summand, the expression in parentheses is approximately ${\displaystyle {\frac {b-1}{b}}}$ for n ≥ 2 and rapidly approaches that value as n grows, while the exponent ${\displaystyle \delta _{b}(n+1)}$ grows exponentially with n. As a consequence, each additional term provides an exponentially growing number of correct digits even though the number of digits in the numerators and denominators of the fractions comprising these terms grows only linearly. For example, the first few terms of C10 are ${\displaystyle C_{10}={\frac {10}{81}}-\left[\left({\frac {91}{81}}-{\frac {991}{9801}}\right)\times 10^{-9}+\left({\frac {9901}{9801}}-{\frac {99901}{998001}}\right)\times 10^{-189}+\left({\frac {999001}{998001}}-{\frac {9999001}{99980001}}\right)\times 10^{-2889}+\ldots \right].}$

## Continued fraction expansion

The simple continued fraction expansion of Champernowne's constant does not terminate (because the constant is not rational) and is aperiodic (because it is not an irreducible quadratic). A simple continued fraction is a continued fraction where the denominator is 1. The simple continued fraction expansion of Champernowne's constant exhibits extremely large terms appearing between many small ones. For example, in base 10,

C10 = [0; 8, 9, 1, 149083, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1, 1, 1, 15, 4 57540 11139 10310 76483 64662 82429 56118 59960 39397 10457 55500 06620 04393 09026 26592 56314 93795 32077 47128 65631 38641 20937 55035 52094 60718 30899 84575 80146 98631 48833 59214 17830 10987, 6, 1, 1, ...]. (sequence A030167 in the OEIS)

The large number at position 18 has 166 digits, and the next very large term at position 40 of the continued fraction has 2504 digits. That there are such large numbers as terms of the continued fraction expansion means that the convergents obtained by stopping before these large numbers provide an exceptionally good approximation of the Champernowne constant. For example, truncating just before the 4th partial quotient, gives ${\displaystyle 10/81=\sum _{k=1}^{\infty }k/10^{k}=0.{\overline {123456790}},}$ which matches the first term in the rapidly converging series expansion of the previous section and which approximates Champernowne's constant with an error of about 1 × 10−9. Truncating just before the 18th partial quotient gives an approximation that matches the first two terms of the series, that is, the terms up to the term containing 10−9, {\displaystyle {\begin{aligned}{\frac {60499999499}{490050000000}}&=0.123456789+10^{-9}\sum _{k=10}^{\infty }k/10^{2(k-9)}=0.123456789+10^{-9}{\frac {991}{9801}}\\&=0.123456789{\overline {10111213141516171819\ldots 90919293949596979900010203040506070809}},\end{aligned}}} which approximates Champernowne's constant with error approximately 9 × 10−190.

The first and second incrementally largest terms ("high-water marks") after the initial zero are 8 and 9, respectively, and occur at positions 1 and 2. Sikora (2012) noticed that the number of digits in the high-water marks starting with the fourth display an apparent pattern.[10] Indeed, the high-water marks themselves grow doubly-exponentially, and the number of digits ${\displaystyle d_{n}}$ in the nth mark for ${\displaystyle n\geqslant 3}$ are

6, 166, 2504, 33102, 411100, 4911098, 57111096, 651111094, 7311111092, ...

whose pattern becomes obvious starting with the 6th high-water mark. The number of terms can be given by ${\displaystyle d_{n}={\frac {13-67\times 10^{n-3}}{45}}+\left(2^{n}5^{n-3}-2\right),n\in \mathbb {Z} \cap \left[3,\infty \right).}$

However, it is still unknown as to whether or not there is a way to determine where the large terms (with at least 6 digits) occur, or their values. The high-water marks themselves are located at positions

1, 2, 4, 18, 40, 162, 526, 1708, 4838, 13522, 34062, .... (sequence A143533 in the OEIS)