Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1994 AIME Problems/Problem 12"

(categories)
(solution .. a little bit too easy?)
Line 3: Line 3:
  
 
== Solution ==
 
== Solution ==
−
{{solution}}
+
Suppose there are <math>n</math> squares in every column of the grid, so there are <math>\frac{52}{24}n = \frac {13}6n</math> squares in every row. Then <math>6|n</math>, and our goal is to maximize the value of <math>n</math>.
 +
 
 +
Each vertical fence has length <math>24</math>, and there are <math>\frac{13}{6}n - 1</math> vertical fences; each horizontal fence has length <math>52</math>, and there are <math>n-1</math> such fences. Then the total length of the internal fencing is <math>24\left(\frac{13n}{6}-1\right) + 52(n-1) = 104n - 76 < 1994 \Longrightarrow n < \frac{1035}{52} \approx 19.9</math>, so <math>n \le 19</math>. The largest multiple of <math>6</math> that is <math>\le 19</math> is <math>n = 18</math>, which we can easily verify works, and the answer is <math>\frac{13}{6}n^2 = \boxed{702}</math>.
  
 
== See also ==
 
== See also ==

Revision as of 11:36, 27 November 2008

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?

Solution

Suppose there are $n$ squares in every column of the grid, so there are $\frac{52}{24}n = \frac {13}6n$ squares in every row. Then $6|n$, and our goal is to maximize the value of $n$.

Each vertical fence has length $24$, and there are $\frac{13}{6}n - 1$ vertical fences; each horizontal fence has length $52$, and there are $n-1$ such fences. Then the total length of the internal fencing is $24\left(\frac{13n}{6}-1\right) + 52(n-1) = 104n - 76 < 1994 \Longrightarrow n < \frac{1035}{52} \approx 19.9$, so $n \le 19$. The largest multiple of $6$ that is $\le 19$ is $n = 18$, which we can easily verify works, and the answer is $\frac{13}{6}n^2 = \boxed{702}$.

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
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1994_AIME_Problems/Problem_12&oldid=28426"