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 "2024 AMC 12B Problems/Problem 24"

(→‎Solution)
(→‎Solution)
 
(7 intermediate revisions by the same user not shown)
Line 21: Line 21:
 
<cmath>\frac{R}{a}=\frac{BC}{AB+BC+AC}</cmath>
 
<cmath>\frac{R}{a}=\frac{BC}{AB+BC+AC}</cmath>
 
Hence,
 
Hence,
−
<cmath>\frac{1}{R}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}</cmath>
+
\begin{align}\label{e1}
 +
\frac{1}{R}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}
 +
\end{align}
  
−
There exists a unique, non-degenerate triangle with altitudes <math>a, b, c</math> if and only if <math>\frac{1}{a}, \frac{1}{b}, \frac{1}{c}</math> are the side lengths of a non-degenerate triangle. With this in mind, it remains to find all integer solutions <math>(R, a, b, c)</math> to <math>\frac{1}{R}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}</math> such that <math>\frac{1}{a}, \frac{1}{b}, \frac{1}{c}</math> and <math>a\le b\le c\le 9</math>
+
Note that there exists a unique, non-degenerate triangle with altitudes <math>a, b, c</math> if and only if <math>\frac{1}{a}, \frac{1}{b}, \frac{1}{c}</math> are the side lengths of a non-degenerate triangle, i.e., <math>\frac{1}{b}+\frac{1}{c}>\frac{1}{a}</math>.
 +
 
 +
With this in mind, it remains to find all positive integer solutions <math>(R, a, b, c)</math> to the above such that <math>\frac{1}{b}+\frac{1}{c}>\frac{1}{a}</math>, and <math>a\le b\le c\le 9</math>. We do this by doing casework on the value of <math>R</math>.
 +
 
 +
Since <math>R</math> is a positive integer, <math>R\ge 1</math>. Since <math>a\le b\le c\le 9</math>, <math>\frac{1}{R}\ge \frac{1}{3}</math>, so <math>R\le3</math>. The only possible values for <math>R</math> are 1, 2, 3.
 +
 
 +
<math>\textbf{Case 1: R=1}</math>
 +
 
 +
For this case, we can't have <math>a\ge 4</math>, since <math>\frac{1}{a}+\frac{1}{b}+\frac{1}{c}</math> would be too small. When <math>a=3</math>, we must have <math>b=c=3</math>. When <math>a\le2</math>, we would have <math>\frac{1}{b}+\frac{1}{c}\le\frac{1}{a}</math>, which doesn't work. Hence this case only yields one valid solution <math>(1, 3, 3, 3)</math>
 +
 
 +
<math>\textbf{Case 2: R=2}</math>
 +
 
 +
For this case, we can't have <math>a\ge 7</math>, for the same reason as in Case 1. When <math>a=6</math>, we must have <math>b=c=6</math>. When <math>a=5</math>, we must have <math>b=5, c=10</math> or <math>b=10, c=5</math>. Regardless, <math>10</math> appears, so it is not a valid solution. When <math>ale4</math>, <math>\frac{1}{b}+\frac{1}{c}\le\frac{1}{a}</math>. Hence, this case also only yields one valid solution <math>(2, 6, 6, 6)</math>
 +
 
 +
<math>\textbf{Case 3: R=3}</math>
 +
 
 +
The only possible solution is <math>(3, 9, 9, 9)</math>, and clearly it is a valid solution.
 +
 
 +
Hence the only valid solutions are <math>(1, 3, 3, 3), (2, 6, 6, 6), (3, 9, 9, 9)</math>, and our answer is <math>\fbox{\textbf{(B) }3}</math>
 +
 
 +
~tsun26

Latest revision as of 02:07, 14 November 2024

Problem 24

What is the number of ordered triples $(a,b,c)$ of positive integers, with $a\le b\le c\le 9$, such that there exists a (non-degenerate) triangle $\triangle ABC$ with an integer inradius for which $a$, $b$, and $c$ are the lengths of the altitudes from $A$ to $\overline{BC}$, $B$ to $\overline{AC}$, and $C$ to $\overline{AB}$, respectively? (Recall that the inradius of a triangle is the radius of the largest possible circle that can be inscribed in the triangle.)

$\textbf{(A) }2\qquad \textbf{(B) }3\qquad \textbf{(C) }4\qquad \textbf{(D) }5\qquad \textbf{(E) }6\qquad$

Solution

First we derive the relationship between the inradius of a triangle $R$, and its three altitudes $a, b, c$. Using an area argument, we can get the following well known result \[\left(\frac{AB+BC+AC}{2}\right)R=A\] where $AB, BC, AC$ are the side lengths of $\triangle ABC$, and $A$ is the triangle's area. Substituting $A=\frac{1}{2}\cdot AB\cdot c$ into the above we get \[\frac{R}{c}=\frac{AB}{AB+BC+AC}\] Similarly, we can get \[\frac{R}{b}=\frac{AC}{AB+BC+AC}\] \[\frac{R}{a}=\frac{BC}{AB+BC+AC}\] Hence, \begin{align}\label{e1} \frac{1}{R}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \end{align}

Note that there exists a unique, non-degenerate triangle with altitudes $a, b, c$ if and only if $\frac{1}{a}, \frac{1}{b}, \frac{1}{c}$ are the side lengths of a non-degenerate triangle, i.e., $\frac{1}{b}+\frac{1}{c}>\frac{1}{a}$.

With this in mind, it remains to find all positive integer solutions $(R, a, b, c)$ to the above such that $\frac{1}{b}+\frac{1}{c}>\frac{1}{a}$, and $a\le b\le c\le 9$. We do this by doing casework on the value of $R$.

Since $R$ is a positive integer, $R\ge 1$. Since $a\le b\le c\le 9$, $\frac{1}{R}\ge \frac{1}{3}$, so $R\le3$. The only possible values for $R$ are 1, 2, 3.

$\textbf{Case 1: R=1}$

For this case, we can't have $a\ge 4$, since $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}$ would be too small. When $a=3$, we must have $b=c=3$. When $a\le2$, we would have $\frac{1}{b}+\frac{1}{c}\le\frac{1}{a}$, which doesn't work. Hence this case only yields one valid solution $(1, 3, 3, 3)$

$\textbf{Case 2: R=2}$

For this case, we can't have $a\ge 7$, for the same reason as in Case 1. When $a=6$, we must have $b=c=6$. When $a=5$, we must have $b=5, c=10$ or $b=10, c=5$. Regardless, $10$ appears, so it is not a valid solution. When $ale4$, $\frac{1}{b}+\frac{1}{c}\le\frac{1}{a}$. Hence, this case also only yields one valid solution $(2, 6, 6, 6)$

$\textbf{Case 3: R=3}$

The only possible solution is $(3, 9, 9, 9)$, and clearly it is a valid solution.

Hence the only valid solutions are $(1, 3, 3, 3), (2, 6, 6, 6), (3, 9, 9, 9)$, and our answer is $\fbox{\textbf{(B) }3}$

~tsun26

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2024_AMC_12B_Problems/Problem_24&oldid=233679"