The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.