Benchmarks of small admissible tuples

From Polymath1Wiki
Revision as of 07:06, 20 June 2013 by Xfxie (Talk | contribs)

Jump to: navigation, search

Here is a table to fill in the best upper bounds available for small admissible tuples (1~5500).


Rules

Efforts to fill in the blank fields in this table are very welcome. Here are the rules for the "Lucky Winner" game:

- "Winner" for each cell: You might enter each cell with a new tuple with the best upper bound and the abbreviation of your name (Your might append others' if your solution is obtained using others' work.)

- "Lucky": Your cell will be "bold" if it is picked by an angel, if you are sufficiently lucky. Your cell might be stroked through if the luck is lost (the k0 claim is retracted).

Notes:

- Thomas J Engelsma have calculated upper bounds exactly for k0 up to 342, but he did not provide his tuples. So your contribution will be shown as TJE&<Your Name>, if your provide an optimal tuple.

Records

[math]k_0[/math] 0 1 2 3 4 5 6 7 8 9
6320 - - - - - - - - - 60,726 (XFX-AVS)
5500 - - - - - - - - - -
5540 - - - 51,526 (AVS) - - - - -
3400 - - - - - 30,600 (AVS) - - -
340 - - 342 (TJE&AVS) - - - - - -

Contributors

AVS: Andrew Sutherland

pedant

Scott Morrison

TJE: Thomas J Engelsma

Wouter Castryck

XFX: xfxie

ZWS: Zhi-Wei Sun

Yitang Zhang