Related papers: Dynamical Sieve of Eratosthenes

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

We study the distribution of the sequence of the first $N$ elements of the discrete dynamical system generated by the M\"obius transformation $x \mapsto (\alpha x + \beta)/(\gamma x + \delta)$ over a finite field of $p$ elements at the…

A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses…

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…

In this report we present an off-the-number-line representation of the positive integers by expressing each integer by its unique prime signature as a grid point of an infinite dimensional space indexed by the prime numbers, which we term…

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…

The symbolic representation of a number should be considered as a data structure, and the choice of data structure depends on the arithmetic operations that are to be performed. Numbers are almost universally represented using position…

In 2016 Lemke Oliver and Soundararajan examined the gaps between the first hundred million primes and observed biases in their distributions modulo 10. Given our work on the evolution of the populations of various gaps across stages of…

This paper presents a new distributed approach for generating all prime numbers in a given interval of integers. From Eratosthenes, who elaborated the first prime sieve (more than 2000 years ago), to the current generation of parallel…

For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

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 present an algorithm analogous to the sieve of Eratosthenes that produces the list of twin primes. Next, we count the number of twin primes resulting from the construction with two different heuristic arguments. The first method is…

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…

An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…

We revisit the golden sieve, a self-referential deletion process on increasing sequences of positive integers introduced by the author in 2002. Applied to the natural numbers, the sieve produces the Wythoff pair as a Beatty partition. For…

We derived the sum identities for generalized harmonic and corresponding oscillatory numbers for which a sieve procedure can be applied. The obtained results enable us to understand better the properties of these numbers and their…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

In this work, we established symmetric representation of numbers where one can use any of 9 digits giving the same number. The representations of natural numbers from 0 to 1000 are given using only single digit in all the nine cases, i.e.,…

In this paper we introduce an Euclidean decomposition of elements a_n of an increasing sequence of natural numbers into weight * level + jump which we use to classify the numbers a_n either by weight or by level. We then show that this…