Related papers: Weakening the Legendre Conjecture

We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

For each prime $p$, let $n(p)$ denote the least quadratic nonresidue modulo $p$. Vinogradov conjectured that $n(p) = O(p^\eps)$ for every fixed $\eps>0$. This conjecture follows from the generalised Riemann hypothesis, and is known to hold…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

Let p be an odd prime, such that p_n<p/2<p_{n+1}, where p_n is the n-th prime. We study the following question: with what probability does there exist a prime in the interval (p, 2p_{n+1})? After the strong definition of the probability…

We give an explicit form of Ingham's Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes $x\sp{3}$ and $(x+1)\sp{3}$ if $\log\log x\ge 15$.

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…

In the present work we prove a common generalization of Maynard-Tao's recent result about consecutive bounded gaps between primes and on the Erd\H{o}s-Rankin bound about large gaps between consecutive primes. The work answers in a strong…

We compute minimal zero-free regions for the Riemann zeta-function of the Littlewood form which ensure there is always a prime between consecutive perfect $k$th powers. Our computations cover powers $k\geq 65$ and quantify how far we are…

We develop a unified density-based framework for primality, coprimality, and prime pairs, and introduce an intrinsic normalized model for prime gaps constrained by the Prime Number Theorem. Within this setting, a structural tension between…

There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…

We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…