Transcendence of the Gaussian Liouville number and relatives

arXiv0806.1694MaRDI QIDQ6209874FDOQ6209874

Authors: Peter Borwein, Michael Coons 

Publication date: 10 June 2008

Abstract: {em The Liouville number}, denoted $l$, is defined by ${\displaystyle }$l:=0.100101011101101111100...,${\displaystyle }$ where the $n$th bit is given by $1/2(1+gl(n))$; here $gl$ is the Liouville function for the parity of prime divisors of $n$. Presumably the Liouville number is transcendental, though at present, a proof is unattainable. Similarly, define {em the Gaussian Liouville number} by ${\displaystyle }$gamma:=0.110110011100100111011...${\displaystyle }$ where the $n$th bit reflects the parity of the number of rational Gaussian primes dividing $n$, 1 for even and 0 for odd. In this paper, we prove that the Gaussian Liouville number and its relatives are transcendental. One such relative is the number ${\displaystyle }$sum_{k=0}^inftyfrac{2^{3^k}}{2^{3^k2}+2^{3^k}+1}=0.101100101101100100101...,${\displaystyle }$ where the $n$th bit is determined by the parity of the number of prime divisors that are equivalent to 2 modulo 3. We use methods similar to that of Dekking's proof of the transcendence of the Thue--Morse number cite{Dek1} as well as a theorem of Mahler's cite{Mahl1}. (For completeness we provide proofs of all needed results.) This method involves proving the transcendence of formal power series arising as generating functions of completely multiplicative functions.

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Transcendence (general theory) (11J81)

This page was built for publication: Transcendence of the Gaussian Liouville number and relatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209874)