Related papers: Wright's Fourth Prime

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Let $\Bbb Z$ be the set of integers, and let $(m,n)$ be the greatest common divisor of integers $m$ and $n$. Let $p\equiv 1\mod 4$ be a prime, $q\in\Bbb Z$, $2\nmid q$ and $p=c^2+d^2=x^2+qy^2$ with $c,d,x,y\in\Bbb Z$ and $c\e 1\mod 4$.…

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

Can one find an integer $g$ and a polynomial $f$, such that $g$ is a primitive root for many consecutive (different) prime values assumed by $f$? Moree considered this problem in 2007 with computational assistence from Gallot and…

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

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…

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

The well-known Lagrange's four-square theorem states that any integer $n\in\mathbb{N}=\{0,1,2,...\}$ can be written as the sum of four squares. Recently, Z.-W. Sun investigated the representations of $n$ as $x^2+y^2+z^2+w^2$ with certain…

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…

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…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

We present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

The Piatetski-Shapiro sequences are of the form $\mathcal{N}_{c} := (\lfloor n^{c} \rfloor)_{n=1}^\infty$, where $\lfloor \cdot \rfloor$ is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro…