Difference between revisions of "1994 AIME Problems/Problem 12"
m |
(categories) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | A fenced, rectangular field measures 24 meters by 52 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? | + | A fenced, rectangular field measures <math>24</math> meters by <math>52</math> 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? |
== Solution == | == Solution == | ||
| Line 7: | Line 7: | ||
== See also == | == See also == | ||
{{AIME box|year=1994|num-b=11|num-a=13}} | {{AIME box|year=1994|num-b=11|num-a=13}} | ||
| + | |||
| + | [[Category:Intermediate Geometry Problems]] | ||
Revision as of 18:02, 4 December 2007
Problem
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?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 1994 AIME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 11 |
Followed by Problem 13 | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
| All AIME Problems and Solutions | ||
