I am encountering the following problem :
Given $p$, $q$, and $r$, is there a way of creating $p$ sets of $q$ integers between $1$ and $r$, such that :
-every integer must be in exactly $\frac{pq}{r}$ sets
-all possible pairs of sets must intersect
I am trying to prove that this is impossible for certain values of $p$, $q$ and $r$, but I need to use every condition, forgetting one of them is never enough. Would you have any ideas on what would be eventually a necessary and sufficient condition on $p$, $q$ and $r$, or an equivalent but easier way to express the problem ? Thank you in advance.