The set of primes: Towards an optimized algorithm, prime generation and validation, and asymptotic consequences

Gerardo Iovane

Chaos, Solitons & Fractals, 2009, vol. 41, issue 3, 1344-1352

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)∈O(n). In addition a pre-computed algorithm is also considered and its computational complexity C(n)∈O(1).

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077908002580
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:41:y:2009:i:3:p:1344-1352

DOI: 10.1016/j.chaos.2008.04.060

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().