Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2007-part-03 — 185 problems (EN–VI) Question 2

Math Olympiad Vault · MathNet 2007-part-03 — 185 problems (EN–VI)

Question 2

Consider the sixteen tiles fixed on a wall as shown below. How many ways are there to write either $0$ or $1$ on each tile so that the product of the two numbers written on every neighboring pair of tiles (sharing a common side) is always $0$?

Question illustration