Sieve of Pritchard
id:
sieve-of-pritchard-173-2854474
title:
Sieve of Pritchard
text:
In mathematics, the sieve of Pritchard is an algorithm for finding all prime numbers up to a specified bound.
Like the ancient sieve of Eratosthenes, it has a simple conceptual basis in number theory.
It is especially suited to quick hand computation for small bounds. Whereas the sieve of Eratosthenes marks off each non-prime for each of its prime factors, the sieve of Pritchard avoids considering almost all non-prime numbers by building progressively larger wheels, which represent the pattern o
brand slug:
wiki
category slug:
encyclopedia
description:
An algorithm for generating prime numbers
original url:
https://en.wikipedia.org/wiki/Sieve_of_Pritchard
date created:
2022-05-26T07:04:45Z
date modified:
2024-09-02T03:02:26Z
main entity:
{"identifier":"Q112623438","url":"https://www.wikidata.org/entity/Q112623438"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b4/Sieve_of_Pritchard_animation.gif","width":425,"height":350}
fields total:
13
integrity:
16