Dynamical Sieve of Eratosthenes

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. Moreover, this dynamical prime number function is then modified to zero-cross only odd composite numbers from odd primes, in order to attack the weak Goldbach conjecture in a non-conventional way, which do not rely directly in trying to add prime numbers. Instead, the main goal is to depict the set of odd numbers bigger than one, with the set of odd primes. Thus, by representing the set of odd numbers bigger than one, every combinatorial sum of three odd prime numbers will result in every odd number bigger than 7