Difference between revisions of "1998 AJHSME Problems/Problem 24"
Mrdavid445 (talk | contribs) |
Mrdavid445 (talk | contribs) |
||
Line 1: | Line 1: | ||
A rectangular board of 8 columns has squared numbered beginning in the upper left corner and moving left to right so row one is numbered 1 through 8, row two is 9 through 16, and so on. A student shades square 1, then skips one square and shades square 3, skips two squares and shades square 6, skips 3 squares and shades square 10, and continues in this way until there is at least one shaded square in each column. What is the number of the shaded square that first achieves this result? | A rectangular board of 8 columns has squared numbered beginning in the upper left corner and moving left to right so row one is numbered 1 through 8, row two is 9 through 16, and so on. A student shades square 1, then skips one square and shades square 3, skips two squares and shades square 6, skips 3 squares and shades square 10, and continues in this way until there is at least one shaded square in each column. What is the number of the shaded square that first achieves this result? | ||
− | [ | + | [http://www.artofproblemsolving.com/Forum/viewtopic.php?p=2331780&sid=3057ce3af8558814a3f7473fd1629118#p2331780 picture] |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
<math> \text{(A)}\ 36\qquad\text{(B)}\ 64\qquad\text{(C)}\ 78\qquad\text{(D)}\ 91\qquad\text{(E)}\ 120 </math> | <math> \text{(A)}\ 36\qquad\text{(B)}\ 64\qquad\text{(C)}\ 78\qquad\text{(D)}\ 91\qquad\text{(E)}\ 120 </math> |
Revision as of 11:21, 27 June 2011
A rectangular board of 8 columns has squared numbered beginning in the upper left corner and moving left to right so row one is numbered 1 through 8, row two is 9 through 16, and so on. A student shades square 1, then skips one square and shades square 3, skips two squares and shades square 6, skips 3 squares and shades square 10, and continues in this way until there is at least one shaded square in each column. What is the number of the shaded square that first achieves this result?