Related papers: Simple Divisibility Rules for the 1st 1000 Prime N…
In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…
This short note provides and proves an easy algorithm to find a basic feasible solution for the Simplex Algorithm. The method uses a rule similar to Bland's rule for the initial phase of the algorithm.
This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…
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…
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…
We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…
Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…
A classical result due to Deshouillers, Dress and Tenenbaum asserts that on average the distribution of the divisors of the integers follows the arcsine law. In this paper, we investigate the distribution of smooth divisors of the integers,…
If p is a prime, then the numbers 1, 2, ..., p-1 form a group under multiplication modulo p. A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p-1 can be written as a power…
There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…
The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…
We introduce extremely symmetric primes and provide some elementary properties of these.
A distinguishing feature of certain intractable problems in prime number theory is the sparsity of the underlying sequence. Motivated by the general problem of finding primes in sparse polynomial sequences, we give an estimate for the…
For every sufficiently large integer $R$, there exists a Carmichael number with exactly $R$ prime factors.
We defined numbers of the form $p\cdot a^2$ as SP numbers (Square-Prime numbers) ($a\neq1$, $p$ prime) in 'Distribution of Square-Prime Numbers' (arXiv:2109.10238). These numbers are listed in the OEIS as A228056. Some examples of SP…
We defined numbers of the form $p\cdot a^2$ as SP numbers (Square-Prime numbers) ($a\neq1$, $p$ prime) in the paper 'Distribution of Square-Prime numbers' (arXiv:2109.10238) along with proofs on their distribution. Some examples of SP…
Recently, I have defined the so called PDF's (prime distribution factors) which govern the distribution of prime numbers of the type $p,p+a_i$ being all primes up to some number $n$. It was shown that the PDF's are expressible in terms of…
In this paper, we propose a new primality test, and then we employ this test to find a formula for {\pi} that computes the number of primes within any interval. We finally propose a new formula that computes the nth prime number as well as…