Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0511358

On the Farey fractions with denominators in arithmetic progression

Cristian Cobeli·Alexandru Zaharescu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $F_Q$ be the set of Farey fractions of order $Q$. Given the integers $\d\ge 2$ and $0\le \c \le \d-1$, let $F_Q(c,d)$ be the subset of $F_Q$ of those fractions whose denominators are $\equiv c \pmod d$, arranged in ascending order. The problem we address here is to show that as $Q\to\infty$, there exists a limit probability measuring the distribution of $s$-tuples of consecutive denominators of fractions in $F_Q(c,d)$. This shows that the clusters of points $(q_0/Q,q_1/Q,...,q_s/Q)\in[0,1]^{s+1}$, where $q_0,q_1,...,q_s$ are consecutive denominators of members of $F_Q$ produce a limit set, denoted by $D(c,d)$. The shape and the structure of this set are presented in several particular cases.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cristian Cobeli, Alexandru Zaharescu. 2005-11-14. On the Farey fractions with denominators in arithmetic progression. https://arxiv.org/abs/math/0511358

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗