Longest constrained sequences: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
mNo edit summary |
mNo edit summary |
||
| Line 12: | Line 12: | ||
1 = -2, 1 = -5, 11 = -13, 17 = -19 : [>=974] | 1 = -2, 1 = -5, 11 = -13, 17 = -19 : [>=974] | ||
1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29 : [>=974] | 1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29 : [>=974] | ||
1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29, 23 = -31 : [>= | 1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29, 23 = -31 : [>=854] | ||
1 = +3 : [188] | 1 = +3 : [188] | ||
1 = -3 : [>=516] | 1 = -3 : [>=516] | ||
Revision as of 14:26, 12 January 2010
The numbers in square brackets show (what we know of) the length of the longest sequence of discrepancy 2 satisfying the given constraints exactly. The notation [math]\displaystyle{ a=b }[/math] is shorthand for [math]\displaystyle{ T_a(x) = T_b(x) }[/math], and [math]\displaystyle{ a=-b }[/math] for [math]\displaystyle{ T_a(x) = -T_b(x) }[/math].
1 = +2 : [170] 1 = -2 : [>=974] 1 = -2, 1 = +3 : [188] 1 = -2, 1 = -3 : [470] 1 = -2, 1 = +5 : [356] 1 = -2, 1 = -5 : [>=974] 1 = -2, 1 = -5, 1 = +7 : [>=566] 1 = -2, 1 = -5, 1 = -7 : [284] 1 = -2, 1 = -5, 11 = -13 : [>=974] 1 = -2, 1 = -5, 11 = -13, 17 = -19 : [>=974] 1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29 : [>=974] 1 = -2, 1 = -5, 11 = -13, 17 = -19, 23 = +29, 23 = -31 : [>=854] 1 = +3 : [188] 1 = -3 : [>=516] 1 = -3, 1 = -5 : [>=476] 1 = -3, 1 = +5 : [>=376] 1 = +32 : [>=417] 2 = +3 : [>=514] 2 = -3 : [>=587]
