Difference between revisions of "2021 JMPSC Invitationals Problems/Problem 7"
Geometry285 (talk | contribs) m |
|||
| Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
| − | + | Suppose all the squares are NOT fully covered by shaded squares. We have <math>9</math> total cases that include this. Now, the center square already covers the whole grid, so we only need to consider edge squares. Each edge square has <math>2</math> corner square options, so <math>4</math> lines of symmetry dictates <math>8</math> more cases. The answer is <math>\boxed{17}</math> | |
| − | |||
| + | ~Geometry285 | ||
==See also== | ==See also== | ||
Revision as of 20:11, 11 July 2021
Problem
In a 
grid with nine square cells, how many ways can Jacob shade in some nonzero number of cells such that each row, column, and diagonal contains at most one shaded cell? (A diagonal is a set of squares such that their centers lie on a line that makes a 
angle with the sides of the grid. Note that there are more than two diagonals.)
Solution
Suppose all the squares are NOT fully covered by shaded squares. We have 
total cases that include this. Now, the center square already covers the whole grid, so we only need to consider edge squares. Each edge square has 
corner square options, so 
lines of symmetry dictates 
more cases. The answer is 
~Geometry285
See also
- Other 2021 JMPSC Invitationals Problems
- 2021 JMPSC Invitationals Answer Key
- All JMPSC Problems and Solutions
The problems on this page are copyrighted by the Junior Mathematicians' Problem Solving Competition. 
