Let be a positive integer. We have a board of dimensions , divided in "houses" and we mean to paint each one of the houses in either blue or white. We say that the coloration is "rectangulable" if, between any four houses whose centres form a rectangle of parallel sides to the board's, the number of houses painted in each color is even.
Determine, in function of , the number of rectangulable paintings of the board.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Suppose we have a 6×6 board. If we have an "internal" 3×5 rectangle with 15 squares, there would be no way for the number of houses painted in each color to be the same. Perhaps you will need to relax the condition so that the number of houses painted (within every internal rectangle) in each color differ by no more than 1.
Log in to reply
When I say the number of houses painted in each color, Im refering to those 4 houses and not the ones inside the rectangle formed. ( a rectangulable painting is such that between any four houses forming a rectangle there are 0,2 or 4 painted each color.
Log in to reply
O.k., great. Thanks for the clarification. :)