1994 AIME Problems/Problem 12
A fenced, rectangular field measures meters by meters. An agricultural researcher has 1994 meters of fence that can be used for internal fencing to partition the field into congruent, square test plots. The entire field must be partitioned, and the sides of the squares must be parallel to the edges of the field. What is the largest number of square test plots into which the field can be partitioned using all or some of the 1994 meters of fence?
Suppose there are squares in every column of the grid, so there are squares in every row. Then , and our goal is to maximize the value of .
Each vertical fence has length , and there are vertical fences; each horizontal fence has length , and there are such fences. Then the total length of the internal fencing is , so . The largest multiple of that is is , which we can easily verify works, and the answer is .
Assume each partitioned square has a side length of (just so we can get a clear image of what the formula will look like). The amount of internal fencing that is required to partition the field is clearly . (If you are confused, just draw the square out). This is clearly greater than , so the actual side length that we are looking for is greater than .
Now we can convert this into an equation. The equation is simply (The intutition comes from considering partioning the field into side lengths of and then partitioning those squares). This is equivalent to , which should be less than or equal to .
Now we can just find possible lengths of the square that are greater than and test them out. A viable side length would mean that N. Since , then the smallest value greater than that we satisfies the conditions has in the numerator, and hence in the denominator. Test out . This will equate to something less than , and hence the smallest square length that is plausible is .
Now the rest is elementary, we do
|1994 AIME (Problems • Answer Key • Resources)|
|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.