Related papers: Generalized Schatunowsky theorem in a weak arithme…

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…

Fix $\alpha \in (0,1/3)$. We show that, from a topological point of view, almost all sets $A\subseteq \mathbb{N}$ have the property that, if $A^\prime=A$ for all but $o(n^{\alpha})$ elements, then $A^\prime$ is not a nontrivial sumset…

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has \[ G(k)\le \lceil k(\log…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Consider a non-increasing function $\Psi$ from the positive reals to the positive reals with decay $o(1/x)$ as $x$ tends to infinity. Jarnik proved in 1930 that there exist real numbers $\zeta_{1},...,\zeta_{k}$ together with $1$ linearly…

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 Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

We say that k is a P-integer if the first phi(k) primes coprime to k form a reduced residue system modulo k. In 1980 Pomerance proved the finiteness of the set of P-integers and conjectured that 30 is the largest P-integer. We prove the…

Let $N \geq 2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. The Frobenius number of this $N$-tuple is defined to be the largest positive integer that has no representation as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…

Given relatively prime positive integers, $a_1,\ldots,a_n$, the Frobenius number is the largest integer with no representations of the form $a_1x_1+\cdots+a_nx_n$ with nonnegative integers $x_i$. This classical value has recently been…

Alpoge and Granville (separately) gave novel proofs that the primes are infinite that use Ramsey Theory. In particular, they use Van der Waerden's Theorem and some number theory. We prove the primes are infinite using an easier theorem from…

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…

It is well known that every finite simple group has a generating pair. Moreover, Guralnick and Kantor proved that every finite simple group has the stronger property, known as $\frac{3}{2}$-generation, that every nontrivial element is…

Vinogradov's three primes theorem indicates that, for every sufficiently large odd integer $N$, the equation $N=p_1+p_2+p_3$ is solvable in prime variables $p_1,p_2,p_3$. In this paper, it is proved that Vinogradov's three primes theorem…