olymmath

CMO 2000 Problem 6

  • Day 2

A test contains 55 multiple choice questions which have 44 options in each. Suppose each examinee chose one option for each question. There exists a number nn , such that for any nn sheets among 20002000 sheets of answer papers, there are 44 sheets of answer papers such that any two of them have at most 33 questions with the same answers. Find the minimum value of nn .

Dataset text AI-MO AoPS. 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 cn-mo/2000/p6 · Tag WD04PBZ7JK · Edit this page on GitHub · Keys: j next, k previous