By the same authors

Predicting prime numbers using Cartesian Genetic Programming

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publicationGenetic Programming, Proceedings
DatePublished - 2007
Pages205-216
Number of pages12
PublisherSPRINGER-VERLAG BERLIN
Place of PublicationBERLIN
EditorsM ONeill, A Ekart, L Vanneschi, AI EsparciaAlcazar
Original languageEnglish
ISBN (Print)978-3-540-71602-0

Abstract

Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formulae. The second uses multi-chromosome CGP to evolve a digital circuit, which represents a polynomial. We evolved polynomials that can generate 43 primes in a row. We also found functions capable of producing the first 40 consecutive prime numbers, and a number of digital circuits capable of predicting up to 208 consecutive prime numbers, given consecutive input values. Many of the formulae have been previously unknown.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations