arXiv:1708.02874 Abstract | arXiv Analytics

arXiv:1708.02874 [math.NT]Abstract References Reviews Resources

Khintchine's Theorem with random fractions

Published 2017-08-09Version 1

We prove a version of Khintchine's Theorem for approximations by rational numbers whose numerators have been randomly chosen, and we explore the extent to which its monotonicity assumption can be removed. This leads to a natural question analogous to the Duffin-Schaeffer Conjecture in this setting, and several other related questions.

Comments: 13 pages

Categories: math.NT

Keywords: khintchines theorem, random fractions, duffin-schaeffer conjecture, monotonicity assumption, rational numbers

Related articles: Most relevant | Search more

arXiv:1909.07256 [math.NT] (Published 2019-09-16)

Approximation by random fractions

Laima Kaziulytė, Felipe A. Ramírez

arXiv:1212.5662 [math.NT] (Published 2012-12-22, updated 2016-02-21)

Khintchine's theorem on Chebyshev matrices

Nikolay G. Moshchevitin

arXiv:1305.1685 [math.NT] (Published 2013-05-08, updated 2013-09-04)

A note on the Duffin-Schaeffer conjecture with slow divergence