Difference between revisions of "Lehmer sieve"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→External links) |
Karl Jones (Talk | contribs) (→External links) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 28: | Line 28: | ||
* [https://en.wikipedia.org/wiki/Lehmer_sieve Lehmer sieve] @ Wikipedia | * [https://en.wikipedia.org/wiki/Lehmer_sieve Lehmer sieve] @ Wikipedia | ||
| + | * [http://math.stackexchange.com/questions/811476/how-does-a-lehmer-sieve-work How does a Lehmer Sieve work?] @ Mathematics StackExchange | ||
| + | |||
| + | [[Category:Algorithms]] | ||
| + | [[Category:Computer science]] | ||
| + | [[Category:Computation]] | ||
| + | [[Category:Computing]] | ||
| + | [[Category:Machines]] | ||
| + | [[Category:Mathematics]] | ||
| + | [[Category:Numbers]] | ||
Latest revision as of 17:08, 24 April 2016
Lehmer sieves are mechanical devices that implement sieves in number theory.
Description
Lehmer sieves are named for Derrick Norman Lehmer and his son Derrick Henry Lehmer.
The father was a professor of mathematics at the University of California, Berkeley at the time, and his son followed in his footsteps as a number theorist and professor at Berkeley.
A sieve in general is intended to find the numbers which are remainders when a set of numbers are divided by a second set.
Generally, they are used in finding solutions of diophantine equations or to factor numbers.
A Lehmer sieve will signal that such solutions are found in a variety of ways depending on the particular construction.
See also
- Algorithm
- Calculation
- Computer
- Diophantine equation
- History of computing
- Mathematics
- Number theory
- Prime number
- Sieves
External links
- Lehmer sieve @ Wikipedia
- How does a Lehmer Sieve work? @ Mathematics StackExchange
