Given is a square board with dimensions 2023×2023, in which each unit cell is colored blue or red. There are exactly 1012 rows in which the majority of cells are blue, and exactly 1012 columns in which the majority of cells are red. What is the maximal possible side length of the largest monochromatic square?
Problem
Source: JBMO Shortlist 2023, C1
Tags: square grid, JBMO, JBMO Shortlist, combinatorics
02.07.2024 00:32
02.07.2024 02:06
generalization for (2n+1)2 is n
29.01.2025 13:46
Finally did a combi Answer: 2011 Bounding: Let X be the length of the largest monochromatic square. FTSOC assume X≥2012 Assume that the color in the monochromatic square is blue so if X≥2012 note that because of the square there should be 1012 rows which are blue and also 1012 columns that are also blue hence there are 2023−1012=1011 columns that the majority of cells are red but this is a contradiction by our condition . →← Hence X<2012⟺X≤2011 Now we just show that X=2011 works: Construction
Attachments:

30.01.2025 23:25
easy Let's say this square AZ Square now Let's AZ square side be A \textcolorredClaim: There is no way that A≥1012 proof: that's easy to show according to the our AZ square includes oly the same colored unit cells and we know that majority of the rows and columns A>1012 is Absurd andA=1012 contradict majority then A=1011 is our answer and there is no any contradiction and here is some cells