This 1964 paper developed as an off-shoot to the foundational query: Do we discover the natural numbers (Platonically), or do we construct them linguistically? The paper also assumes computational significance in the light of Agrawal, Kayal and Saxena's August 2000 paper, "PRIMES is in P", since both the TRIM and Compact Number Generating algorithms - each of which generates all the primes - are deterministic algorithms that run in polynomial time and suggest that the Prime Difference, d(n), is O(Number of primes < (p(n)^1/2)).
Using a sieve procedure akin to the sieve of Eratosthenes we show how for each prime $p$ to build the corresponding Möbius prime-function, which in the limit of infinitely large primes becomes identical to the original Möbius function. Discussing this limit we present two simple proofs of the Prime Number Theorem. In the framework of this approach we give several proofs of the infinitude of primes.
We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.
We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. , remove out the multiple and the multiple of a prime and $-2$ simultaneously, we get all the prime twins and prove that infinitely many prime twins exist under suitable conditions. Finally, with special 4 sieve, we prove that infinitely many prime twins exist without any restriction.
In this document, prime numbers are related as functions over time, mimicking the Sieve of Eratosthenes. For this purpose, the mathematical representation is a uni-dimentional time line depicting the number line for positive natural numbers N, where each number n represents a time t. In the same way as the Eratosthenes' sieve, which iteratively mark as composite the multiples of each prime, starting at each prime. This dynamical prime number function P(s) zero-cross all composite numbers departing from primes, following a linear progression over time.
A sieve is constructed for ordinary twin primes of the form 6m+/-1 that are characterized by their twin rank m. It has no parity problem. Non-rank numbers are identified and counted using odd primes p>=5. Twin- and non-ranks make up the set of positive integers. Regularities of non-ranks allow gathering information on them to obtain a Legendre-type formula for the number of twin-ranks near primorial arguments.
Here we demonstrate a sieve for analysing primes and their composites, using equivalence classes based on the modulo 6 return value as applied to the Natural numbers. Five features of this 'Hexile' sieve are reviewed. The first aspect, is that it narrows the search for primes to one-third of the Natural numbers. The second feature is that we can obtain from the equivalence class formulae, a property of its diophantine equations to distinguish between primes and composites resulting from multiplication of these primes. Thirdly we can from these diophantine formulations ascribe a non-random occu…
This paper analyzes the emergence and distribution of potential twin primes, pairs of integers that are both relatively prime to the first n primes or to a given set M of primes, and which are the breeding grounds of true twin primes. It describes cyclical patterns of their location across the number line and provides a formula for counting them.
This paper proposes, and demonstrates the efficacy of, an elementary method for establishing a lower bound for cardinalities of selected sets of twin primes, and shows that the proof employed may be modified for selected sets of Goldbach pairs. Our sieve method is centred on the restrictive properties of intervals, specifically regarding divisibility distributions. We implicitly use the Chinese Remainder Theorem by way of the use of the midpoint in our intervals, and consider the sieve of Eratosthenes in such a way as to find a set of primes whose distribution is mirror-symmetrical about that …
In this paper we review the properties of families of numbers of the form $6n\pm1$, with $n$ integer (in which there are all prime numbers greater than 3 and other compound numbers with particular properties) to later use them in a new sieve that allows the separation of numbers $n$ that generate primes from those that only generate compounds. In principle, this can be used to find the amount of prime numbers up to a given number $h$; this means, $π(h)$.
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We generalize these results to numbers that are relatively prime to arbitrary sets of prime numbers and derive additional insights about the distribution of integers counted by Euler's phi-function.
In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete list of primes of absolute value greater than 3 in the interval of interest. This algorithm avoids the problem of generating large lists of numbers, and can be used to compute (even in parallel) the prime counting function $π(h)$.
Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves computational time by a constant. We then apply similar techniques to Atkin prime-numbers sieve which uses modulus operations and finally to Pritchard wheel sieve, in both case yielding similar results.
In the course of studies of the measure of chaos for the distribution of the prime numbers among the positive integers N arched structures have been found. It is given a brief description of the fine structure of the positive integers sequence, including the distribution of the prime numbers. A new non-Eratostenian sieve was built to demonstrate the multi-periodicity in the structure of the positive integers sequence. This sieve presents an infinite triangular matrix, which is named by us as R-matrix (Russian matrix). The simple deterministic equations for prime numbers and the main term of as…
Let $\big(\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\big)_{n=1}^\infty$ be a sequence of the largest possible integer intervals, such that $z\in\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\subset\overline{\mathcal{M}}_n^{α,κ,\mathfrak{r}}=\bigcup_{i=1}^n [\mathfrak{r}_i]_{\mathfrak{p}_i}$ or $\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)=\emptyset$, where $\mathfrak{p}_i=p_{α+\left\lceil i/κ\right\rceil-1}$ and $z\in\mathbb{Z}$. We prove that $\big(\#\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\big)_{n=1}^\infty$ oscillates infinitely many times around $β_n\!=\!o\left(n^2\right)$ for any fixed $α\in\mathbb{Z}^+$, $κ\in\mathbb{Z…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues, exponents, sieves, pseudo-primes/squares/cubes/factorials, almost primes, mobile periodicals, functions, tables, prime/square/factorial bases, generalized factorials, generalized palindromes, etc.).
