In a $10 \times 10$ table some cells(at least one) are marked such that in every $3 \times 3$ subtable an even number of cells are marked. What is the minimal possible amount of marked cells?
Problem
Source: Belarusian olympiad 2021
Tags: combinatorics
14.11.2024 12:41
seems like it is 7, mark 7 out of 10 cells on the first row example: 1 0 1 1 0 1 1 0 1 1 . Where 1 is marked cell and 0 is not marked.
14.11.2024 16:31
amirthenumb14 wrote: seems like it is 7, mark 7 out of 10 cells on the first row example: 1 0 1 1 0 1 1 0 1 1 . Where 1 is marked cell and 0 is not marked. Do you have a proof that there is no example with less than 7 cells marked?
25.11.2024 20:56
so we must mark at least 1 cell, soo lets mark only a row of 3*10 cells and others we leave without marked cells also we will mark only cells on top of the table, obviously we will minimize out amount of marked cells, so we have 3 3*3 squares so we will mark 6 cells and also we have a 1*3 row so we need to mark another 1 cell, and get our answer. sorry for my quite bad explanation, my English is way too bad(((
08.12.2024 14:42
amirthenumb14 wrote: so we must mark at least 1 cell, soo lets mark only a row of 3*10 cells and others we leave without marked cells also we will mark only cells on top of the table, obviously we will minimize out amount of marked cells, so we have 3 3*3 squares so we will mark 6 cells and also we have a 1*3 row so we need to mark another 1 cell, and get our answer. sorry for my quite bad explanation, my English is way too bad((( I don't understand why marking cells only in the top $3 \times 10$ subtable is optimal, and why can't you have $0$ in any of the three $3 \times 3$ subtables or the $1 \times 3$ subtable