Denition:
An orthogonal array OA(k, n) on n symbols is an n2 x k
array such that, in any two columns, each ordered pair of symbols
occurs exactly once.
Prove that there exists an OA(k, n) if and only if there exist (k -
2) mutually orthogonal Latin squares of order n.
(combinatorics and design)