Farey sequence and Graham's conjectures

نویسندگان

چکیده

Let Fn be the Farey sequence of order n. For S?Fn we let Q(S)={x/y:x,y?S,x?y and y?0}. We show that if Q(S)?Fn, then |S|?n+1. Moreover, prove in any following cases: (1) Q(S)=Fn; (2) Q(S)?Fn |S|=n+1, must have S={0,1,12,…,1n} or S={0,1,1n,…,n?1n} except for n=4, where an additional set {0,1,12,13,23} second case. Our results are based on Graham's GCD conjectures, which been proved by Balasubramanian Soundararajan.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Order Statistics in the Farey Sequence

We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, these algorithms require at least quadratic time, since the Farey sequence has Θ(n) elements. For the problem of finding the k-th element, we obtain an algorithm that runs in time O(n lgn) and uses space O( √ n). The sa...

متن کامل

A Farey Sequence of Fibonacci Numbers

The Farey sequence is an old and famous set of fractions associated with the integers. We here show that if we form a Farey sequence of Fibonacci Numbers, the properties of the Farey sequence are remarkably preserved (see [2]). In fact we find that with the new sequence we are able to observe and identify "points of symmetry/' "intervals," "generating fractions" and "stages." The paper is divid...

متن کامل

Distribution of Farey Fractions in Residue Classes and Lang–Trotter Conjectures on Average

We prove that the set of Farey fractions of order T , that is, the set {α/β ∈ Q : gcd(α, β) = 1, 1 ≤ α, β ≤ T}, is uniformly distributed in residue classes modulo a prime p provided T ≥ p1/2+ε for any fixed ε > 0. We apply this to obtain upper bounds for the Lang–Trotter conjectures on Frobenius traces and Frobenius fields “on average” over a one-parametric family of elliptic curves.

متن کامل

Wythoff's sequence and N-Heap Wythoff's conjectures

Define a Wythoff’s sequence as a sequence of pairs of integers {(An, Bn)}n>n0 such that there exists a finite set of integers T , An = mex({Ai, Bi : i < n}∪T ), Bn−An = n, and {Bn} ∩ T = ∅. Structural properties and behaviors of Wythoff’s sequence are investigated. The main result is that for such a sequence, there always exists an integer α such that when n is large enough, |An − bnφc − α| ≤ 1...

متن کامل

The Distribution of Special Subsets of the Farey Sequence

We will examine the subset FQ,p of Farey fractions of order Q consisting of those fractions whose denominators are not divisible by a fixed prime p. In particular, we will provide an asymptotic result on the distribution of H−tuples of consecutive fractions in FQ,p, as Q → ∞.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 2021

ISSN: ['0022-314X', '1096-1658']

DOI: https://doi.org/10.1016/j.jnt.2020.10.013