Difference between revisions of "User:Ddk001"
m |
|||
Line 19: | Line 19: | ||
==Problems Sharing Contest== | ==Problems Sharing Contest== | ||
− | Here, you can post all the math problem that you | + | Here, you can post all the math problem that you have. Everyone will try to come up with a appropriate solution. The person with the first solution will post the next problem. I'll start: |
1. There is one and only one perfect square in the form | 1. There is one and only one perfect square in the form | ||
Line 50: | Line 50: | ||
where <math>p</math> and <math>q</math> are prime. Find that perfect square. | where <math>p</math> and <math>q</math> are prime. Find that perfect square. | ||
− | 2. Suppose there is complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy | + | 2.The fraction, |
+ | |||
+ | <math>\frac{ab+bc+ac}{(a+b+c)^2}</math> | ||
+ | |||
+ | where <math>a,b</math> and <math>c</math> are side lengths of a triangle, lies in the interval <math>(p,q]</math>, where <math>p</math> and <math>q</math> are rational numbers. Then, <math>p+q</math> can be expressed as <math>\frac{r}{s}</math>, where <math>r</math> and <math>s</math> are relatively prime positive integers. Find <math>r+s</math>. | ||
+ | |||
+ | 3. Suppose there is complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy | ||
<math>(x_i-\sqrt[3]{13})((x_i-\sqrt[3]{53})(x_i-\sqrt[3]{103})=\frac{1}{3}</math> | <math>(x_i-\sqrt[3]{13})((x_i-\sqrt[3]{53})(x_i-\sqrt[3]{103})=\frac{1}{3}</math> | ||
Line 56: | Line 62: | ||
Find <math>x_{1}^3+x_{2}^3+x_{2}^3</math>. | Find <math>x_{1}^3+x_{2}^3+x_{2}^3</math>. | ||
− | + | 4. Suppose | |
<math>x \equiv 2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6 \pmod{7!}</math> | <math>x \equiv 2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6 \pmod{7!}</math> | ||
Line 62: | Line 68: | ||
Find the remainder when <math>\min{x}</math> is divided by 1000. | Find the remainder when <math>\min{x}</math> is divided by 1000. | ||
− | + | 5. Suppose <math>f(x)</math> is a <math>10000000010</math>-degrees polynomial. The Fundamental Theorem of Algebra tells us that there are <math>10000000010</math> roots, say <math>r_1, r_2, \dots, r_{10000000010}</math>. Suppose all integers <math>n</math> ranging from <math>-1</math> to <math>10000000008</math> satisfies <math>f(n)=n</math>. Also, suppose that | |
<math>(2+r_1)(2+r_2) \dots (2+r_{10000000010})=m!</math> | <math>(2+r_1)(2+r_2) \dots (2+r_{10000000010})=m!</math> | ||
Line 72: | Line 78: | ||
Find the number of factors of the prime <math>999999937</math> in <math>p</math>. | Find the number of factors of the prime <math>999999937</math> in <math>p</math>. | ||
− | + | 6. (Much harder) <math>\Delta ABC</math> is an isosceles triangle where <math>CB=CA</math>. Let the circumcircle of <math>\Delta ABC</math> be <math>\Omega</math>. Then, there is a point <math>E</math> and a point <math>D</math> on circle <math>\Omega</math> such that <math>AD</math> and <math>AB</math> trisects <math>\angle CAE</math> and <math>BE<AE</math>, and point <math>D</math> lies on minor arc <math>BC</math>. Point <math>F</math> is chosen on segment <math>AD</math> such that <math>CF</math> is one of the altitudes of <math>\Delta ACD</math>. Ray <math>CF</math> intersects <math>\Omega</math> at point <math>G</math> (not <math>C</math>) and is extended past <math>G</math> to point <math>I</math>, and <math>IG=AC</math>. Point <math>H</math> is also on <math>\Omega</math> and <math>AH=GI<HB</math>. Let the perpendicular bisector of <math>BC</math> and <math>AC</math> intersect at <math>O</math>. Let <math>J</math> be a point such that <math>OJ</math> is both equal to <math>OA</math> (in length) and is perpendicular to <math>IJ</math> and <math>J</math> is on the same side of <math>CI</math> as <math>A</math>. Let <math>O’</math> be the reflection of point <math>O</math> over line <math>IJ</math>. There exist a circle <math>\Omega_1</math> centered at <math>I</math> and tangent to <math>\Omega</math> at point <math>K</math>. <math>IO’</math> intersect <math>\Omega_1</math> at <math>L</math>. Now suppose <math>O’G</math> intersects <math>\Omega</math> at one distinct point, and <math>O’, G</math>, and <math>K</math> are collinear. If <math>IG^2+IG \cdot GC=\frac{3}{4} IK^2 + \frac{3}{2} IK \cdot O’L + \frac{3}{4} O’L^2</math>, then <math>\frac{EH}{BH}</math> can be expressed in the form <math>\frac{\sqrt{b}}{a} (\sqrt{c} + d)</math>, where <math>b</math> and <math>c</math> are not divisible by the squares of any prime. Find <math>a^2+b^2+c^2+d^2+abcd</math>. | |
Someone mind making a diagram for this? | Someone mind making a diagram for this? | ||
Line 176: | Line 182: | ||
Then, <math>n^2=(p^2+1)(q^2+1)-((pq)^2-pq+1)=p^2+q^2+pq=(p+q)^2-pq \implies pq=(p+q)^2-n^2=(p+q-n)(p+q+n)</math>, so since <math>n=\sqrt{p^2+q^2+pq}>\sqrt{p^2+q^2}</math>, <math>n>p,n>q</math> so <math>p+q-n</math> is less than both <math>p</math> and <math>q</math> and thus we have <math>p+q-n=1</math> and <math>p+q+n=pq</math>. Adding them gives <math>2p+2q=pq+1</math> so by [[Simon's Favorite Factoring Trick]], <math>(p-2)(q-2)=3 \implies (p,q)=(3,5)</math> in some order. Hence, <math>(p^2+1)(q^2+1)-((pq)^2-pq+1)=p^2+q^2+pq=\boxed{049}</math>.<math>\square</math> | Then, <math>n^2=(p^2+1)(q^2+1)-((pq)^2-pq+1)=p^2+q^2+pq=(p+q)^2-pq \implies pq=(p+q)^2-n^2=(p+q-n)(p+q+n)</math>, so since <math>n=\sqrt{p^2+q^2+pq}>\sqrt{p^2+q^2}</math>, <math>n>p,n>q</math> so <math>p+q-n</math> is less than both <math>p</math> and <math>q</math> and thus we have <math>p+q-n=1</math> and <math>p+q+n=pq</math>. Adding them gives <math>2p+2q=pq+1</math> so by [[Simon's Favorite Factoring Trick]], <math>(p-2)(q-2)=3 \implies (p,q)=(3,5)</math> in some order. Hence, <math>(p^2+1)(q^2+1)-((pq)^2-pq+1)=p^2+q^2+pq=\boxed{049}</math>.<math>\square</math> | ||
− | ===Problem | + | ==Problem 2== |
+ | The fraction, | ||
+ | |||
+ | <math>\frac{ab+bc+ac}{(a+b+c)^2}</math> | ||
+ | |||
+ | where <math>a,b</math> and <math>c</math> are side lengths of a triangle, lies in the interval <math>(p,q]</math>, where <math>p</math> and <math>q</math> are rational numbers. Then, <math>p+q</math> can be expressed as <math>\frac{r}{s}</math>, where <math>r</math> and <math>s</math> are relatively prime positive integers. Find <math>r+s</math>. | ||
+ | ==Solution 1(Probably official MAA, lots of proofs)== | ||
+ | ‘‘‘Lemma 1: <math>\text{max} (\frac{ab+bc+ac}{(a+b+c)^2})=\frac{1}{3}</math>’’’ | ||
+ | |||
+ | Proof: Since the sides of triangles have positive length, <math>a,b,c>0</math>. Hence, | ||
+ | |||
+ | <math>\frac{ab+bc+ac}{(a+b+c)^2}>0 \implies \text{max} (\frac{ab+bc+ac}{(a+b+c)^2})= \frac{1}{\text{min} (\frac{(a+b+c)^2}{ab+bc+ac})}</math> | ||
+ | |||
+ | , so now we just need to find <math>\text{min} (\frac{(a+b+c)^2}{ab+bc+ac})</math>. | ||
+ | |||
+ | Since <math>(a-c)^2+(b-c)^2+(a-b)^2 \ge 0</math> by the [[Trivial Inequality]], we have | ||
+ | |||
+ | <math>a^2-2ac+c^2+b^2-2bc+c^2+a^2-2ab+b^2 \ge 0</math> | ||
+ | |||
+ | <math>\implies a^2+b^2+c^2 \ge ac+bc+ab</math> | ||
+ | |||
+ | <math>\implies a^2+b^2+c^2+2(ac+bc+ab) \ge 3(ac+bc+ab)</math> | ||
+ | |||
+ | <math>\implies (a+b+c)^2 \ge 3(ac+bc+ab)</math> | ||
+ | |||
+ | <math>\implies \frac{(a+b+c)^2}{ab+bc+ac} \ge 3</math> | ||
+ | |||
+ | <math>\implies \frac{ab+bc+ac}{(a+b+c)^2} \le \frac{1}{3}</math> | ||
+ | |||
+ | as desired. <math>\square</math> | ||
+ | |||
+ | To show that the minimum value is achievable, we see that if <math>a=b=c</math>, <math>\frac{ab+bc+ac}{(a+b+c)^2}=\frac{1}{3}</math>, so the minimum is thus achievable. | ||
+ | |||
+ | Thus, <math>q=\frac{1}{3}</math>. | ||
+ | |||
+ | ‘‘‘Lemma 2: <math>\frac{ab+bc+ac}{(a+b+c)^2}>\frac{1}{4}</math>’’’ | ||
+ | |||
+ | Proof: By the [[Triangle Inequality]], we have | ||
+ | |||
+ | <math>a+b>c</math> | ||
+ | |||
+ | <math>b+c>a</math> | ||
+ | |||
+ | <math>a+c>b</math>. | ||
+ | |||
+ | Since <math>a,b,c>0</math>, we have | ||
+ | |||
+ | <math>c(a+b)>c^2</math> | ||
+ | |||
+ | <math>a(b+c)>a^2</math> | ||
+ | |||
+ | <math>b(a+c)>b^2</math>. | ||
+ | |||
+ | Add them together gives | ||
+ | |||
+ | <math>a^2+b^2+c^2<c(a+b)+a(b+c)+b(a+c)=2(ab+bc+ac)</math> | ||
+ | |||
+ | <math>\implies a^2+b^2+c^2+2(ab+bc+ac)<4(ab+bc+ac)</math> | ||
+ | |||
+ | <math>\implies (a+b+c)^2<4(ab+bc+ac)</math> | ||
+ | |||
+ | <math>\implies \frac{(a+b+c)^2}{ab+bc+ac}<4</math> | ||
+ | |||
+ | <math>\implies \frac{ab+bc+ac}{(a+b+c)^2}>\frac{1}{4}</math> <math>\square</math> | ||
+ | |||
+ | Even though unallowed, if <math>a=0,b=c</math>, then <math>\frac{ab+bc+ac}{(a+b+c)^2}=\frac{1}{4}</math>, so | ||
+ | |||
+ | <math>\lim_{b=c,a \to 0} (\frac{ab+bc+ac}{(a+b+c)^2})=\frac{1}{4}</math>. | ||
+ | |||
+ | Hence, <math>p=\frac{1}{4}</math>, since by taking <math>b=c</math> and <math>a</math> close <math>0</math>, we can get <math>\frac{ab+bc+ac}{(a+b+c)^2}</math> to be as close to <math>\frac{1}{4}</math> as we wish. | ||
+ | |||
+ | <math>p+q=\frac{1}{3}+\frac{1}{4}=\frac{7}{12} \implies r+s=7+12=\boxed{019}</math> <math>\blacksquare</math> | ||
+ | |||
+ | ==Solution 2 (Fast, risky, no proofs)== | ||
+ | By the [[Principle of Insufficient Reason]], taking <math>a=b=c</math> we get either the max or the min. Testing other values yields that we got the max, so <math>q=\frac{1}{3}</math>. Another extrema must occur when one of <math>a,b,c</math> (WLOG, <math>a</math>) is <math>0</math>. Again, using the logic of solution 1 we see <math>p=\frac{1}{4}</math> so <math>p+q=\frac{7}{12}</math> so our answer is <math>\boxed{019}</math>. <math>\square</math> | ||
+ | |||
+ | ===Problem 3=== | ||
Suppose there are complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy | Suppose there are complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy | ||
Line 234: | Line 316: | ||
Note: If you don't know [[Newton's Sums]], you can also use [[Vieta's Formulas]] to bash. | Note: If you don't know [[Newton's Sums]], you can also use [[Vieta's Formulas]] to bash. | ||
− | ===Problem | + | ===Problem 4=== |
Suppose | Suppose | ||
Line 273: | Line 355: | ||
Solving yields <math>x \equiv 2\boxed{736} \pmod{7!}</math>, and we're done. <math>\square</math> | Solving yields <math>x \equiv 2\boxed{736} \pmod{7!}</math>, and we're done. <math>\square</math> | ||
− | ===Problem | + | ===Problem 5=== |
Suppose <math>f(x)</math> is a <math>10000000010</math>-degrees polynomial. The [[Fundamental Theorem of Algebra]] tells us that there are <math>10000000010</math> roots, say <math>r_1, r_2, \dots, r_{10000000010}</math>. Suppose all integers <math>n</math> ranging from <math>-1</math> to <math>10000000008</math> satisfies <math>f(n)=n</math>. Also, suppose that | Suppose <math>f(x)</math> is a <math>10000000010</math>-degrees polynomial. The [[Fundamental Theorem of Algebra]] tells us that there are <math>10000000010</math> roots, say <math>r_1, r_2, \dots, r_{10000000010}</math>. Suppose all integers <math>n</math> ranging from <math>-1</math> to <math>10000000008</math> satisfies <math>f(n)=n</math>. Also, suppose that | ||
Line 333: | Line 415: | ||
, so there is <math>\left\lfloor \frac{10000000010}{999999937} \right\rfloor=\boxed{011}</math> factors of <math>999999937</math>. <math>\square</math> | , so there is <math>\left\lfloor \frac{10000000010}{999999937} \right\rfloor=\boxed{011}</math> factors of <math>999999937</math>. <math>\square</math> | ||
− | ===Problem | + | ===Problem 6=== |
<math>\Delta ABC</math> is an isosceles triangle where <math>CB=CA</math>. Let the circumcircle of <math>\Delta ABC</math> be <math>\Omega</math>. Then, there is a point <math>E</math> and a point <math>D</math> on circle <math>\Omega</math> such that <math>AD</math> and <math>AB</math> trisects <math>\angle CAE</math> and <math>BE<AE</math>, and point <math>D</math> lies on minor arc <math>BC</math>. Point <math>F</math> is chosen on segment <math>AD</math> such that <math>CF</math> is one of the altitudes of <math>\Delta ACD</math>. Ray <math>CF</math> intersects <math>\Omega</math> at point <math>G</math> (not <math>C</math>) and is extended past <math>G</math> to point <math>I</math>, and <math>IG=AC</math>. Point <math>H</math> is also on <math>\Omega</math> and <math>AH=GI<HB</math>. Let the perpendicular bisector of <math>BC</math> and <math>AC</math> intersect at <math>O</math>. Let <math>J</math> be a point such that <math>OJ</math> is both equal to <math>OA</math> (in length) and is perpendicular to <math>IJ</math> and <math>J</math> is on the same side of <math>CI</math> as <math>A</math>. Let <math>O’</math> be the reflection of point <math>O</math> over line <math>IJ</math>. There exist a circle <math>\Omega_1</math> centered at <math>I</math> and tangent to <math>\Omega</math> at point <math>K</math>. <math>IO’</math> intersect <math>\Omega_1</math> at <math>L</math>. Now suppose <math>O’G</math> intersects <math>\Omega</math> at one distinct point, and <math>O’, G</math>, and <math>K</math> are collinear. If <math>IG^2+IG \cdot GC=\frac{3}{4} IK^2 + \frac{3}{2} IK \cdot O’L + \frac{3}{4} O’L^2</math>, then <math>\frac{EH}{BH}</math> can be expressed in the form <math>\frac{\sqrt{b}}{a} (\sqrt{c} + d)</math>, where <math>b</math> and <math>c</math> are not divisible by the squares of any prime. Find <math>a^2+b^2+c^2+d^2+abcd</math>. | <math>\Delta ABC</math> is an isosceles triangle where <math>CB=CA</math>. Let the circumcircle of <math>\Delta ABC</math> be <math>\Omega</math>. Then, there is a point <math>E</math> and a point <math>D</math> on circle <math>\Omega</math> such that <math>AD</math> and <math>AB</math> trisects <math>\angle CAE</math> and <math>BE<AE</math>, and point <math>D</math> lies on minor arc <math>BC</math>. Point <math>F</math> is chosen on segment <math>AD</math> such that <math>CF</math> is one of the altitudes of <math>\Delta ACD</math>. Ray <math>CF</math> intersects <math>\Omega</math> at point <math>G</math> (not <math>C</math>) and is extended past <math>G</math> to point <math>I</math>, and <math>IG=AC</math>. Point <math>H</math> is also on <math>\Omega</math> and <math>AH=GI<HB</math>. Let the perpendicular bisector of <math>BC</math> and <math>AC</math> intersect at <math>O</math>. Let <math>J</math> be a point such that <math>OJ</math> is both equal to <math>OA</math> (in length) and is perpendicular to <math>IJ</math> and <math>J</math> is on the same side of <math>CI</math> as <math>A</math>. Let <math>O’</math> be the reflection of point <math>O</math> over line <math>IJ</math>. There exist a circle <math>\Omega_1</math> centered at <math>I</math> and tangent to <math>\Omega</math> at point <math>K</math>. <math>IO’</math> intersect <math>\Omega_1</math> at <math>L</math>. Now suppose <math>O’G</math> intersects <math>\Omega</math> at one distinct point, and <math>O’, G</math>, and <math>K</math> are collinear. If <math>IG^2+IG \cdot GC=\frac{3}{4} IK^2 + \frac{3}{2} IK \cdot O’L + \frac{3}{4} O’L^2</math>, then <math>\frac{EH}{BH}</math> can be expressed in the form <math>\frac{\sqrt{b}}{a} (\sqrt{c} + d)</math>, where <math>b</math> and <math>c</math> are not divisible by the squares of any prime. Find <math>a^2+b^2+c^2+d^2+abcd</math>. | ||
Revision as of 15:51, 8 January 2024
Contents
User Counts
If this is you first time visiting this page, please change the number below by one. (Add 1, do NOT subtract 1)
(Please don't mess with the user count)
Doesn't that look like a number on a pyramid?
Cool asyptote graphs
Asymptote is fun!
Problems Sharing Contest
Here, you can post all the math problem that you have. Everyone will try to come up with a appropriate solution. The person with the first solution will post the next problem. I'll start:
1. There is one and only one perfect square in the form
where and are prime. Find that perfect square. (DO NOT LOOK AT MY SOLUTIONS)
Contibutions
2022 AMC 12B Problems/Problem 25 Solution 5 (Now it's solution 6)
2023 AMC 12B Problems/Problem 20 Solution 3
2016 AIME I Problems/Problem 10 Solution 3
2017 AIME I Problems/Problem 14 Solution 2
2019 AIME I Problems/Problem 15 Solution 6
2022 AIME II Problems/Problem 3 Solution 3
Problems I made
1. (Much easier) There is one and only one perfect square in the form
where and are prime. Find that perfect square.
2.The fraction,
where and are side lengths of a triangle, lies in the interval , where and are rational numbers. Then, can be expressed as , where and are relatively prime positive integers. Find .
3. Suppose there is complex values and that satisfy
Find .
4. Suppose
Find the remainder when is divided by 1000.
5. Suppose is a -degrees polynomial. The Fundamental Theorem of Algebra tells us that there are roots, say . Suppose all integers ranging from to satisfies . Also, suppose that
for an integer . If is the minimum possible positive integral value of
.
Find the number of factors of the prime in .
6. (Much harder) is an isosceles triangle where . Let the circumcircle of be . Then, there is a point and a point on circle such that and trisects and , and point lies on minor arc . Point is chosen on segment such that is one of the altitudes of . Ray intersects at point (not ) and is extended past to point , and . Point is also on and . Let the perpendicular bisector of and intersect at . Let be a point such that is both equal to (in length) and is perpendicular to and is on the same side of as . Let be the reflection of point over line . There exist a circle centered at and tangent to at point . intersect at . Now suppose intersects at one distinct point, and , and are collinear. If , then can be expressed in the form , where and are not divisible by the squares of any prime. Find .
Someone mind making a diagram for this?
I will leave a big gap below this sentence so you won't see the answers accidentally.
dsf
fsd
Answer key
1. 049
2. 170
3. 736
4. 011
5. 054
Solutions
Problem 1
There is one and only one perfect square in the form
where and is prime. Find that perfect square.
Solution 1
. Suppose . Then, , so since , so is less than both and and thus we have and . Adding them gives so by Simon's Favorite Factoring Trick, in some order. Hence, .
Problem 2
The fraction,
where and are side lengths of a triangle, lies in the interval , where and are rational numbers. Then, can be expressed as , where and are relatively prime positive integers. Find .
Solution 1(Probably official MAA, lots of proofs)
‘‘‘Lemma 1: ’’’
Proof: Since the sides of triangles have positive length, . Hence,
, so now we just need to find .
Since by the Trivial Inequality, we have
as desired.
To show that the minimum value is achievable, we see that if , , so the minimum is thus achievable.
Thus, .
‘‘‘Lemma 2: ’’’
Proof: By the Triangle Inequality, we have
.
Since , we have
.
Add them together gives
Even though unallowed, if , then , so
.
Hence, , since by taking and close , we can get to be as close to as we wish.
Solution 2 (Fast, risky, no proofs)
By the Principle of Insufficient Reason, taking we get either the max or the min. Testing other values yields that we got the max, so . Another extrema must occur when one of (WLOG, ) is . Again, using the logic of solution 1 we see so so our answer is .
Problem 3
Suppose there are complex values and that satisfy
Find .
Solution 1
To make things easier, instead of saying , we say .
Now, we have . Expanding gives
.
To make things even simpler, let , so that .
Then, if , Newton's Sums gives
Therefore,
Now, we plug in
.
As we have done many times before, we substitute to get
.
Note: If you don't know Newton's Sums, you can also use Vieta's Formulas to bash.
Problem 4
Suppose
Find the remainder when is divided by 1000.
Solution 1 (Euler's Totient Theorem)
We first simplify
so
.
where the last step of all 3 congruences hold by the Euler's Totient Theorem. Hence,
Now, you can bash through solving linear congruences, but there is a smarter way. Notice that , and . Hence, , so . With this in mind, we proceed with finding .
Notice that and that . Therefore, we obtain the system of congruences :
.
Solving yields , and we're done.
Problem 5
Suppose is a -degrees polynomial. The Fundamental Theorem of Algebra tells us that there are roots, say . Suppose all integers ranging from to satisfies . Also, suppose that
for an integer . If is the minimum possible positive integral value of
.
Find the number of factors of the prime in .
Solution 1
Since all integers ranging from to satisfies , we have that all integers ranging from to satisfies , so by the Factor Theorem,
.
since is a -degrees polynomial, and we let to be the leading coefficient of .
Also note that since is the roots of ,
Now, notice that
Similarly, we have
To minimize this, we minimize . The minimum can get is when , in which case
, so there is factors of .
Problem 6
is an isosceles triangle where . Let the circumcircle of be . Then, there is a point and a point on circle such that and trisects and , and point lies on minor arc . Point is chosen on segment such that is one of the altitudes of . Ray intersects at point (not ) and is extended past to point , and . Point is also on and . Let the perpendicular bisector of and intersect at . Let be a point such that is both equal to (in length) and is perpendicular to and is on the same side of as . Let be the reflection of point over line . There exist a circle centered at and tangent to at point . intersect at . Now suppose intersects at one distinct point, and , and are collinear. If , then can be expressed in the form , where and are not divisible by the squares of any prime. Find .
Someone mind making a diagram for this?
Solution 1
Line is tangent to with point of tangency point because and is perpendicular to so this is true by the definition of tangent lines. Both and are on and line , so intersects at both and , and since we’re given intersects at one distinct point, and are not distinct, hence they are the same point.
Now, if the center of tangent circles are connected, the line segment will pass through the point of tangency. In this case, if we connect the center of tangent circles, and ( and respectively), it is going to pass through the point of tangency, namely, , which is the same point as , so , , and are concurrent. Hence, and are on both lines and , so passes through point , making a diameter of .
Now we state a few claims :
Claim 1: is equilateral.
Proof:
where the last equality holds by the Power of a Point Theorem.
Taking the square root of each side yields .
Since, by the definition of point , is on . Hence, , so
, and since is the reflection of point over line , , and since , by the Pythagorean Theorem we have
Since is the perpendicular bisector of , and we have hence is equilateral.
With this in mind, we see that
Here, we state another claim :
Claim 2 : is a diameter of
Proof: Since , we have
and the same reasoning with gives since .
Now, apply Ptolemy’s Theorem gives
so is a diameter.
From that, we see that , so . Now,
, so
, so
, and we’re done.
Note: All angle measures are in degrees