Computing π(x): the combinatorial method

Bibliographic Details
Main Author: Silva, Tomás Oliveira e
Publication Date: 2006
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://proa.ua.pt/index.php/revdeti/article/view/17298
Summary: This article presents a self-contained description of the method proposed by Deléglise and Rivat — which has roots on earlier work by Meissel, by Lehmer, and by Lagarias, Miller and Odlyzko—to compute π(x), which is the number of primes not larger than x. To make life easier to programmers, the major parts of the computation of π(x) are also presented in algorithmic form. The more interesting low-level computational details are presented in the form of of C code snippets.
id RCAP_0ac25f32d270155eb62b5b14b766f70b
oai_identifier_str oai:proa.ua.pt:article/17298
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Computing π(x): the combinatorial methodThis article presents a self-contained description of the method proposed by Deléglise and Rivat — which has roots on earlier work by Meissel, by Lehmer, and by Lagarias, Miller and Odlyzko—to compute π(x), which is the number of primes not larger than x. To make life easier to programmers, the major parts of the computation of π(x) are also presented in algorithmic form. The more interesting low-level computational details are presented in the form of of C code snippets.Este artigo descreve detalhadamente o método proposto por Deléglise e Rivat — que é baseado em trabalhos anteriores de Meissel, de Lehmer, e de Lagarias, Miller e Odlyzko — para calcular π(x), que é o número de números primos até x.UA Editora2006-01-01T00:00:00Zjournal articleinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://proa.ua.pt/index.php/revdeti/article/view/17298oai:proa.ua.pt:article/17298Eletrónica e Telecomunicações; Vol 4 No 6 (2006); 759-768Eletrónica e Telecomunicações; vol. 4 n.º 6 (2006); 759-7682182-97721645-0493reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAPenghttps://proa.ua.pt/index.php/revdeti/article/view/17298https://proa.ua.pt/index.php/revdeti/article/view/17298/12327Silva, Tomás Oliveira einfo:eu-repo/semantics/openAccess2022-09-26T11:00:12Zoai:proa.ua.pt:article/17298Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T10:29:12.961649Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Computing π(x): the combinatorial method
title Computing π(x): the combinatorial method
spellingShingle Computing π(x): the combinatorial method
Silva, Tomás Oliveira e
title_short Computing π(x): the combinatorial method
title_full Computing π(x): the combinatorial method
title_fullStr Computing π(x): the combinatorial method
title_full_unstemmed Computing π(x): the combinatorial method
title_sort Computing π(x): the combinatorial method
author Silva, Tomás Oliveira e
author_facet Silva, Tomás Oliveira e
author_role author
dc.contributor.author.fl_str_mv Silva, Tomás Oliveira e
description This article presents a self-contained description of the method proposed by Deléglise and Rivat — which has roots on earlier work by Meissel, by Lehmer, and by Lagarias, Miller and Odlyzko—to compute π(x), which is the number of primes not larger than x. To make life easier to programmers, the major parts of the computation of π(x) are also presented in algorithmic form. The more interesting low-level computational details are presented in the form of of C code snippets.
publishDate 2006
dc.date.none.fl_str_mv 2006-01-01T00:00:00Z
dc.type.driver.fl_str_mv journal article
info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://proa.ua.pt/index.php/revdeti/article/view/17298
oai:proa.ua.pt:article/17298
url https://proa.ua.pt/index.php/revdeti/article/view/17298
identifier_str_mv oai:proa.ua.pt:article/17298
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://proa.ua.pt/index.php/revdeti/article/view/17298
https://proa.ua.pt/index.php/revdeti/article/view/17298/12327
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv UA Editora
publisher.none.fl_str_mv UA Editora
dc.source.none.fl_str_mv Eletrónica e Telecomunicações; Vol 4 No 6 (2006); 759-768
Eletrónica e Telecomunicações; vol. 4 n.º 6 (2006); 759-768
2182-9772
1645-0493
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833590906627817472