olymmath

HMMT 2012 S10

  • Team 2

Purineqa is making a pizza for Arno. There are five toppings that she can put on the pizza. However, Arno is very picky and only likes some subset of the five toppings. Purineqa makes five pizzas, each with some subset of the five toppings. For each pizza, Arno states (with either a "yes" or a "no") if the pizza has any toppings that he does not like. Purineqa chooses these pizzas such that no matter which toppings Arno likes, she has enough information to make him a sixth pizza with all the toppings he likes and no others. What are all possible combinations of the five initial pizzas for this to be the case?

Dataset text NuminaMath olympiads. Quoted with source.

Also HMMT 2012 T5.

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/2012/s10 · Tag 688JVCJSCH · Edit this page on GitHub · Keys: j next, k previous