IMC 2010, Day 2, Problem 4
Let be a symmetric matrix over the two-element field all of whose diagonal entries are zero. Prove that for every positive integer each column of the matrix has a zero entry.
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Denote by the -dimensional vector over , whose -th entry is 1 and all the other elements are 0. Furthermore, let be the vector whose all entries are 1. The -th column of is . So the statement can be written as for all and all .
For every pair of vectors and , define the bilinear form . The product has all basic properties of scalar products (except the property that implies ). Moreover, we have for every vector .
It is also easy to check that for all vectors , since is symmetric and its diagonal elements are 0.
Lemma. Suppose that a vector such that for some . Then .
Proof. Apply induction on . For odd values of we prove the lemma directly. Let and . Then
Now suppose that for some and positive integer . By the Lemma, we should have . But this is impossible because .
Transcribed from the official solutions, pages 3–4. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.