Question 104
Given two integers $h \ge 1$ and $p \ge 2$, determine the minimum number of pairs of opponents an *hp*-member parliament may have, if in every partition of the parliament into *h* houses of *p* member each some house contains at least one pair of opponents.