Difference between revisions of "2021 JMPSC Invitationals Problems/Problem 7"
(Created page with "==Problem== In a <math>3 \times 3</math> grid with nine square cells, how many ways can Jacob shade in some nonzero number of cells such that each row, column, and diagonal c...") |
Mathdreams (talk | contribs) |
||
| Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
asdf | asdf | ||
| + | |||
| + | ==See also== | ||
| + | #[[2021 JMPSC Invitational Problems|Other 2021 JMPSC Invitational Problems]] | ||
| + | #[[2021 JMPSC Invitational Answer Key|2021 JMPSC Invitational Answer Key]] | ||
| + | #[[JMPSC Problems and Solutions|All JMPSC Problems and Solutions]] | ||
| + | {{JMPSC Notice}} | ||
Revision as of 17:27, 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
asdf
See also
- Other 2021 JMPSC Invitational Problems
- 2021 JMPSC Invitational Answer Key
- All JMPSC Problems and Solutions
The problems on this page are copyrighted by the Junior Mathematicians' Problem Solving Competition. 
