Benchmarks of small admissible tuples

From Polymath Wiki
Revision as of 05:11, 20 June 2013 by Xfxie (talk | contribs) (New page: Here is a table to fill in the best upper bounds for small admissible tuples (342~5500). Efforts to fill in the blank fields in this table are very welcome. {| border=1 |- !<math>k_0</m...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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

Efforts to fill in the blank fields in this table are very welcome.

[math]\displaystyle{ k_0 }[/math] 0 1 2 3 4 5 6 7 8 9
5500 - - - - - - - - - -
5540 38,596 32,296 28,008 17,766 8,212 5,216 2,414 2,414 2,414 2,414