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 "2019 AMC 12A Problems/Problem 25"

m (→‎Solution 3 (If you're short on time))
Line 36: Line 36:
 
We note that the problem seems quite complicated, but since it is an AMC 12, the difference between the largest angle of <math>\triangle A_nB_nC_n</math> and <math>60^{\circ}</math> (we call this quantity S) most likely reduces to a simpler problem like some repeating sequence. The only obvious sequence (for the answer choices) is a geometric sequence with an integer common ratio. From here, we get that <math>S_n=0.001S^n</math> and we need <math>S_n>30</math>. The first power of two greater than <math>30,000</math> is <math>2^{15}</math> thus our answer is <math>\boxed{\textbf{(E) } 15}</math>.
 
We note that the problem seems quite complicated, but since it is an AMC 12, the difference between the largest angle of <math>\triangle A_nB_nC_n</math> and <math>60^{\circ}</math> (we call this quantity S) most likely reduces to a simpler problem like some repeating sequence. The only obvious sequence (for the answer choices) is a geometric sequence with an integer common ratio. From here, we get that <math>S_n=0.001S^n</math> and we need <math>S_n>30</math>. The first power of two greater than <math>30,000</math> is <math>2^{15}</math> thus our answer is <math>\boxed{\textbf{(E) } 15}</math>.
  
−
~Dhillonr25
+
 
 +
==Solution 4 (Orthic Triangle)==
 +
 
 +
By angle chasing (abuse those right triangles) and cyclic quadrilaterals, we find that the angles of <math>\triangle A_nB_nC_n</math>, in degrees, would be <math>60</math>, <math>60 + 0.001(2^n)</math>, and <math>60 - 0.001(2^n)</math>.
 +
 
 +
 
 +
We just need to find the value such that <math>60 + 0.001(2^n) > 90</math>.
 +
 
 +
Thus, we have <math>0.001(2^n) > 30</math>, giving <math>n\geq15</math>.
 +
 
 +
Our answer is <math>\boxed{\textbf{(E) } 15}</math>.
 +
 
 +
 
 +
Note: <math>\triangle A_nB_nC_n</math> is the <math>orthic</math> <math>triangle</math> of <math>\triangle A_{n-1}B_{n-1}C_{n-1}</math>, which is made by connecting the foots of altitudes into a triangle as specified in the problem.
 +
 
 +
 
 +
~xHypotenuse
 +
 
 +
 
 +
 
 
== Video Solution by Richard Rusczyk ==
 
== Video Solution by Richard Rusczyk ==
  

Revision as of 01:32, 2 October 2025

Problem

Let $\triangle A_0B_0C_0$ be a triangle whose angle measures are exactly $59.999^\circ$, $60^\circ$, and $60.001^\circ$. For each positive integer $n$, define $A_n$ to be the foot of the altitude from $A_{n-1}$ to line $B_{n-1}C_{n-1}$. Likewise, define $B_n$ to be the foot of the altitude from $B_{n-1}$ to line $A_{n-1}C_{n-1}$, and $C_n$ to be the foot of the altitude from $C_{n-1}$ to line $A_{n-1}B_{n-1}$. What is the least positive integer $n$ for which $\triangle A_nB_nC_n$ is obtuse?

$\textbf{(A) } 10 \qquad \textbf{(B) }11 \qquad \textbf{(C) } 13\qquad \textbf{(D) } 14 \qquad \textbf{(E) } 15$

Solution 1

For all nonnegative integers $n$, let $\angle C_nA_nB_n=x_n$, $\angle A_nB_nC_n=y_n$, and $\angle B_nC_nA_n=z_n$.

Note that quadrilateral $A_0B_0A_1B_1$ is cyclic since $\angle A_0A_1B_0=\angle A_0B_1B_0=90^\circ$; thus, $\angle A_0A_1B_1=\angle A_0B_0B_1=90^\circ-x_0$. By a similar argument, $\angle A_0A_1C_1=\angle A_0C_0C_1=90^\circ-x_0$. Thus, $x_1=\angle A_0A_1B_1+\angle A_0A_1C_1=180^\circ-2x_0$. By a similar argument, $y_1=180^\circ-2y_0$ and $z_1=180^\circ-2z_0$.

Therefore, for any positive integer $n$, we have $x_n=180^\circ-2x_{n-1}$ (identical recurrence relations can be derived for $y_n$ and $z_n$). To find an explicit form for this recurrence, we guess that the constant term is related exponentially to $n$ (and the coefficient of $x_0$ is $(-2)^n$). Hence, we let $x_n=pq^n+r+(-2)^nx_0$. We will solve for $p$, $q$, and $r$ by iterating the recurrence to obtain $x_1=180^\circ-2x_0$, $x_2=4x_0-180^\circ$, and $x_3=540-8x_0$. Letting $n=1,2,3$ respectively, we have \begin{align} pq+r&=180 \\ pq^2+r&=-180 \\ pq^3+r&=540 \end{align}

Subtracting $(1)$ from $(3)$, we have $pq(q^2-1)=360$, and subtracting $(1)$ from $(2)$ gives $pq(q-1)=-360$. Dividing these two equations gives $q+1=-1$, so $q=-2$. Substituting back, we get $p=-60$ and $r=60$.

We will now prove that for all positive integers $n$, $x_n=-60(-2)^n+60+(-2)^nx_0=(-2)^n(x_0-60)+60$ via induction. Clearly the base case of $n=1$ holds, so it is left to prove that $x_{n+1}=(-2)^{n+1}(x_0-60)+60$ assuming our inductive hypothesis holds for $n$. Using the recurrence relation, we have \begin{align*} x_{n+1}&=180-2x_n \\ &=180-2((-2)^n(x_0-60)+60) \\ &=(-2)^{n+1}(x_0-60)+60 \end{align*}

Our induction is complete, so for all positive integers $n$, $x_n=(-2)^n(x_0-60)+60$. Identical equalities hold for $y_n$ and $z_n$.

The problem asks for the smallest $n$ such that either $x_n$, $y_n$, or $z_n$ is greater than $90^\circ$. WLOG, let $x_0=60^\circ$, $y_0=59.999^\circ$, and $z_0=60.001^\circ$. Thus, $x_n=60^\circ$ for all $n$, $y_n=-(-2)^n(0.001)+60$, and $z_n=(-2)^n(0.001)+60$. Solving for the smallest possible value of $n$ in each sequence, we find that $n=15$ gives $y_n>90^\circ$. Therefore, the answer is $\boxed{\textbf{(E) } 15}$.

Solution 2

We start from Solution 1 until we reach the recurrence relation $x_n = 180 - 2x_{n - 1}.$ Iterate this again, to get $x_{n - 1} = 180 - 2x_{n - 2}.$ Subtract the two, getting $x_{n} = -x_{n - 1} + 2x_{n - 2}.$ This recurrence has characteristic equation $x^2 + x - 2 = 0 = (x + 2)(x - 1) = 0 \iff x = -2, 1.$ Now, write \[x_n = p + q \cdot (-2)^n.\] We obtain similar recursions for $y, z$ that can be easily solved by getting $x_1, y_1, z_1$ from the original recursive formula and then using those two values to solve for $p$ and $q.$ Then proceed with the last paragraph of Solution 1.

Solution 3 (If you're short on time)

We note that the problem seems quite complicated, but since it is an AMC 12, the difference between the largest angle of $\triangle A_nB_nC_n$ and $60^{\circ}$ (we call this quantity S) most likely reduces to a simpler problem like some repeating sequence. The only obvious sequence (for the answer choices) is a geometric sequence with an integer common ratio. From here, we get that $S_n=0.001S^n$ and we need $S_n>30$. The first power of two greater than $30,000$ is $2^{15}$ thus our answer is $\boxed{\textbf{(E) } 15}$.


Solution 4 (Orthic Triangle)

By angle chasing (abuse those right triangles) and cyclic quadrilaterals, we find that the angles of $\triangle A_nB_nC_n$, in degrees, would be $60$, $60 + 0.001(2^n)$, and $60 - 0.001(2^n)$.


We just need to find the value such that $60 + 0.001(2^n) > 90$.

Thus, we have $0.001(2^n) > 30$, giving $n\geq15$.

Our answer is $\boxed{\textbf{(E) } 15}$.


Note: $\triangle A_nB_nC_n$ is the $orthic$ $triangle$ of $\triangle A_{n-1}B_{n-1}C_{n-1}$, which is made by connecting the foots of altitudes into a triangle as specified in the problem.


~xHypotenuse


Video Solution by Richard Rusczyk

https://artofproblemsolving.com/videos/amc/2019amc12a/497

~ dolphin7

See Also

2019 AMC 12A (Problems • Answer Key • Resources)
Preceded by
Problem 24 		Followed by
Last Problem
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. AMC Logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_AMC_12A_Problems/Problem_25&oldid=262150"