On steiner systems

Steiner’s “combinatorial problems” have so far been solved only fork=3 [5, 3] and fork=4 [1,2]. In this paper a complete solution of the problem is given for “closed” Steiner systems, i.e. systems havingn=2k−1−1 elements. Use is made of methods developed by Zaremba [7] for abelian groups.