Difference between revisions of "2015 AMC 8 Problems/Problem 22"
(→Solution) |
Theraccoon (talk | contribs) m (→Solution 1) |
||
| (19 intermediate revisions by 14 users not shown) | |||
| Line 1: | Line 1: | ||
| + | == Problem 22== | ||
| + | |||
On June 1, a group of students is standing in rows, with 15 students in each row. On June 2, the same group is standing with all of the students in one long row. On June 3, the same group is standing with just one student in each row. On June 4, the same group is standing with 6 students in each row. This process continues through June 12 with a different number of students per row each day. However, on June 13, they cannot find a new way of organizing the students. What is the smallest possible number of students in the group? | On June 1, a group of students is standing in rows, with 15 students in each row. On June 2, the same group is standing with all of the students in one long row. On June 3, the same group is standing with just one student in each row. On June 4, the same group is standing with 6 students in each row. This process continues through June 12 with a different number of students per row each day. However, on June 13, they cannot find a new way of organizing the students. What is the smallest possible number of students in the group? | ||
| − | <math> | + | <math>\textbf{(A) } 21 \qquad \textbf{(B) } 30 \qquad \textbf{(C) } 60 \qquad \textbf{(D) } 90 \qquad \textbf{(E) } 1080 </math> |
| − | \textbf{(A) } 21 \qquad | + | |
| − | \textbf{(B) } 30 \qquad | + | ==Solution 1== |
| − | \textbf{(C) } 60 \qquad | + | Since we know the number must be a multiple of <math>15</math>, we can eliminate <math>A</math>. We also know that after <math>12</math> days, the students can't find any more arrangements, meaning the number has <math>12</math> factors. Now, we just list the factors of every number, starting with <math>30</math>: |
| − | \textbf{(D) } 90 \qquad | + | <cmath>30=1\cdot30, 2\cdot15, 3\cdot10, 5\cdot6</cmath> |
| − | \textbf{(E) } 1080 | + | <cmath>60=1\cdot60, 2\cdot30, 3\cdot20, 4\cdot15, 5\cdot12, 6\cdot10</cmath> |
| − | </math> | + | <math>60</math> has <math>12</math> factors, so the answer is <math>\boxed{\textbf{(C) } 60}</math>. |
| + | |||
| + | Note - A faster way to find the factors of a number is really helpful in competitions, as you don't want to waste time listing them all. | ||
| + | What we can do is find the prime factorization of a number. We'll use <math>60</math> as an example here, so we take <math>60 = 2 \cdot 2 \cdot 3 \cdot 5</math> or <math>60 = 2^2 \cdot 3^1 \cdot 5^1</math>. Now, we just add one to the power of each factor. So since we have powers of <math>2</math>, <math>1</math>, and <math>1</math>, we turn those into <math>3</math>, <math>2</math>, and <math>2</math>. Finally, we just multiply them together to get <math>3 \cdot 2 \cdot 2 = 12</math> as the amount of factors in 60. | ||
| + | |||
| + | ~ note by probab2023, the person who originally made this solution didn't put their name in the bottom. | ||
| + | |||
| + | ==Video Solution== | ||
| + | https://youtu.be/E2om3xIvtYM | ||
| − | + | ~savannahsolver | |
| − | |||
| − | |||
==See Also== | ==See Also== | ||
Latest revision as of 18:43, 25 September 2024
Problem 22
On June 1, a group of students is standing in rows, with 15 students in each row. On June 2, the same group is standing with all of the students in one long row. On June 3, the same group is standing with just one student in each row. On June 4, the same group is standing with 6 students in each row. This process continues through June 12 with a different number of students per row each day. However, on June 13, they cannot find a new way of organizing the students. What is the smallest possible number of students in the group?
Solution 1
Since we know the number must be a multiple of 
, we can eliminate 
. We also know that after 
days, the students can't find any more arrangements, meaning the number has factors. Now, we just list the factors of every number, starting with 
:
![\[30=1\cdot30, 2\cdot15, 3\cdot10, 5\cdot6\]](http://latex.artofproblemsolving.com/e/8/a/e8af5982e203be2f7b064ac712a376099c031e4e.png)
![\[60=1\cdot60, 2\cdot30, 3\cdot20, 4\cdot15, 5\cdot12, 6\cdot10\]](http://latex.artofproblemsolving.com/c/0/5/c0545467e968bdfdf5647d51345a0621f2c62dc3.png)
has factors, so the answer is 
.
Note - A faster way to find the factors of a number is really helpful in competitions, as you don't want to waste time listing them all.
What we can do is find the prime factorization of a number. We'll use as an example here, so we take 
or 
. Now, we just add one to the power of each factor. So since we have powers of 
, 
, and , we turn those into 
, , and . Finally, we just multiply them together to get 
as the amount of factors in 60.
~ note by probab2023, the person who originally made this solution didn't put their name in the bottom.
Video Solution
~savannahsolver
See Also
| 2015 AMC 8 (Problems • Answer Key • Resources) | ||
| Preceded by Problem 21 |
Followed by Problem 23 | |
| 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. 
