Information for "Sieve of Pritchard"

Basic information

Display titleSieve of Pritchard
Default sort keySieve of Pritchard
Page length (in bytes)37,135
Page ID18063
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorMarkjreed (talk | contribs)
Date of page creation19:09, 25 August 2022
Latest editorNig (talk | contribs)
Date of latest edit19:36, 7 March 2023
Total number of edits60
Total number of distinct authors12
Recent number of edits (within past 180 days)15
Recent number of distinct authors5

Page properties

Transcluded templates (10)

Templates used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
The Sieve of Pritchard is an algorithm for finding the prime numbers up to a given limit N, published in 1981. It considers many fewer composite numbers than the...
Information from Extension:WikiSEO