Count red-green segments modulo two. On , part (a) says their number is odd; the other two outer sides contain no red-green segment. Every interior segment belongs to two small triangles and therefore contributes zero modulo two, while each boundary segment belongs to one. Thus the sum, over all small triangles, of their numbers of red-green edges is odd.
A triangle with all three colours has exactly one red-green edge. A triangle using only red and green has zero or two, and any other nontrichromatic triangle has zero red-green edges. Hence the parity sum counts precisely the trichromatic triangles modulo two, proving that their number is odd.
Not necessarily, once the subdivision has at least two segments per side. Colour red, green, blue respectively and colour every other grid vertex red. No small triangle contains both exceptional vertices and , and every small triangle therefore uses at most two colours. For the unsubdivided triangle the assertion is of course true.
Articles by others on the same topic
There are currently no matching articles.