2014 Canadian MO Problems/Problem 2

Revision as of 21:27, 26 November 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem== Let <math>m</math> and <math>n</math> be odd positive integers. Each square of an <math>m</math> by <math>n</math> board is coloured red or blue. A row is said to...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $m$ and $n$ be odd positive integers. Each square of an $m$ by $n$ board is coloured red or blue. A row is said to be red-dominated if there are more red squares than blue squares in the row. A column is said to be blue-dominated if there are more blue squares than red squares in the column. Determine the maximum possible value of the number of red-dominated rows plus the number of blue-dominated columns. Express your answer in terms of $m$ and $n$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.