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"
Line 6: Line 6:
  
 
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 \le 1994 \Longrightarrow n \le \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>.
 
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 \le 1994 \Longrightarrow n \le \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>.
 +
 +
== Solution 2==
 +
Assume each partitioned square has a side length of <math>1</math> (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 <math>52*(24+1) + 24(52+1)</math>. (If you are confused, just draw the square out). This is clearly greater than <math>1994</math>, so the actual side length that we are looking for is greater than <math>1</math>.
 +
 +
Now we can convert this into an equation. The equation is simply <math>(\frac{52}{x})(\frac{24}{x}+1) + (\frac{24}{x})(\frac{52}{x}+1)</math> (The intutition comes from considering partioning the field into side lengths of <math>1</math> and then partitioning those squares). This is equivalent to <math>\frac{2496}{x^2} + \frac{76}{x}</math>, which should be less than or equal to <math>1994</math>.
 +
 +
Now we can just find possible lengths of the square that are greater than <math>1</math> and test them out. A viable side length would mean that <math>\frac{24}{x}, \frac{52}{x} \in</math> N. Since <math>\gcd(24,52) = 4</math>, then the smallest value greater than <math>1</math> that we satisfies the conditions has <math>4</math> in the numerator, and hence <math>3</math> in the denominator. Test out <math>x=\frac{4}{3}</math>. This will equate to something less than <math>1994</math>, and hence the smallest square length that is plausible is <math>\frac{4}{3}</math>.
 +
 +
Now the rest is elementary, we do <math>\frac{52}{\frac{4}{3}} * \frac{24}{\frac{4}{3}} \Rightarrow 39*18 = \boxed{702}</math>
  
 
== See also ==
 
== See also ==

Revision as of 13:36, 21 July 2019

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 \le 1994 \Longrightarrow n \le \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}$.

Solution 2

Assume each partitioned square has a side length of $1$ (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 $52*(24+1) + 24(52+1)$. (If you are confused, just draw the square out). This is clearly greater than $1994$, so the actual side length that we are looking for is greater than $1$.

Now we can convert this into an equation. The equation is simply $(\frac{52}{x})(\frac{24}{x}+1) + (\frac{24}{x})(\frac{52}{x}+1)$ (The intutition comes from considering partioning the field into side lengths of $1$ and then partitioning those squares). This is equivalent to $\frac{2496}{x^2} + \frac{76}{x}$, which should be less than or equal to $1994$.

Now we can just find possible lengths of the square that are greater than $1$ and test them out. A viable side length would mean that $\frac{24}{x}, \frac{52}{x} \in$ N. Since $\gcd(24,52) = 4$, then the smallest value greater than $1$ that we satisfies the conditions has $4$ in the numerator, and hence $3$ in the denominator. Test out $x=\frac{4}{3}$. This will equate to something less than $1994$, and hence the smallest square length that is plausible is $\frac{4}{3}$.

Now the rest is elementary, we do $\frac{52}{\frac{4}{3}} * \frac{24}{\frac{4}{3}} \Rightarrow 39*18 = \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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1994_AIME_Problems/Problem_12&oldid=107782"