Efficient coding of approximations of real numbers
β Scribed by V. N. Krupskii
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1990
- Tongue
- English
- Weight
- 551 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively ap
Dirichlet proved that for any real irrational number ΞΎ there exist infinitely many rational numbers p/q such that |ΞΎp/q| < q -2 . The correct generalization to the case of approximation by algebraic numbers of degree n, n > 2, is still unknown. Here we prove a result which improves all previous esti
Let x be a real number in [0, 1], F n be the Farey sequence of order n and \ n (x) be the distance between x and F n . The first result concerns the average rate of approximation: The second result states that any badly approximable number is better approximable by rationals than all numbers in ave