Showing posts with label triangle. Show all posts
Showing posts with label triangle. Show all posts
Saturday, July 14, 2018
Maximum point above triangle
In triangle $ABC$, $AD$ is an internal bisector. Choose point $X$ on $DA$'s extension, and let $Y,Z$ be on $XB$ and $XC$ so that $AY \perp XB$ and $AZ \perp XC$. Define $f(X)$ as:
$$f(X) = \frac{AY}{XB} + \frac{AZ}{XC}$$
Find the point $X*$ along $DA$'s extension such that $f(X*)$ is maximum.
Solution
Let $\theta = \angle XAB = \angle XAC$. Easy to see that $\pi/2 < \theta < \pi$. Let $x = AX$.
Area of $\triangle ABX$ =
$$\frac{1}{2}cx \sin \theta = \frac{1}{2} XB.AY$$
So:
$$\frac{AY}{XB} = \frac{cx \sin \theta}{XB^2} = \frac{cx\sin \theta}{c^2+x^2-2cx \cos \theta}$$
And likewise:
$$\frac{AZ}{XC} = \frac{bx\sin \theta}{b^2+x^2-2bx \cos \theta}$$
Now suppose WLOG $c > b$ and $c = tb$ (with $t > 1$). Then we need to maximize:
$$\frac{cx}{c^2+x^2-2cx \cos \theta} + \frac{bx}{b^2+x^2-2bx \cos \theta}$$
$$ \frac{\frac{x}{bt}}{(\frac{x}{bt})^2 + 1 - 2 t\frac{x}{bt}\cos \theta }+\frac{\frac{x}{b}}{(\frac{x}{b})^2 + 1 - 2 \frac{x}{b}\cos \theta }$$
So if we let $y = x/b$, and $r = -2 \cos \theta$ (which means $0 < r < 2$), and $g(s) = s/(s^2+rs+1)$ then the problem is akin to finding the minimum of the following function for $y > 0$:
$$h(y) = g(y) + g(\frac{y}{t})$$
Thursday, November 18, 2010
Triangular (and tetrahedral) lattice
An equilateral triangle $ABC$ with side $n$ a positive integer is divided into triangular lattice consisting of unit triangles.
Each point on the lattice is colored red, white, or blue such that:
1. No point on $AB$ is colored red
2. No point on $BC$ is colored blue
3. No point on $AC$ is colored white
Prove that there exists a unit triangle whose vertices are colored with 3 different colors.
Challenge problem: Same problem but for tetrahedron and four colors.
Solution
We first state the one-dimensional version of this problem:
Given a sequence of points on a line colored red or blue, and the first point must be colored red, and the last point must be colored blue, then we have an ODD number of segments that has two differently-colored end points.
This one-dimensional version is trivial to prove.
Now we turn to the 2-dimensional version as stated in the problem.
For each side that has both red and blue endpoints, we "mark" that side.
Then for each unit triangle, we give it a score based on how many marked sides it has. Now, if we consider the "outside" area as another "surrogate unit triangle", then we can also give it a score based on how many marked sides are facing the outside.
First, note that the total score of all areas must be even, since any marked side contribute one score to two areas.
Now, applying the 1-dimensional version of the problem, we know that side AC has an odd number of marked sides. Side AB and BC does not have any marked sides. So the outside area has an odd score. Thus, there is an odd number of unit triangles that has an odd score. In order for a unit triangle to have an odd score, it must have three differently-colored vertices.
Each point on the lattice is colored red, white, or blue such that:
1. No point on $AB$ is colored red
2. No point on $BC$ is colored blue
3. No point on $AC$ is colored white
Prove that there exists a unit triangle whose vertices are colored with 3 different colors.
Challenge problem: Same problem but for tetrahedron and four colors.
Solution
We first state the one-dimensional version of this problem:
Given a sequence of points on a line colored red or blue, and the first point must be colored red, and the last point must be colored blue, then we have an ODD number of segments that has two differently-colored end points.
This one-dimensional version is trivial to prove.
Now we turn to the 2-dimensional version as stated in the problem.
For each side that has both red and blue endpoints, we "mark" that side.
Then for each unit triangle, we give it a score based on how many marked sides it has. Now, if we consider the "outside" area as another "surrogate unit triangle", then we can also give it a score based on how many marked sides are facing the outside.
First, note that the total score of all areas must be even, since any marked side contribute one score to two areas.
Now, applying the 1-dimensional version of the problem, we know that side AC has an odd number of marked sides. Side AB and BC does not have any marked sides. So the outside area has an odd score. Thus, there is an odd number of unit triangles that has an odd score. In order for a unit triangle to have an odd score, it must have three differently-colored vertices.
Labels:
coloring,
Combinatorics,
graph theory,
lattice,
parity,
tetrahedron,
triangle
Monday, June 28, 2010
Circumcircle and Incircle Tangency
Given a triangle $ABC$, its circumcircle $C_O$ and incircle $C_I$. Suppose $X,Y,Z$ are points on $C_O$ such that $XY$ and $XZ$ are tangent to $C_I$, prove that $YZ$ is also tangent to $C_I$.
Solution
Let us denote $R$ to be the radius of $C_O$ and $r$ to be the radius of $C_I$. Also let $O$ and $I$ to be the centers of the circle. Let also
Suppose $AB$ is tangent to $C_I$ at $L$. And suppose $AI$ meets $C_O$ at $M$ and $MO$ meets $C_O$ at $N$.
Now suppose $a = \angle MAZ = \angle MAB = \angle MNC = \angle MCB$. Because $\angle ALI = \angle MCN = 90^o$ then by similarity of $\triangle ALI$ and $\triangle MNC$ we have:
$$AI.MC = MN.LI = 2Rr$$
Now $\angle MIC = \angle IAC + \angle ACI = x + \angle ACI = \angle MCB + \angle ICB = \angle MCI$ so that we know $MC = MI$.
Thus:
$$AI.MI = 2Rr$$
Now, we draw similar figures to the triangle $X,Y,Z$. That is: $XY$ is tangent to $C_I$ at $L'$. And suppose $XI$ meets $C_O$ at $M'$ and $M'O$ meets $C_O$ at $N'$.
In our analysis above, we showed that $AI.MC = 2Rr$ but we didn't use the fact that $BC$ is tangent to $C_I$, so we can repeat the argument to claim that $$XI.M'Z = 2Rr$$.
On the other hand, $XI.IM' = AI.IM = 2Rr$ so we have $IM' = M'Z$ which means $IM'Z$ is an isosceles.
$$\angle M'IZ = \angle M'ZI$$
$$\angle M'XZ + \angle IZX = \angle M'ZY + \angle YZI$$
Because $XY$ and $XZ$ are both tangent to $C_I$ then $XM$ is a bisector of $\angle YXZ$ so that $\angle M'XZ = \angle M'XY = \angle M'ZY$. So our equation above becomes:
$$\angle IZX = \angle YZI$$
which means $ZI$ is also internal angle bisector, which means $YZ$ is tangent to $C_I$.
Monday, May 31, 2010
Triangle Inequality
Given a triangle $ABC$ and a point $M$ inside the triangle.
Let $\alpha = \angle BMC, \beta = \angle AMC, \gamma = \angle AMB$
Prove that:
$$\frac{AM}{BM.CM} + \frac{BM}{CM.AM} + \frac{CM}{AM.BM} \geq -2 \left( \frac{\cos \alpha}{AM} + \frac{\cos \beta}{BM} + \frac{\cos \gamma}{CM} \right)$$
Solution In Progress
Let
$a = \frac{AM}{\sin \alpha}, b = \frac{BM}{\sin \beta}, c = \frac{CM}{\sin \gamma}$
Because $M$ is in the interior of the triangle, then $0 < \alpha, \beta, \gamma < \pi$ and thus $0 < \sin \alpha, \sin \beta, \sin \gamma \leq 1$. Thus $a,b,c > 0$. Without loss of generality, we may assume that $a \geq b \geq c$.
So we have:
$AM = a \sin \alpha, BM = b \sin \beta, CM = c \sin \gamma$
Substitute it to our inequality, and use the following shorthand:
$C_\alpha = \cos \alpha \sin \beta \sin \gamma$
$C_\beta = \sin \alpha \cos \beta \sin \gamma$
$C_\gamma = \sin \alpha \sin \beta \cos \gamma$
So our inequality becomes
$$ \iff a^2\sin^2 \alpha + b^2 \sin^2 \beta + c^2 \sin^2 \gamma +2 ( bc C_\alpha + ac C_\beta + ab C_\gamma ) \geq 0$$
Note the following identities:
$$C_\beta + C_\gamma = \sin \alpha \cos \beta \sin \gamma + \sin \alpha \sin \beta \cos \gamma = \sin \alpha \sin (\beta + \gamma) = \sin \alpha \sin (2 \pi - (\beta + \gamma)) = - \sin^2 \alpha$$
Similarly,
$$C_\alpha + C_\gamma = - \sin^2 \beta$$
$$C_\alpha + C_\beta = - \sin^2 \gamma$$
So that
$$C_\alpha = (\sin^2 \alpha - \sin^2 \beta - \sin^2 \gamma)/2$$
$$C_\beta = (\sin^2 \beta - \sin^2 \alpha - \sin^2 \gamma)/2$$
$$C_\gamma = (\sin^2 \gamma - \sin^2 \beta - \sin^2 \alpha)/2$$
Substituting back to our inequalities, we have:
$$\iff (a-b)(a-c)\sin^2 \alpha + (b-a)(b-c) \sin^2 \beta + (c-a)(c-b) \sin^2 \gamma \geq 0$$
It's also equivalent to:
$$\iff (a-b)^2 C_\gamma + (a-c)^2 C_\beta + (b-c)^2 C_\alpha \leq 0$$
Let $\alpha = \angle BMC, \beta = \angle AMC, \gamma = \angle AMB$
Prove that:
$$\frac{AM}{BM.CM} + \frac{BM}{CM.AM} + \frac{CM}{AM.BM} \geq -2 \left( \frac{\cos \alpha}{AM} + \frac{\cos \beta}{BM} + \frac{\cos \gamma}{CM} \right)$$
Solution In Progress
Let
$a = \frac{AM}{\sin \alpha}, b = \frac{BM}{\sin \beta}, c = \frac{CM}{\sin \gamma}$
Because $M$ is in the interior of the triangle, then $0 < \alpha, \beta, \gamma < \pi$ and thus $0 < \sin \alpha, \sin \beta, \sin \gamma \leq 1$. Thus $a,b,c > 0$. Without loss of generality, we may assume that $a \geq b \geq c$.
So we have:
$AM = a \sin \alpha, BM = b \sin \beta, CM = c \sin \gamma$
Substitute it to our inequality, and use the following shorthand:
$C_\alpha = \cos \alpha \sin \beta \sin \gamma$
$C_\beta = \sin \alpha \cos \beta \sin \gamma$
$C_\gamma = \sin \alpha \sin \beta \cos \gamma$
So our inequality becomes
$$ \iff a^2\sin^2 \alpha + b^2 \sin^2 \beta + c^2 \sin^2 \gamma +2 ( bc C_\alpha + ac C_\beta + ab C_\gamma ) \geq 0$$
Note the following identities:
$$C_\beta + C_\gamma = \sin \alpha \cos \beta \sin \gamma + \sin \alpha \sin \beta \cos \gamma = \sin \alpha \sin (\beta + \gamma) = \sin \alpha \sin (2 \pi - (\beta + \gamma)) = - \sin^2 \alpha$$
Similarly,
$$C_\alpha + C_\gamma = - \sin^2 \beta$$
$$C_\alpha + C_\beta = - \sin^2 \gamma$$
So that
$$C_\alpha = (\sin^2 \alpha - \sin^2 \beta - \sin^2 \gamma)/2$$
$$C_\beta = (\sin^2 \beta - \sin^2 \alpha - \sin^2 \gamma)/2$$
$$C_\gamma = (\sin^2 \gamma - \sin^2 \beta - \sin^2 \alpha)/2$$
Substituting back to our inequalities, we have:
$$\iff (a-b)(a-c)\sin^2 \alpha + (b-a)(b-c) \sin^2 \beta + (c-a)(c-b) \sin^2 \gamma \geq 0$$
It's also equivalent to:
$$\iff (a-b)^2 C_\gamma + (a-c)^2 C_\beta + (b-c)^2 C_\alpha \leq 0$$
Wednesday, May 12, 2010
Triangle Inequality
In a triangle $ABC$, let $a = BC, b = AC, c = AB$. For any point $M$ and real numbers $x,y,z$, show that
$(x+y+z)(xMA^2 + yMB^2 + zMC^2) \geq xyc^2 + xzb^2 + yza^2$
Solution
We shall show that the inequality above is equivalent to
$$(x \vec{MA} + y \vec{MB} + z \vec{MC})^2 \geq 0$$
Indeed, since:
$$2\vec{MA} \vec{MB} = MA^2 + MB^2 - c^2$$
so
$$2xy\vec{MA} \vec{MB} = xyMA^2 + xyMB^2 - xyc^2$$
$$2yz\vec{MB} \vec{MC} = yzMB^2 + yzMC^2 - yza^2$$
$$2zx\vec{MC} \vec{MA} = zxMC^2 + zxMA^2 - zxb^2$$
Adding them, we obtain:
$$RHS = \sum x(y+z)MA^2 - 2\sum xy \vec{MA} \vec{MB}$$
So
$$LHS - RHS = \sum x^2MA^2 + \sum x(y+z)MA^2 - RHS = \sum x^2 MA^2 + 2\sum xy \vec{MA} \vec{MB}$$
$$= (x \vec{MA} + y \vec{MB} + z \vec{MC})^2 \geq 0 $$
$(x+y+z)(xMA^2 + yMB^2 + zMC^2) \geq xyc^2 + xzb^2 + yza^2$
Solution
We shall show that the inequality above is equivalent to
$$(x \vec{MA} + y \vec{MB} + z \vec{MC})^2 \geq 0$$
Indeed, since:
$$2\vec{MA} \vec{MB} = MA^2 + MB^2 - c^2$$
so
$$2xy\vec{MA} \vec{MB} = xyMA^2 + xyMB^2 - xyc^2$$
$$2yz\vec{MB} \vec{MC} = yzMB^2 + yzMC^2 - yza^2$$
$$2zx\vec{MC} \vec{MA} = zxMC^2 + zxMA^2 - zxb^2$$
Adding them, we obtain:
$$RHS = \sum x(y+z)MA^2 - 2\sum xy \vec{MA} \vec{MB}$$
So
$$LHS - RHS = \sum x^2MA^2 + \sum x(y+z)MA^2 - RHS = \sum x^2 MA^2 + 2\sum xy \vec{MA} \vec{MB}$$
$$= (x \vec{MA} + y \vec{MB} + z \vec{MC})^2 \geq 0 $$
Labels:
center of mass,
Geometry,
gravity,
homogeneous,
Inequality,
triangle,
vector
Sunday, November 22, 2009
Triangle Inequality
Given $n$ right triangles each with sides $a_i, b_i, c_i$, with $c_i$ being the hypotenuse ($i=1,\cdots, n)$. Let $A = \sum a_i, B = \sum b_i, C= \sum c_i$.
Prove that
$\displaystyle \frac{a_1b_1}{c_1} + \cdots + \frac{a_nb_n}{c_n} \leq \frac{AB}{\sqrt{A^2+B^2}}$
Harder version: prove that
$\displaystyle \frac{a_1b_1}{c_1} + \cdots + \frac{a_nb_n}{c_n} \leq \frac{AB}{C}$
Prove that
$\displaystyle \frac{a_1b_1}{c_1} + \cdots + \frac{a_nb_n}{c_n} \leq \frac{AB}{\sqrt{A^2+B^2}}$
Harder version: prove that
$\displaystyle \frac{a_1b_1}{c_1} + \cdots + \frac{a_nb_n}{c_n} \leq \frac{AB}{C}$
Thursday, September 24, 2009
a b c sides of a triangle, perimeter less than 2
If $a,b,c$ are sides of a triangle whose perimeter is less than 2, prove that:
$\displaystyle \frac{(1+a)(1+b)(1+c)}{(1-a)(1-b)(1-c)} < \frac{(2+a+b+c)^2}{(2-(a+b+c))^2}$
$\displaystyle \frac{(1+a)(1+b)(1+c)}{(1-a)(1-b)(1-c)} < \frac{(2+a+b+c)^2}{(2-(a+b+c))^2}$
Labels:
Add new tag,
convex,
Inequality,
lemma,
majorization,
perimeter,
ravi's substitution,
Solved,
strict inequality,
triangle
Subscribe to:
Posts (Atom)