Content deleted Content added
Parcly Taxel (talk | contribs) →Football pools problem: Add a link Tags: Mobile edit Mobile web edit |
Added additional info for a source, removed bare url tag |
||
Line 29:
A particular case is the '''football pools problem''', based on [[football pool]] betting, where the aim is to come up with a betting system over ''n'' football matches that, regardless of the outcome, has at most ''R'' 'misses'. Thus, for ''n'' matches with at most one 'miss', 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>{{cite journal |last1=Kamps |first1=H.J.L. |last2=van Lint |first2=J.H. |title=The football pool problem for 5 matches |journal=Journal of Combinatorial Theory |date=December 1967 |volume=3 |issue=4 |pages=315–325 |doi=10.1016/S0021-9800(67)80102-9 |url=http://alexandria.tue.nl/repository/freearticles/593454.pdf
{| class="wikitable" style="text-align:center;"
| |||