Seventeen or Bust (Q2519677)
Jump to navigation
Jump to search
volunteer computing project to find the smallest number k for which k2^n+1 is always composite
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Seventeen or Bust |
volunteer computing project to find the smallest number k for which k2^n+1 is always composite |
Statements
Identifiers
Sitelinks
Wikipedia(7 entries)
- dewiki Seventeen or Bust
- enwiki Seventeen or Bust
- frwiki Seventeen or Bust
- itwiki Seventeen or Bust
- nlwiki Seventeen or Bust
- ruwiki Seventeen or Bust
- zhwiki 十七或者破產