Content deleted Content added
Unlinked: Rook |
Litespotng (talk | contribs) Tags: Reverted Visual edit |
||
Line 27:
== Football pools problem ==
A particular case is the '''[https://poolfixtures.com/ football pools problem]''', based on [[football pool]] betting, where the aim is to predict the results of ''n'' football matches as a home win, draw or away win, or to at least predict {{nowrap|''n'' - 1}} of them with multiple bets. Thus a ternary covering, ''K''<sub>3</sub>(''n'',1), is sought.
If <math>n=\tfrac12 (3^k-1)</math> then 3<sup>''n''-''k''</sup> are needed, so for ''n'' = 4, ''k'' = 2, 9 are needed; for ''n'' = 13, ''k'' = 3, 59049 are needed.<ref>http://alexandria.tue.nl/repository/freearticles/593454.pdf</ref> The best bounds known as of 2011<ref>http://www.sztaki.hu/~keri/codes/3_tables.pdf</ref> are
| |||