Limit theorems for counting large continued fraction digits

Abstract: We establish a central limit theorem for counting large continued fraction digits

(a_{n})

, i.e. we count occurrences

a_{n} > b_{n}

, where

(b_{n})

is a sequence of positive integers. Our result improves a similar result by Philipp which additionally assumes that

b_{n}

tends to infinity. Moreover, we give a refinement of the famous Borel-Bernstein Theorem for continued fractions regarding the event that the

n

-th continued fraction digit lies infinitely often between

d_{n}

and

d_{n} (1 + 1 / c_{n})

for given sequences

(c_{n})

and

(d_{n})

. Also for these sets we obtain a central limit theorem. As an interesting side result we determine the first

p h i

-mixing coefficient for the Gauss system explicitly.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Limit theorems for counting large continued fraction digits