The distribution of prime numbers: The solution comes from dynamical processes and genetic algorithms

In this work, we show that the set of primes can be obtained through dynamical processes. Indeed, we see that behind their generation there is an apparent stochastic process; this is obtained with the combination of two processes: a “zig-zag” between two classes of primes and an intermittent process (that is a selection rule to exclude some prime candidates of the classes). Although we start with a stochastic process, the knowledge of its inner properties in terms of zig-zagging and intermittent processes gives us a deterministic and analytic way to generate the distribution of prime numbers. Thanks to genetic algorithms and evolution systems, as we will see, we answer some of most relevant questions of the last two centuries, that is “How can we know a priori if a number is prime or not? Or similarly, does the generation of number primes follow a specific rule and if yes what is its form? Moreover, has it a deterministic or stochastic form?” To reach these results we start to analyze prime numbers by using binary representation and building a hierarchy among derivative classes. We obtain for the first time an explicit relation for generating the full set Pn of prime numbers smaller than n or equal to n.