Given a monotonically decreasing , Khintchine’s Theorem provides an efficient tool to decide whether, for almost every , there are infinitely many such that . The recent result of Koukoulopoulos and Maynard provides an elegant way of removing monotonicity when only counting reduced fractions. Gallagher showed a multiplicative higher-dimensional generalization to Khintchine’s Theorem, again assuming monotonicity. In this article, we prove the following Duffin-Schaeffer-type result for multiplicative approximations: For any , any function (not necessarily monotonic) and almost every , there exist infinitely many such that all coprime to , if and only if This settles a conjecture of Beresnevich, Haynes, and Velani.

生成讲解博客的中文版本

生成AI智能校验的中文版本