olymmath

ISL 2010 N6

The rows and columns of a 2n×2n2^{n} \times 2^{n} table are numbered from 0 to 2n−12^{n}-1. The cells of the table have been colored with the following property being satisfied: for each 0≤i,j≤2n−10 \leq i, j \leq 2^{n}-1, the jj th cell in the ii th row and the ProvethatthemaximalpossiblenumberofcolorsisProve that the maximal possible number of colors is2^{n}$.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2010 Shortlist booklet, page 73.

Show the answer

2^{n}

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2010/n6 · Tag 9HWQYH31XX · Edit this page on GitHub · Keys: j next, k previous