olymmath

HMMT 2010 C1

  • Combinatorics
  • Answer

Let S={1,2,3,4,5,6,7,8,9,10}S=\{1,2,3,4,5,6,7,8,9,10\}. How many (potentially empty) subsets TT of SS are there such that, for all xx, if xx is in TT and 2x2 x is in SS then 2x2 x is also in TT ?

Dataset text NuminaMath olympiads. Quoted with source.

Also HMMT 2010 E2.

Show the answer

180

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/2010/c1 · Tag 8QG55EXX3X · Edit this page on GitHub · Keys: j next, k previous