Difference between revisions of "2005 AIME I Problems/Problem 4"
(→Solution 2) |
Phoenixfire (talk | contribs) (→Solution 5) |
||
(14 intermediate revisions by 6 users not shown) | |||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are | + | The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have. |
+ | __TOC__ | ||
− | |||
== Solution == | == Solution == | ||
=== Solution 1 === | === Solution 1 === | ||
Line 12: | Line 12: | ||
=== Solution 3 === | === Solution 3 === | ||
The number of members is <math>m^2+5=n(n+7)</math> for some <math>n</math> and <math>m</math>. Multiply both sides by <math>4</math> and [[completing the square|complete the square]] to get <math>4m^2+69=(2n+7)^2</math>. Thus, we have <math>69=((2n+7)+2m)((2n+7)-2m)</math>. Since we want to maximize <math>n</math>, set the first factor equal to <math>69</math> and the second equal to <math>1</math>. Solving gives <math>n=14</math>, so the answer is <math>14\cdot21=294</math>. | The number of members is <math>m^2+5=n(n+7)</math> for some <math>n</math> and <math>m</math>. Multiply both sides by <math>4</math> and [[completing the square|complete the square]] to get <math>4m^2+69=(2n+7)^2</math>. Thus, we have <math>69=((2n+7)+2m)((2n+7)-2m)</math>. Since we want to maximize <math>n</math>, set the first factor equal to <math>69</math> and the second equal to <math>1</math>. Solving gives <math>n=14</math>, so the answer is <math>14\cdot21=294</math>. | ||
+ | |||
+ | === Solution 4 === | ||
+ | Partially completing the square | ||
+ | |||
+ | Geometrically: Split up the formation of <math>n + 7</math> rows and <math>n</math> columns into a square of <math>n</math> rows and <math>n</math> columns and a separate rectangle of the dimensions <math>7</math> rows by <math>n</math> columns. We want to take the rows from the rectangle and add them to the square to get another square and <math>5</math> left over. If we attach exactly <math>2</math> rows on the top and exactly <math>2</math> rows on the side of the <math>n</math> x <math>n</math> square, then we have an <math>(n + 2)</math> x <math>(n + 2)</math> square that's missing a <math>2</math> x <math>2</math> corner. For the remaining <math>3n</math> to fill this square plus the <math>5</math> extra members, <math>n</math> must be <math>3</math>. If we instead plaster exactly <math>3</math> rows from the <math>7</math> x <math>n</math> formation to two adjacent sides of the <math>n</math> x <math>n</math> square, we have an <math>(n + 3)</math> x <math>(n + 3)</math> formation that's missing a <math>3</math> x <math>3</math> corner. For the remaining row of length <math>n</math> to fill this plus five, <math>n = 14</math>. Plugging these in, we find <math>n = 14</math> has a much higher count of members: <math>(n + 7)n; n = 14 --> 21(14) = 294</math> | ||
+ | |||
+ | Algebraically: We have <math>n^2 + 7n = m</math>, where <math>m</math> is the number of members in the band and <math>n</math> is a positive integer. We partially complete the square for <math>n</math> to get | ||
+ | <math>n^2 + 7n = (n + 1)^2 + 5n - 1 = (n + 2)^2 + 3n - 4 = (n + 3)^2 + n - 9</math> | ||
+ | Our goal is to get <math>n^2 + 7n = y^2 + 5</math> because we want <math>m</math> to be <math>5</math> more than a perfect square. From the above, <math>5n - 1 = 5</math> means <math>n</math> isn't an integer, <math>3n - 4 = 5</math> means that <math>n = 3</math>, and <math>n - 9 = 5</math> means that <math>n = 14</math>. Out of these, <math>n = 14</math> is associated with the highest number of members in the band, so <math>m = (14^2) + 7(14) = 294</math> | ||
+ | |||
+ | |||
+ | === Solution 5=== | ||
+ | |||
+ | Let there be <math>m</math> members and <math>n</math> members for the square and <math>c</math> for the number of columns of the other formation. We have <math>n^2 +5 = c(c+7) \implies n^2+5 = \left(c+\frac{7}{2}\right)^2 -\frac{49}{4} \implies n^2 - \left(c+\frac{7}{2}\right)^2 = -\frac{69}{4} \implies \left(n-c-\frac{7}{2}\right)\left(n + c +\frac{7}{2}\right) \implies (2n-2c-7)(2n+2n+7) = -69.</math> | ||
+ | |||
+ | To maximize this we let <math>2n+2c+7 = 68</math> and <math>2n-2c-7 = 1.</math> Solving we find <math>n = 17</math> so the desired number of members is <math>17^2 + 5 = \boxed{294}.</math> | ||
== See also == | == See also == | ||
Line 17: | Line 33: | ||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 00:20, 22 September 2020
Problem
The director of a marching band wishes to place the members into a formation that includes all of them and has no unfilled positions. If they are arranged in a square formation, there are 5 members left over. The director realizes that if he arranges the group in a formation with 7 more rows than columns, there are no members left over. Find the maximum number of members this band can have.
Contents
Solution
Solution 1
If then and so . If is an integer there are no numbers which are 5 more than a perfect square strictly between and . Thus, if the number of columns is , the number of students is which must be 5 more than a perfect square, so . In fact, when we have , so this number works and no larger number can. Thus, the answer is .
Solution 2
Define the number of rows/columns of the square formation as , and the number of rows of the rectangular formation (so there are columns). Thus, . The quadratic formula yields . must be an integer, say . Then and . The factors of are ; is maximized for the first case. Thus, , and . The latter obviously can be discarded, so there are rows and columns, making the answer .
Solution 3
The number of members is for some and . Multiply both sides by and complete the square to get . Thus, we have . Since we want to maximize , set the first factor equal to and the second equal to . Solving gives , so the answer is .
Solution 4
Partially completing the square
Geometrically: Split up the formation of rows and columns into a square of rows and columns and a separate rectangle of the dimensions rows by columns. We want to take the rows from the rectangle and add them to the square to get another square and left over. If we attach exactly rows on the top and exactly rows on the side of the x square, then we have an x square that's missing a x corner. For the remaining to fill this square plus the extra members, must be . If we instead plaster exactly rows from the x formation to two adjacent sides of the x square, we have an x formation that's missing a x corner. For the remaining row of length to fill this plus five, . Plugging these in, we find has a much higher count of members:
Algebraically: We have , where is the number of members in the band and is a positive integer. We partially complete the square for to get Our goal is to get because we want to be more than a perfect square. From the above, means isn't an integer, means that , and means that . Out of these, is associated with the highest number of members in the band, so
Solution 5
Let there be members and members for the square and for the number of columns of the other formation. We have
To maximize this we let and Solving we find so the desired number of members is
See also
2005 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.