Related papers: On prime vs. prime power pairs

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

In the paper are proved theorems, which amplify the results of my paper "On the difference equation of Poincare type (Part 3)", Max-Plank-Institut fuer Mathematik, Bonn, Preprint Series, 2004, 09, 1-34.

Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

Let $S_{(x,y]} = \left\{\frac{p_n}{p_{n+1}-2} :~ n\in I \right\}$, where $I = \left\{n :~ x<p_n \le y \right\}$, $p_n$ is the $n$-th prime and $x, y \in \mathbb{R}_{>0}$. If $M_\alpha(x,y)$ denotes the $\alpha$-power mean of the elements of…

This study is motivated by a series of recent papers that show that, if a given deterministic sequence in the unit interval has a Poisson pair correlation function, then the sequence is uniformly distributed. Analogous results have been…

We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.

Paired comparison models, such as the Bradley-Terry (1952) model and its variants, are commonly used to measure competitor strength in games and sports. Extensions have been proposed to account for order effects (e.g., home-field advantage)…

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

Several examples of generalized number systems are constructed to compare various conditions occurring in the literature for the prime number theorem in the context of Beurling generalized primes.

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

We proved that there are infinitely many pairs of twin prime.

This note highlights an interesting connection between Euler sums of even weight and prime numbers.

We study whether several consecutive prime gaps can all be relatively large at the same time, or is it possible that all are squares or perfect powers, or perhaps none of them are squares? A few related results and problems are also…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Given $m, n, q\in \mathbb{N}$ such that $q$ is a prime power and $m\geq 3$, $a\in \mathbb{F}_q$, we establish a sufficient condition for the existence of primitive pair $(\alpha, f(\alpha))$ in $\mathbb{F}_{q^m}$ such that $\alpha$ is…

We consider the problem of testing whether pairs of univariate random variables are associated. Few tests of independence exist that are consistent against all dependent alternatives and are distribution free. We propose novel tests that…