Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Sieve theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Ways to estimate the size of sifted sets of integers}} '''Sieve theory''' is a set of general techniques in [[number theory]], designed to count, or more realistically to estimate the size of, '''sifted sets''' of integers. The prototypical example of a sifted set is the set of [[prime number]]s up to some prescribed limit ''X''. Correspondingly, the prototypical example of a sieve is the [[sieve of Eratosthenes]], or the more general [[Legendre sieve]]. The direct attack on prime numbers using these methods soon reaches apparently insuperable obstacles, in the way of the accumulation of error terms.{{Citation needed|date=May 2018}} In one of the major strands of number theory in the twentieth century, ways were found of avoiding some of the difficulties of a frontal attack with a naive idea of what sieving should be.{{Citation needed|date=May 2018}} One successful approach is to approximate a specific sifted set of numbers (e.g. the set of prime numbers) by another, simpler set (e.g. the set of [[almost prime]] numbers), which is typically somewhat larger than the original set, and easier to analyze. More sophisticated sieves also do not work directly with sets ''per se'', but instead count them according to carefully chosen [[weight function]]s on these sets (options for giving some elements of these sets more "weight" than others). Furthermore, in some modern applications, sieves are used not to estimate the size of a sifted set, but to produce a function that is large on the set and mostly small outside it, while being easier to analyze than the [[Indicator function|characteristic function]] of the set. The term ''sieve'' was first used by the [[Norway|Norwegian]] mathematician [[Viggo Brun]] in 1915.<ref>{{cite journal|first=Viggo |last=Brun |date=1915 |journal=Archiv for Math. Naturvidenskab |title=Γber das Goldbachsche Gesetz und die Anzahl der Primzahlpaare |volume=34}}</ref> However Brun's work was inspired by the works of the [[France|French]] mathematician [[Jean Merlin]] who died in the [[World War I]] and only two of his manuscripts survived.<ref>{{cite book |first1=Alina Carmen |last1=Cojocaru |first2=M. Ram |last2=Murty |title=An Introduction to Sieve Methods and Their Applications |publisher=Cambridge University Press |doi=10.1017/CBO9780511615993 |date=2005|isbn=978-0-521-84816-9 }}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)