Difference between revisions of "Benchmarks of small admissible tuples"

From Polymath1Wiki
Jump to: navigation, search
(Rules)
Line 1: Line 1:
Here is a table to fill in the best upper bounds available for small admissible tuples (342~5500).  
+
Here is a table to fill in the best upper bounds available for small admissible tuples (1~5500).  
  
  

Revision as of 06:58, 20 June 2013

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).

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) - - -

Contributors

AVS: Andrew Sutherland

pedant

Scott Morrison

Wouter Castryck

XFX: xfxie

ZWS: Zhi-Wei Sun

Yitang Zhang