ABSTRACT
The Farey fractions of order n consist of all fractions in lowest terms lying in the closed unit interval and having denominator at most n. This article considers the products Fn of all nonzero Farey fractions of order n. It studies their size, given by log(Fn), and their divisibility properties by powers of a fixed prime, given by ordp(Fn), as a function of n. It presents evidence suggesting that information related to the Riemann hypothesis may be encoded in functions related to ordp(Fn) for a single fixed prime p. This encoding makes use of a relation of these products to the products Gn of all reduced and unreduced Farey fractions of order n, which are connected by Möbius inversion. It introduces new arithmetic functions which mix the Möbius function with functions of radix expansions to a fixed prime base p.
KEYWORDS:
2000 AMS Subject Classification:
Acknowledgments
We thank J. Arias de Reyna, R. C. Vaughan, and the two reviewers for helpful comments on this article. The first author thanks Harm Derksen for bringing up questions on Farey products, resulting in [CitationDerksen and Lagarias 11a, CitationDerksen and Lagarias 11b]. Work of H. Mehta on this project started as part of an REU program at the University of Michigan, with the first author as mentor.
Funding
Work of the first author was supported by NSF Grants DMS-1101373 and DMS-1401224.
Notes
1Here f(x) = Ω±(g(x)) means there is a positive constant such that infinitely often f(x) > c|g(x)| and infinitely often f(x) < −c|g(x)|.
2The data in seem insufficient to discriminate between growth of order N and of order NlogpN. For N = p2 − 1, the quantity logpN ≈ 2 is approximately constant.
3Here Φ∞(n) is the “replacement main term” mentioned in Sect. 1.2 and defined in (Equation5–2(5--2) ).