Hostname: page-component-77c78cf97d-cfh4f Total loading time: 0 Render date: 2026-04-23T18:02:07.064Z Has data issue: false hasContentIssue false

Some theorems in the metric theory of diophantine approximation

Published online by Cambridge University Press:  24 October 2008

Glyn Harman
Affiliation:
University College, Cardiff

Extract

An excellent introduction to the metric theory of diophantine approximation is provided by [19], where, in chapter 1·7, the reader may find a discussion of the first two problems considered in this paper. Our initial question concerns the number of solutions of the inequality

for almost all α(in the sense of Lebesgue measure on ℝ). Here ∥ ∥ denotes distance to a nearest integer, {βr}, {ar} are given sequences of reals and distinct integers respectively, and f is a function taking values in [0, ½] and with Σf(r) divergent (for convenience we write ℱ for the set of all such functions). It is reasonable to expect that, for almost all α and with some additional constraint on f, the number of solutions of (1) is asymptotically equal to

as k tends to infinity.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable