olymmath

HMMT 2016 T9

  • Team

Fix positive integers r>sr>s, and let FF be an infinite family of sets, each of size rr, no two of which share fewer than ss elements. Prove that there exists a set of size r−1r-1 that shares at least ss elements with each set in FF.

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2016/t9 · Tag ADTPBNA9TQ · Edit this page on GitHub · Keys: j next, k previous