MathDB
nice problem! [variations on the Plotkin bound]

Source: Iran (2003,third round)

March 8, 2004
linear algebramatrixLaTeXinequalitiesvectoranalytic geometrymodular arithmetic

Problem Statement

Assume m×nm\times n matrix which is filled with just 0, 1 and any two row differ in at least n/2n/2 members, show that m≤2nm \leq 2n. ( for example the diffrence of this two row is only in one index 110 100)
Edited by Myth
Back to ProblemsView on AoPS