Related papers: An Explicit Result for Primes Between Cubes

In scientific paper, we will show a proof of Legendre's conjecture based on a scheme for finding elements of "active" set ${\rm H}_{m^{4}}$ and "critical" element $C_{m^{4}}$ for number $m^{4}$ at each $m \ge 3$.

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

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…

The Prime Number Theorem asserts that the density of primes less than or equal to $N$ is asymptotically equal to $1/\log N$. The density of prime triples in coprime triples in $\mathbb{Z}^3_+$ is determined to be $3\zeta (3)/\log N$, where…

The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…

Translated from the Latin original "Facillima methodus plurimos numeros primos praemagnos inveniendi" (1778). E718 in the Enestrom index. If m is a number of the form 4k+1 and is a sum of two relatively prime squares, then it is prime if…

Let $N$ be an odd perfect number and let $a$ be its third largest prime divisor, $b$ be the second largest prime divisor, and $c$ be its largest prime divisor. We discuss steps towards obtaining a non-trivial upper bound on $a$, as well as…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

Let $M$ be a fixed positive integer. Let $(R_{j}(n))_{n\ge 1}$ be a linear recurrence sequence for every $j=0,1,\ldots, M$, and we set $f(n)=(R_0\circ \cdots \circ R_M)(n)$, where $(S\circ T)(n)= S(T(n))$. In this paper, we obtain…

We prove that there exist infinitely many consecutive zeros of the Riemann zeta-function on the critical line whose gaps are greater than $3.18$ times the average spacing. Using a modification of our method, we also show that there are even…

Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

Zhang has shown there are infinitely many intervals of bounded length containing two primes. It appears that the current techniques cannot prove that there are infinitely many intervals of bounded length containing three primes, even if…

This paper gives an explicit version of Selberg's 1943 mean-value estimate for the prime number theorem in intervals under the Riemann hypothesis. Two applications are given: for primes in short intervals, and Goldbach numbers (sums of two…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a)=ab$, $\sigma(b)=ac$, $\sigma(c)=a$. The prefix of $\mathbb{T}$ of length $n$ is denoted by $\mathbb{T}[1,n]$. The main result is threefold, we give: (1)…

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…