请输入您要查询的百科知识:

 

词条 Lehmer sieve
释义

  1. Construction

  2. See also

  3. References

  4. Further reading

  5. External links

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 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. {{CN|date=April 2015}}

See also

  • Sieve of Eratosthenes

References

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

Further reading

  • {{citation | first = D. N. | last = Lehmer | authorlink = Derrick Norman Lehmer | title = Hunting big game in the theory of numbers | journal = Scripta Mathematica | year = 1932 | volume = 1 | pages = 229–235 | url = http://ed-thelen.org/comp-hist/Lehmer-NS03.html}}.
  • {{citation | first = D. H. | last = Lehmer | authorlink = Derrick Henry Lehmer | journal = American Mathematical Monthly | title = The mechanical combination of linear forms | volume = 35 | issue = 3 | pages = 114–121 | year = 1928 | doi = 10.2307/2299504 | jstor = 2299504 | publisher = Mathematical Association of America}}. Also online at the Antique Computer home page.
  • {{citation | first = Albert H. | last = Beiler | title = Recreations in the Theory of Numbers | publisher = Dover | year = 1964}}, chap.XX,XXI.

External links

  • Lehmer sieves, by Dr. Michael R. Williams, Head Curator of The Computer History Museum
  • Lehmer sieves at Computer History Museum (at the bottom of the page)

2 : History of computing hardware|One-of-a-kind computers

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/10 17:59:19