Benchmarks of small admissible tuples: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
| Line 70: | Line 70: | ||
XFX: xfxie | XFX: xfxie | ||
YTZ: Yitang Zhang | |||
Revision as of 06:43, 20 June 2013
Here is a table to fill in the best upper bounds for small admissible tuples (342~5500).
Rules
Efforts to fill in the blank fields in this table are very welcome.
Records
| [math]\displaystyle{ k_0 }[/math] | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
|---|---|---|---|---|---|---|---|---|---|---|
| 6320 | - | - | - | - | - | - | - | - | - | 60,726 (XFX-AVS) |
| 5500 | - | - | - | - | - | - | - | - | - | - |
| 5540 | - | - | - | 51,526 (AVS) | - | - | - | - | - | |
| 3400 | - | - | - | - | - | - | - | - |
Contributors
AVS: Andrew Sutherland
pedant
Scott Morrison
Wouter Castryck
XFX: xfxie
YTZ: Yitang Zhang
