benchmarks.wiki / Public workspace

Omni-MATH / Zebadiah has 3 red shirts, 3 blue shirts, and 3 green shirts in a drawer.…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Zebadiah has 3 red shirts, 3 blue shirts, and 3 green shirts in a drawer. Without looking, he randomly pulls shirts from his drawer one at a time. What is the minimum number of shirts that Zebadiah has to pull out to guarantee that he has a set of shirts that includes either 3 of the same colour or 3 of different colours?

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import