
TL;DR
This paper introduces a new method for calculating an upper bound of the Riemann-Farey sum, enhancing the accuracy or efficiency of such computations.
Contribution
It presents a novel approach to constructing upper bounds for the Riemann-Farey sum, improving upon existing methods.
Findings
New upper bound construction method demonstrated.
Improved computational efficiency shown.
Potential applications in number theory explored.
Abstract
Another approach to constructing an upper bound for the Riemann-Farey sum is described.
Click any figure to enlarge with its caption.
Figure 1
Figure 3Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications
Another Riemann-Farey Computation
Scott B. Guthery
The Riemann hypothesis is true if and only if
[TABLE]
where is the element in the Farey sequence of order and
[TABLE]
Let be sum of the terms in (1) with Farey denominator so that
[TABLE]
Figure 1 is a plot of for .
Let denote the term with numerator in so that
[TABLE]
and we note in passing that for all but small values of and ,
[TABLE]
for .
The solid line in Figure 2 is four times plotted with .
Thus, we are led to consider
[TABLE]
For , is given by
[TABLE]
Each case in (5) corresponds to a constant step size between adjacent Farey numbers of the form . This step size is the factor of in the case.
Considering the top case in equation (4), for we have in general
[TABLE]
Substituting the approximation for the totient sum and integrating from to , we have
[TABLE]
with
[TABLE]
In general, each of the terms in (1) can be represented as
[TABLE]
for and , and depending on , and .
As above, substituting the approximation for the totient sum, integrating from to for each term and then summing over the terms, we have
[TABLE]
where the constant accounts for the totient sum approximation and
[TABLE]
