olymmath

HMMT November 2016 U26

  • Guts
  • Answer

Find the number of ways to choose two nonempty subsets XX and YY of {1,2,…,2001}\{1,2, \ldots, 2001\}, such that ∣Y∣=1001|Y|=1001 and the smallest element of YY is equal to the largest element of XX.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2^{2000}

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 hmnt/2016/u26 · Tag DKB4BXMMJ4 · Edit this page on GitHub · Keys: j next, k previous