相关论文: On the Prime Numbers in the Interval [4n,5n]

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 $n \in \mathbb{Z}_{\geqslant 2}$. By $P(n)$ we denote the set of all prime divisors of the integers in the sequence $n, n^2-1, (n^2-1)^2-1, \dots$. We ask whether the set $P(n)$ determines $n$ uniquely under the assumption that $n \neq…

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.…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

We present tables of record (maximal) gaps between densest prime constellations, or k-tuplets. The tables contain all maximal gaps between prime k-tuplets up to 10^15, for each k<=7.

For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively…

The main result of the paper is that assuming that the level $\theta$ of distribution of primes exceeds 1/2, then there exists a positive $d\leq C(\theta)$ such that there are arbitrarily long arithmetic progressions with the property that…

Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2…

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}.…

With the formula of Gandhi you can determine the on $p_n$ immedately subsequent prime $p_{n+1}$ from the knowledge of the primes $p_1, p_2, ... , p_n$. An elementary proof of its trueness will be detailed shown in this paper. Finally the…

A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

Prime numbers, whose properties are important subjects in mathematics, are also fundamental in computer science notably in IT security, Cryptocurrencies as Bitcoin and Blockchain, cryptography, Code theory notably Error detection codes,…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

The prime number 357686312646216567629137 is notable because of the unusual property that it remains prime successively on removing the left digit until there are no remaining digits. We explore here the distributions of the number of left…