Benchmarks of small admissible tuples: Difference between revisions

Latest revision as of 16:30, 20 June 2013

This is an obsolete page.

@@ Line 1: / Line 1: @@
-Here is a table to fill in the best upper bounds for small admissible tuples (342~5500).
+This is an obsolete page.
-Efforts to fill in the blank fields in this table are very welcome.
-{| border=1
-|-
-!<math>k_0</math> !! 0 !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7 !! 8 !! 9
-|-
-| 5500
-| -
-| -
-| -
-| -
-| -
-| -
-| -
-| -
-| -
-| -
-|-
-|5540
-| [http://math.mit.edu/~drew/admissible_4000_38596.txt 38,596]
-| [http://math.mit.edu/~drew/admissible_3405_32296.txt 32,296]
-| [http://math.mit.edu/~drew/admissible_3000_28008.txt 28,008]
-| [http://math.mit.edu/~drew/admissible_2000_17766.txt 17,766]
-| [http://math.mit.edu/~drew/admissible_1000_8212.txt 8,212]
-| [http://math.mit.edu/~drew/admissible_672_5216.txt 5,216]
-| [http://math.mit.edu/~drew/admissible_342_2414.txt 2,414]
-| [http://math.mit.edu/~drew/admissible_342_2414.txt 2,414]
-| [http://math.mit.edu/~drew/admissible_342_2414.txt 2,414]
-| [http://math.mit.edu/~drew/admissible_342_2414.txt 2,414]
-|}