System of inequalities in continued fractions from finite alphabets (Q2690980)

Let \(A \subseteq \mathbb{N}\) be an arbitrary finite alphabet fixed. To any word in the alphabet \(A\) uniquely corresponds a finite continued fraction \[ [d_1,d_2,\ldots, d_k]=\cfrac{1}{d_1+\cfrac{1}{d_2+\genfrac{}{}{0pt}{0}{}{ \ddots+\cfrac{1}{d_k}}}}. \] Let \(\mathfrak{R}_A\) be a set of irreducible rational fractions \(y/Y\) expressible as finite continued fractions in the alphabet \(A\). Given a positive integer \(P\), real positive numbers \(a,\) \(p\) and \(\psi_1, \psi_2 \in [0,1]\), let \(\varepsilon_1,\varepsilon_2 \in [0,1]\) be arbitrary real numbers. Let \(T^{\varepsilon_1,\varepsilon_2}_{p,a,A}\) be the number of solutions of the system of two inequalities \[ \left|\frac{y}{Y}-\psi_1\right|\leq \varepsilon_1, \] \[ \Big|\Big|a \frac{y}{Y}-\psi_2 \Big|\Big|\leq \varepsilon_2 \] in the integer variables \(Y\) and \(y\) from the intervals \([p,P]\) and \([1,P]\), under the condition that the fraction \(y/Y\) belongs to the set \(\mathfrak{R}_a\). An upper bound for \(T^{\varepsilon_1,\varepsilon_2}_{p,a,A}\) under certain restrictions on \(P\), \(p\) and \(a\) is obtained in the paper. Two theorems are proven.