Related papers: An elementary sieve

An open conjecture of Z.-W. Sun states that for any integer $n>1$ there is a positive integer $k\le n$ such that $\pi(kn)$ is prime, where $\pi(x)$ denotes the number of primes not exceeding $x$. In this paper, we show that for any positive…

We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…

This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…

We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

Using the sieve, we show that there are infinitely many Carmichael numbers whose prime factors all have the form $p = 1 + a^2 + b^2$ with $a,b \in{\mathbb Z}$.

A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…

Sieves are constructed for twin primes in class I, which are of the form 2m+/-D, D>=3 odd. They are characterized by their twin-D-I rank m. They have no parity problem. Non-rank numbers are identified and counted using odd primes p>=5.…

Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

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 c > 0.55. Every large n can be written in the form p +ab, where p is prime, a and b are significantly smaller than x^1/2 and ab is less than n^c. This strengthens a result of Heath-Brown, which has the requirement c>3/4. We introduce…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

An elementary method for computing various prime sequences using the sequence of Farey sequences is described.

Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…

This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…