MathDB
Miklos Schweitzer 1965_1

Source:

September 25, 2008
advanced fieldsadvanced fields unsolved

Problem Statement

Let p p be a prime, n n a natural number, and S S a set of cardinality pn p^n . Let <spanclass=′latex−bold′>P</span> <span class='latex-bold'>P</span> be a family of partitions of S S into nonempty parts of sizes divisible by p p such that the intersection of any two parts that occur in any of the partitions has at most one element. How large can ∣<spanclass=′latex−bold′>P</span>∣ |<span class='latex-bold'>P</span>| be?
Back to ProblemsView on AoPS