Subcontests
(6)Combinatorics with prime and chess board
Let p be a given prime number. For positive integers n,k≥2 let S1,S2,…,Sn be unit square sets constructed by choosing exactly one unit square from each of the columns from p×k chess board. If ∣Si∩Sj∣=1 for all 1≤i<j≤n and for any duo of unit squares which are located at different columns there exists Si such that both of these unit squares are in Si find all duos of (n,k) in terms of p.Note: Here we denote the number of rows by p and the number of columns by k.