Riesel Sieve
Riesel Sieve is a distributed computing project, running in part on the BOINC platform. Its aim is to prove that 509,203 is the smallest Riesel number, by finding a prime of the form k × 2n − 1 for all odd k smaller than 509,203.
Riesel Sieve
Riesel Sieve is a distributed computing project, running in part on the BOINC platform. Its aim is to prove that 509,203 is the smallest Riesel number, by finding a prime of the form k × 2n − 1 for all odd k smaller than 509,203.
has abstract
O Riesel-Sieve é um projeto de ...... orma BOINC. Página do projeto:
@pt
Riesel Sieve is a distributed ...... ll odd k smaller than 509,203.
@en
Riesel Sieve is een distribute ...... naar sierpinskigetallen zoekt.
@nl
Riesel Sieve（リーゼル・シーブ）とは、Berke ...... て、 k × 2n - 1 が素数となる例を探すものである。
@ja
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
719,274,965
hypernym
type
comment
O Riesel-Sieve é um projeto de ...... orma BOINC. Página do projeto:
@pt
Riesel Sieve is a distributed ...... ll odd k smaller than 509,203.
@en
Riesel Sieve is een distribute ...... naar sierpinskigetallen zoekt.
@nl
Riesel Sieve（リーゼル・シーブ）とは、Berke ...... て、 k × 2n - 1 が素数となる例を探すものである。
@ja
label
Riesel Sieve
@en
Riesel Sieve
@ja
Riesel Sieve
@nl
Riesel-Sieve
@pt