Starting from the result that the prime distribution is deterministic, we show in its maximal reduced form, the set of prime numbers P. This set can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The asymptotic behaviour is considered too. We go head towards an optimized algorithm to generate primes, whose computational complexity is C(n) is an element of O(n). In addition a pre-computed algorithm is also considered and its computational complexity C(n) is an element of O(1).
The Set of Primes: Towards an Optimized Algorithm, Prime Generation and Validation, and asymptotic consequences
IOVANE, Gerardo
2009-01-01
Abstract
Starting from the result that the prime distribution is deterministic, we show in its maximal reduced form, the set of prime numbers P. This set can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The asymptotic behaviour is considered too. We go head towards an optimized algorithm to generate primes, whose computational complexity is C(n) is an element of O(n). In addition a pre-computed algorithm is also considered and its computational complexity C(n) is an element of O(1).File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
