Seventeen or Bust (Q2519677)

From Wikidata
Jump to: navigation, search
a distributed computing project to find the smallest number k for which k2^n+1 is always composite
    No aliases defined
[edit]
Language Label Description Also known as
English
Seventeen or Bust
a distributed computing project to find the smallest number k for which k2^n+1 is always composite

    Statements

    /m/016qqg
    1 reference
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]
    [edit]