Related papers: The $k$-Tuple Jumping Champions among Consecutive …

A distinguishing $r$-labeling of a digraph $G$ is a mapping $\lambda$ from the set of verticesof $G$ to the set of labels $\{1,\dots,r\}$ such that no nontrivial automorphism of $G$ preserves all the labels.The distinguishing number $D(G)$…

Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teuli\'e asked whether $\inf_{q \ge 1} \, q \cdot || q \alpha || \cdot |…

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) =…

We show that the Gaussian primes $P[i] \subseteq \Z[i]$ contain infinitely constellations of any prescribed shape and orientation. More precisely, given any distinct Gaussian integers $v_0,...,v_{k-1}$, we show that there are infinitely…

We study two kinds of conjectural bounds for the prime gap after the k-th prime $p_k$: (A) $p_{k+1} < (p_k)^{1+1/k}$ and (B) $p_{k+1}-p_k < \log^2 p_k - \log p_k - b$ for $k>9$. The upper bound (A) is equivalent to Firoozbakht's conjecture.…

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

We introduce and study the notion of k-divisible elements in a non-commutative probability space. A k-divisible element is a (non-commutative) random variable whose n-th moment vanishes whenever n is not a multiple of k. First, we consider…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

Let $q>r\ge1$ be coprime integers. Let ${\mathbb P}_c={\mathbb P}_c(q,r,{\cal H})$ be an increasing sequence of primes $p$ satisfying two conditions: (i) $p\equiv r$ (mod $q$) and (ii) $p$ starts a prime $k$-tuple with a given pattern…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…

We discuss recent advances on weak forms of the Prime $k$-tuple Conjecture, and its role in proving new estimates for the existence of small gaps between primes and the existence of large gaps between primes.

We prove the following function field analog of the Hardy-Littlewood conjecture (which generalizes the twin prime conjecture) over large finite fields. Let n,r be positive integers and q an odd prime power. For distinct polynomials a_1,…

We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class superhigh$^\Diamond$, and show that it contains some,…

The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of…

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…