The football pool problem for 5 matches

H.J.L. Kamps; J.H. van Lint

doi:10.1016/S0021-9800(67)80102-9

The football pool problem for 5 matches

H.J.L. Kamps
, J.H. van Lint

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

44 Citations (Scopus)

284 Downloads (Pure)

Abstract

We consider the set of all 5-tuples x=(x1, x2, x3, x4, x5) with xi=0,1 or 2 for i=1…,5. The problem treated in this paper is determining the minimal k for which a set of 5-tuples exists such that for each x in there is an element in that differs from x in at most one coordinate.

Original language	English
Pages (from-to)	315-325
Journal	Journal of Combinatorial Theory
Volume	3
Issue number	4
DOIs	https://doi.org/10.1016/S0021-9800(67)80102-9
Publication status	Published - 1967

Access to Document

10.1016/S0021-9800(67)80102-9

593454Final published version, 374 KB

Cite this

@article{516af01cf9954ac7a0bde52cd503373b,

title = "The football pool problem for 5 matches",

abstract = "We consider the set of all 5-tuples x=(x1, x2, x3, x4, x5) with xi=0,1 or 2 for i=1…,5. The problem treated in this paper is determining the minimal k for which a set of 5-tuples exists such that for each x in there is an element in that differs from x in at most one coordinate.",

author = "H.J.L. Kamps and \{van Lint\}, J.H.",

year = "1967",

doi = "10.1016/S0021-9800(67)80102-9",

language = "English",

volume = "3",

pages = "315--325",

journal = "Journal of Combinatorial Theory",

issn = "0021-9800",

publisher = "Academic Press Inc.",

number = "4",

}

TY - JOUR

T1 - The football pool problem for 5 matches

AU - Kamps, H.J.L.

AU - van Lint, J.H.

PY - 1967

Y1 - 1967

N2 - We consider the set of all 5-tuples x=(x1, x2, x3, x4, x5) with xi=0,1 or 2 for i=1…,5. The problem treated in this paper is determining the minimal k for which a set of 5-tuples exists such that for each x in there is an element in that differs from x in at most one coordinate.

AB - We consider the set of all 5-tuples x=(x1, x2, x3, x4, x5) with xi=0,1 or 2 for i=1…,5. The problem treated in this paper is determining the minimal k for which a set of 5-tuples exists such that for each x in there is an element in that differs from x in at most one coordinate.

U2 - 10.1016/S0021-9800(67)80102-9

DO - 10.1016/S0021-9800(67)80102-9

M3 - Article

SN - 0021-9800

VL - 3

SP - 315

EP - 325

JO - Journal of Combinatorial Theory

JF - Journal of Combinatorial Theory

IS - 4

ER -