Related papers: New bounds for the prime counting function \pi(x)
Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.
Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…
A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…
We obtain optimal lower bounds for moments of theta functions. On the other hand, we also get new upper bounds on individual theta values and moments of theta functions on average over primes. The upper bounds are based on bounds of…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
We analyze algorithms for computing the $n$th prime $p_n$ and establish asymptotic bounds for several approaches. Using existing results on the complexity of evaluating the prime-counting function $\pi(x)$, we show that the binary search…
I give some claims on primorial prime numbers for interested readers in number theory.
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…
We improve the unconditional explicit bounds for the error term in the prime counting function $\psi(x)$. In particular, we prove that, for all $x>2$, we have \[ \left| \psi(x)-x \right| < 9.22106 \, x \, (\log x)^{3/2}…
In this article we present recent advances on interval methods for rigorous computation of Poincar\'e maps. We also discuss the impact of choice of Poincar\'e section and coordinate system on obtained bounds for computing Poincar\'e map…
We discuss recent advances on weak forms of the Prime $k$-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes.
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
We generalize a Theorem of Ricci and count Gaussian primes $\mathfrak{p}$ with short interval restrictions on both the norm and the argument of $\mathfrak{p}$.
In this paper we establish an explicit upper bound for the first $k$-Ramanujan prime $R_1^{(k)}$ by using a recent result concerning the existence of prime numbers in small intervals.
We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…