On finite approximations for a Markoff-like chain (Q581450)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finite approximations for a Markoff-like chain |
scientific article; zbMATH DE number 4019160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finite approximations for a Markoff-like chain |
scientific article; zbMATH DE number 4019160 |
Statements
On finite approximations for a Markoff-like chain (English)
0 references
1987
0 references
Here the author proves the following statement: Theorem. Suppose \(r\geq 2\). If \(\theta \in I_ r\), and \(\theta \sim \theta_ i\) for any \(i=1,0,1,2,...,n-1\), then (i) \((\theta,A_{n,p})\) has at least p solutions in h/k, and (ii) \(A_{n,p}\) cannot be increased as \((\theta,A_{n,p})\) has exactly p solutions and the equality is attained for the p-th solution. ((\(\theta\),A) denotes the inequality \(| \theta -h/k| \leq 1/AK^ 2,\) \((h,k)=1\), \(k>0.)\)
0 references
p-approximation problems
0 references
Markoff-like chain
0 references
irrational numbers
0 references
0.93906367
0 references
0.9279394
0 references
0.92171824
0 references
0.9164563
0 references
0.9134367
0 references
0.91124153
0 references
0 references