Difference between revisions of "1994 AJHSME Problems/Problem 24"
Mathfan118 (talk | contribs) (→Solution) |
|||
| (5 intermediate revisions by 5 users not shown) | |||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
| − | A <math>2</math> by <math>2</math> square is divided into four <math>1</math> by <math>1</math> squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares. | + | <!-- don't remove the following tag, for PoTW on the Wiki front page--><onlyinclude>A <math>2</math> by <math>2</math> square is divided into four <math>1</math> by <math>1</math> squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares.<!-- don't remove the following tag, for PoTW on the Wiki front page--></onlyinclude> |
<math>\text{(A)}\ 4 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 7 \qquad \text{(D)}\ 8 \qquad \text{(E)}\ 16</math> | <math>\text{(A)}\ 4 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 7 \qquad \text{(D)}\ 8 \qquad \text{(E)}\ 16</math> | ||
| Line 16: | Line 16: | ||
Case 4: There are three green squares and one red square. Similar to case 2, this happens when the red square's left and bottom edges are against the edge, so there is <math>1</math> way. | Case 4: There are three green squares and one red square. Similar to case 2, this happens when the red square's left and bottom edges are against the edge, so there is <math>1</math> way. | ||
| − | Case 5: There are four green squares and | + | Case 5: There are four green squares and zero red squares. <math>1</math> way. |
<cmath>1+1+2+1+1 = \boxed{\text{(B)}\ 6}</cmath> | <cmath>1+1+2+1+1 = \boxed{\text{(B)}\ 6}</cmath> | ||
==See Also== | ==See Also== | ||
| + | ps. If you want extra help, check out casework. | ||
{{AJHSME box|year=1994|num-b=23|num-a=25}} | {{AJHSME box|year=1994|num-b=23|num-a=25}} | ||
{{MAA Notice}} | {{MAA Notice}} | ||
Latest revision as of 13:08, 30 December 2022
Problem
A 
by square is divided into four 
by squares. Each of the small squares is to be painted either green or red. In how many different ways can the painting be accomplished so that no green square shares its top or right side with any red square? There may be as few as zero or as many as four small green squares.
Solution
If a green square cannot share its top or right side with a red square, then a red square can not share its bottom or left side with a green square. Let us split this up into several cases.
Case 1: There are no green squares. This can be done in way.
Case 2: There is one green square and three red squares. This can only be done when the green square's top and right edges are against the edge, so there is way.
Case 3: There are two green squares and two red squares. This happens when the two green squares are in the two top squares or two right squares, so there are ways.
Case 4: There are three green squares and one red square. Similar to case 2, this happens when the red square's left and bottom edges are against the edge, so there is way.
Case 5: There are four green squares and zero red squares. way.
![\[1+1+2+1+1 = \boxed{\text{(B)}\ 6}\]](http://latex.artofproblemsolving.com/d/4/c/d4cb2011cd1aa829083a49377a2bc54e1aab4614.png)
See Also
ps. If you want extra help, check out casework.
| 1994 AJHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 23 |
Followed by Problem 25 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
| All AJHSME/AMC 8 Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
