Related papers: A new bound for the smallest $x$ with $\pi(x) > li…

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

Let $E(X)$ denote the number of even integers below $X$ which are not a sum of two primes. We prove the bound $E(X)=O(X^{\frac{7}{10}})$, where the implicit constant is ineffective. The method applied here also leads to $P(q)=O(q^5)$, where…

Let $V(T)$ denote the number of sign changes in $\psi(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq \gamma_{1}/\pi + 1.867\cdot 10^{-30}$, where $\gamma_{1} = 14.13\ldots$ denotes the ordinate of…

It is proposed that the validity, or not, of the Riemann Hypothesis might be established on the basis of the integral $$\int\frac{\xi(2s)}{\xi(s)}ds$$ where $$\xi(s)=(s-1)\pi^{-s/2}\Gamma(1+s/2)\zeta(s).$$

Robin's theorem is one of the ingenious reformulation of the Riemann hypothesis (RH). It states that the RH is true if and only if $\sigma(n)<e^\gamma n\log\log n$ for all $n>5040$ where $\sigma(n)$ is the sum of divisors of $n$ and…

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

We find the minimal non-trivial integer variable group determinant for any dihedral group of order less than $3.79\times 10^{47}$. We think of this as the Lind-Lehmer problem for the dihedral group. We give a complete description of the…

In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…

A finite horizon variant of the quickest change detection problem is studied, in which the goal is to minimize a delay threshold (latency), under constraints on the probability of false alarm and the probability that the latency is…

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 $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $\sigma_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment,…

We make explicit an argument of Heath-Brown concerning large and small gaps between nontrivial zeroes of the Riemann zeta-function, $\zeta(s)$. In particular, we provide the first unconditional results on gaps (large and small) which hold…

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

We consider in this paper the problem of sampling a high-dimensional probability distribution $\pi$ having a density with respect to the Lebesgue measure on $\mathbb{R}^d$, known up to a normalization constant $x \mapsto \pi(x)=…

In 2004, Muzereau et al. showed how to use a reduction algorithm of the discrete logarithm problem to Diffie-Hellman problem in order to estimate lower bound on Diffie-Hellman problem on elliptic curves. They presented their estimates for…

We present a new lower bound for Euler's beta function, $B(x,y)$, which states that the inequality \begin{equation*} B(x,y)>\frac{x+y}{xy}\left(1-\frac{2xy}{x+y+1}\right) \end{equation*} holds on $(0,1]\times(0,1]$, which improves a lower…

We show that the proportion of permutations of length $n$ with principal M\"{o}bius function equal to zero, $Z(n)$, is asymptotically bounded below by 0.3995. If a permutation $\pi$ contains two intervals of length 2, where one interval is…

For each $t \in \mathbf{R}$, define the entire function $$ H_t(z) := \int_0^\infty e^{tu^2} \Phi(u) \cos(zu)\ du$$ where $\Phi$ is the super-exponentially decaying function $$ \Phi(u) := \sum_{n=1}^\infty (2\pi^2 n^4 e^{9u} - 3\pi n^2…

In the paper the well known Riemann Hypothesis is proven. The proof is based on uniform approximation of the zeta function discs of the critical strip placed to the right from the critical line.The basic moment is a use of a new mesure…