(Q2519677)

English

Seventeen or Bust

volunteer computing project to find the smallest number k for which k2^n+1 is always composite

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit