Related papers: A New Strategy for Riemann Hypothesis

We present an elementary proof of the prime number theorem. The relative error follows a golden ratio scaling law and respects the bound obtained from the Riemann's hypothesis. The proof is derived in the framework of a scale free…

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

We use the Prime Number Theorem to prove the existence of zero-free strips for the Riemann-zeta function. Precisely, we prove that there exists $\delta>0$ for which if $0\leq r<\delta $ then $\zeta(s)\neq 0$ for Re$(s)>1-r$.

Of what use are the zeros of the Riemann zeta function? We can use sums involving zeta zeros to count the primes up to $x$. Perron's formula leads to sums over zeta zeros that can count the squarefree integers up to $x$, or tally Euler's…

A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $\Gamma_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$…

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

The equality between the number of odd spin structures on a Riemann surface of genus g, with $2^g - 1$ being a Mersenne prime, and the even perfect numbers, is an indication that the action of the modular group on the set of spin structures…

For a positive integer t>1, an integer N is called t-free if the exponent of any prime factor of N is less than t. Some works shown if N is t-free, then N satisfies Robin's inequality, for t=5, 7, 11, 16. This article shows that the…

In a recent article a breakthrough was made in quantum computer science which established the existence of a phenomenon commonly known as $\mathsf{MIP}^\ast = \mathsf{RE}$. We show that the existence of this phenomenon implies that the…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.

The Riemann Hypothesis states that the Riemann zeta function $\zeta(z)$ admits a set of ``non-trivial'' zeros that are complex numbers supposed to have real part $1/2$. Their distribution on the complex plane is thought to be the key to…

A positive square-free integer is called a \textit{congruent number} if it arises as the area of a right triangle with rational side lengths. Let $ n = p_1p_2 \cdots p_t q $ be a square-free integer, where each $ p_i \equiv 1 \pmod{8} $ and…

We present an algorithm, based on the explicit formula for $L$-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically…

In this paper a new integral for the remainder of $\pi(x)$ is obtained. It is proved that there is an infinite set of the formulae containing miscellaneous parts of this integral.

The Riemann hypothesis, stating that the real part of all non-trivial zero points fo the zeta function must be $\frac{1}{2}$, is one of the most important unproven hypothesises in number theory. In this paper we will proof the Riemann…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

The Riemann hypothesis states that all nontrivial zeros of the zeta function lie on the critical line $\Re(s)=1/2$. Hilbert and P\'olya suggested a possible approach to prove it, based on spectral theory. Within this context, some authors…