相关论文: A Riemann-Farey Computation

I describe the use of NMR experiments which implement Gauss sums as a method for factoring numbers and discuss whether this approach can be computationally useful.

This article establishes a new upper bound on the function $\sigma^{*}(n)$, the sum of all coprime divisors of $n$. The article concludes with two questions concerning this function.

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.

In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.

In this work we consider sums of primes that converging very slow. We set as a base, a reformulation of analytic prime number theorem and we use the values of Riemann Zeta function for the approximation. We also give the truncation error of…

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

Riemann sums, a classical method for approximating the definite integral of a function, have been extensively studied in the past. However, their monotonic properties, while still of great importance, particularly in approximation theory…

A systematic method of summing the corrections to the renormalon residue arising from higher order renormalons is discussed.

We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.

We introduce a new criterion which if satisfied implies the Riemann hypothesis.

We give an elementary proof for new strict upper and lower bounds for the correction term in Ramanujan's approximation for the factorial function

We introduce an explicit formula for a reciprocal sum related to the Riemann zeta function at s=6, and pose one question related to a computational formula for larger values of s.

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…

In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals

We develop approximations for the Riemann zeta function that enable high-precision computation within the critical strip and other vertical strips. These approximations combine the main sum of the Riemann-Siegel formula with a simple…

Let $X$ be a smooth projective variety defined over a number field $K$. We give an upper bound for the generalized greatest common divisor of a point $x\in X$ with respect to an irreducible subvariety $Y\subseteq X$ also defined over $K$.…

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…