Search arXivSearch

arXiv · 1906.02029

Variants of Khintchine's theorem in metric Diophantine approximation

Abstract

New results towards the Duffin-Schaeffer conjecture, which is a fundamental unsolved problem in metric number theory, have been established recently assuming extra divergence. Given a non-negative function $ψ: \mathbb{N}\to\mathbb{R}$ we denote by $W(ψ)$ the set of all $x\in\mathbb{R}$ such that $|nx-a|<ψ(n)$ for infinitely many $a,n$. Analogously, denote $W'(ψ)$ if we additionally require $a,n$ to be coprime. Aistleitner et al. [1] proved that $W'(ψ)$ is of full Lebesgue measure if there exist an $\varepsilon>0$ such that $\sum_{n=2}^\inftyψ(n)φ(n)/(n(\log n)^\varepsilon)=\infty$. This result seems to be the best one can expect from the method used. Assuming the extra divergence $\sum_{n=2}^\inftyψ(n)/(\log n)^\varepsilon=\infty$ we prove that $W(ψ)$ is of full measure. This could also be deduced from the result in [1], but we believe that our proof is of independent interest, since its method is totally different from the one in [1]. As a further application of our method, we prove that a variant of Khintchine's theorem is true without monotonicity, subject to an additional condition on the set of divisors of the support of $ψ$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laima Kaziulytė. 2019-06-11. Variants of Khintchine's theorem in metric Diophantine approximation. https://arxiv.org/abs/1906.02029

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT