Lehmer sieve

Lehmer sieves are mechanical devices that implement sieves in number theory. 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 Lehmer sieve - a primitive digital computer once used for finding primes and solving simple Diophantine equations.

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.

Construction

The first Lehmer sieve in 1926 was made using bicycle chains of varying length, with rods at appropriate points in the chains. As the chains turned, the rods would close electrical switches, and when all the switches were closed simultaneously, creating a complete electrical circuit, a solution had been found. Lehmer sieves were very fast, in one particular case factoring

in 3 seconds.[1]

Built in 1932, a device using gears was shown at the Century of Progress Exposition in Chicago. These had gears representing numbers, just as the chains had before, with holes. Holes left open were the remainders sought. When the holes lined up, a light at one end of the device shone on a photocell at the other, which could stop the machine allowing for the observation of a solution. This incarnation allowed checking of five thousand combinations a second.

In 1936, a version was built using 16 mm film instead of chains, with holes in the film instead of rods. Brushes against the rollers would make electrical contact when the hole reached the top. Again, a full sequence of holes created a complete circuit, indicating a solution.

Several Lehmer sieves are on display at the Computer History Museum. Since then, the same basic idea has been used to design sieves in integrated circuits or software.

See also

References
  1. W. W. Rouse Ball (1960) Lehmer's Machine, in Mathematical Recreations and Essays, Macmillan, New York, pp 61-62.

Further reading
  • Lehmer, D. N. (1932), "Hunting big game in the theory of numbers", Scripta Mathematica, 1: 229–235.
  • Lehmer, D. H. (1928), "The mechanical combination of linear forms", American Mathematical Monthly, Mathematical Association of America, 35 (3): 114–121, doi:10.2307/2299504, JSTOR 2299504. Also online at the Antique Computer home page.
  • Beiler, Albert H. (1964), Recreations in the Theory of Numbers, Dover, chap.XX,XXI.
  • Williams, Michael R. (2002), Lehmer Sieves.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.