##
**Metric number theory.**
*(English)*
Zbl 1081.11057

London Mathematical Society Monographs. New Series 18. Oxford: Clarendon Press (ISBN 0-19-850083-1/hbk). xviii, 297 p. (1998).

The book deals with properties of real numbers and with properties of \(k\)-tuples of real numbers which are not necessarily valid for all numbers (or \(k\)-tuples) but for “almost all” in some sense. The first result in this area was a now classical theorem of Borel, stating the following: Let \(t\in [0,1)\), \(q\in \mathbb Z^+\), \(q\geq 2\). We have the \(q\)-adic expansion of \(t\): \(t= \sum c_k(t) q^{-k}\), where for each \(k\), \(c_k(t)\) is one of the numbers \(0,1,\dots, q-1\). If we exclude the possibility \(c_k(t)= q-1\) for all sufficiently large \(k\), the representation is unique. For \(j= 0,1\dots, q-1\), denote \(N_{n,j}(t)= \#\{1\leq k\leq n\); \(c_k(t)=j\}\). Then we have for almost all \(t\) (that is, for all \(t\), except possibly a set of Lebesgue-measure 0) \(N_{n,j}(t)= \frac{m}{q} (1+o(1))\) as \(n\to\infty\). Since the \(c_k(t)\)’s are mutually independent random variables, the above result is a consequence of the strong law of large numbers. Since \(q\) can be replaced by any power of \(q\) and the \(m\)th power of \(q\) corresponds to a configuration of \(m\) digits, Borel’s theorem also states that for almost all \(t\), each configuration of \(m\) digits occur with the same asymptotic relative frequency \(1/q^m\).

The first chapter deals with the above theorem and with the presentation of tools of probability theory needed for the sequel. The next chapter considers Diophantine approximation. After proving the classical Dirichlet theorem and mentioning Hurwitz’ improvement, the author discusses Khintchine’s theorem, according to which for monotonically decreasing \(x\psi(x)\) the necessary and sufficient condition for the infinitely many times sovlability of \((*)\) \(|\alpha-m/n|< \psi(n)/n\) for almost all \(\alpha\) is the divergence of the series \(\sum\psi(n)\). One can ask about the condition for the solvability of \((*)\), if the monotonicity of \(x\psi(x)\) is relaxed. A still open conjecture of Duffin and Schaeffer is that for the solvability of \((*)\) the divergence of the series \(\sum\psi(n) \varphi(n)/n\) suffices. (Here \(\varphi(\cdot)\) is the Euler function.) Relaxations of the original monotonicity restriction are proved by several authors. The proofs are based on probability theory (the 0 or 1 law, Borel-Cantelli lemma, estimates of certain subintervals of \([0,1)\)).

Chatper 3 considers inhomogeneous Diophantine approximation in a slightly more general form, namely, the number of the solutions for almost all \(\alpha\) of the inequality \(\|\alpha a_n+\beta_n\|< f(n)\), where \(a_n\in \mathbb Z^+\), \(b_n\in \mathbb R\), and \(f(n)\geq 0\), \(\sum f(n)=\infty\). Chapter 4 is devoted to the homogeneous problem having applications to the metrical theory of continued fractions and Chapter 5 to uniform distribution. The very interesting book concludes with the discussion of the Hausdorff dimensions of the occurring exceptional sets.

The first chapter deals with the above theorem and with the presentation of tools of probability theory needed for the sequel. The next chapter considers Diophantine approximation. After proving the classical Dirichlet theorem and mentioning Hurwitz’ improvement, the author discusses Khintchine’s theorem, according to which for monotonically decreasing \(x\psi(x)\) the necessary and sufficient condition for the infinitely many times sovlability of \((*)\) \(|\alpha-m/n|< \psi(n)/n\) for almost all \(\alpha\) is the divergence of the series \(\sum\psi(n)\). One can ask about the condition for the solvability of \((*)\), if the monotonicity of \(x\psi(x)\) is relaxed. A still open conjecture of Duffin and Schaeffer is that for the solvability of \((*)\) the divergence of the series \(\sum\psi(n) \varphi(n)/n\) suffices. (Here \(\varphi(\cdot)\) is the Euler function.) Relaxations of the original monotonicity restriction are proved by several authors. The proofs are based on probability theory (the 0 or 1 law, Borel-Cantelli lemma, estimates of certain subintervals of \([0,1)\)).

Chatper 3 considers inhomogeneous Diophantine approximation in a slightly more general form, namely, the number of the solutions for almost all \(\alpha\) of the inequality \(\|\alpha a_n+\beta_n\|< f(n)\), where \(a_n\in \mathbb Z^+\), \(b_n\in \mathbb R\), and \(f(n)\geq 0\), \(\sum f(n)=\infty\). Chapter 4 is devoted to the homogeneous problem having applications to the metrical theory of continued fractions and Chapter 5 to uniform distribution. The very interesting book concludes with the discussion of the Hausdorff dimensions of the occurring exceptional sets.

Reviewer: Peter Szüsz (Glen)

### MSC:

11K60 | Diophantine approximation in probabilistic number theory |

11-02 | Research exposition (monographs, survey articles) pertaining to number theory |

11J83 | Metric theory |

11Jxx | Diophantine approximation, transcendental number theory |

11J71 | Distribution modulo one |

11K55 | Metric theory of other algorithms and expansions; measure and Hausdorff dimension |

11K50 | Metric theory of continued fractions |