ElevenSmooth Налаштування

[nikelong]

ElevenSmooth
http://home.earthlink.net/~elevensmooth/

 

http://www.rechenkraft.net/wiki/index.php?title=ElevenSmooth

Це повідомлення відредагував nikelong: Mar 9 2009, 18:20

[Death]

Ищут неизвестные ранее простые делители для числа 2^3,326,400-1.

ElevenSmooth is a distributed computing project searching for prime factors of M(3326400).

Mersenne numbers, numbers of the form 2n-1, are named for the French mathematician

Marin Mersenne (1588-1648).

Prime factors of Mersenne numbers are occasionally useful to mathematicians.
For example, NFSNET factored M(713)=2^713-1 to help in Richard Brent and Paul Zimmerman's
research into primitive trinomials.
Primitive trinomials have applications in cryptography, coding theory, and random number generation.

Factors of Mersenne numbers are also central to the study of covering sets for Sierpinski, Riesel, and Brier numbers.

The Cunningham Project has been collecting Mersenne factors (and other factors) since 1925.

There is enough interest in Mersenne factors that Will Edgington updates the file of known factors every few weeks on his web site.