翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

GIMPS : ウィキペディア英語版
Great Internet Mersenne Prime Search


The Great Internet Mersenne Prime Search (GIMPS) is a collaborative project of volunteers who use freely available software to search for Mersenne prime numbers.
The GIMPS project was founded by George Woltman, who also wrote the software Prime95 and MPrime for the project. Scott Kurowski wrote the (PrimeNet ) Internet server that supports the research to demonstrate Entropia-distributed computing software, a company he founded in 1997. GIMPS is registered as Mersenne Research, Inc. Kurowski is Executive Vice President and board director of (Mersenne Research Inc. ) GIMPS is said to be one of the first large scale distributed computing projects over the Internet for research purposes.〔(【引用サイトリンク】url=http://boinc.berkeley.edu/trac/wiki/VolunteerComputing )
The project has found a total of fourteen Mersenne Primes , twelve of which were the largest known prime number at their respective times of discovery. The largest known prime is 257,885,161 − 1 (or M57,885,161 in short). This prime was discovered on January 25, 2013 by Curtis Cooper at the University of Central Missouri.〔(【引用サイトリンク】title=GIMPS Project Discovers Largest Known Prime Number, 257,885,161-1 )
To perform its testing, the project relies primarily on Lucas–Lehmer primality test,〔(''What are Mersenne primes? How are they useful?'' ) - GIMPS Home Page〕 an algorithm that is both specialized to testing Mersenne primes and particularly efficient on binary computer architectures. They also have a trial division phase, used to rapidly eliminate Mersenne numbers with small factors which make up a large proportion of candidates. Pollard's p - 1 algorithm is also used to search for larger factors.
==History==
The project began in early January 1996,〔(The Mersenne Newsletter, Issue #9. Retrieved 2011-10-02. )〕〔(Mersenne forum Retrieved 2011-10-02 )〕 with a program that ran on i386 computers.
The name for the project was coined by Luther Welsh, one of its earlier searchers and the discoverer of the 29th Mersenne prime.〔(The Mersenne Newsletter, Issue #9 ). Retrieved 2009-08-25.〕
Within a few months, several dozen people had joined, and over a thousand by the end of the first year.〔
Joel Armengaud, a participant, discovered the primality of M1,398,269 on November 13, 1996.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Great Internet Mersenne Prime Search」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.