https://artofproblemsolving.com/wiki/api.php?action=feedcontributions&user=Ultraman&feedformat=atomAoPS Wiki - User contributions [en]2024-03-19T13:15:33ZUser contributionsMediaWiki 1.31.1https://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=129037User:Ultraman2020-07-24T13:54:24Z<p>Ultraman: Blanked the page</p>
<hr />
<div></div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2019_IMO_Problems/Problem_6&diff=1265172019 IMO Problems/Problem 62020-06-25T21:04:49Z<p>Ultraman: /* Problem */</p>
<hr />
<div>==Problem==<br />
Let <math>I</math> be the incenter of acute triangle <math>ABC</math> with <math>AB \neq AC</math>. The incircle <math>\omega</math> of <math>ABC</math> is tangent to sides <math>BC</math>, <math>CA</math>, and <math>AB</math> at <math>D</math>, <math>E</math>, and <math>F</math>, respectively. The line through <math>D</math> perpendicular to <math>EF</math> meets ω again at <math>R</math>. Line <math>AR</math> meets ω again at <math>P</math>. The circumcircles of triangles <math>PCE</math> and <math>PBF</math> meet again at <math>Q</math>.<br />
Prove that lines <math>DI</math> and <math>PQ</math> meet on the line through <math>A</math> perpendicular to <math>AI</math>.</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2019_IMO_Problems/Problem_6&diff=1230532019 IMO Problems/Problem 62020-05-27T03:34:24Z<p>Ultraman: /* Problem */</p>
<hr />
<div>==Problem==<br />
Let <math>I</math> be the incenter of acute triangle <math>ABC</math> with <math>AB \neq AC</math>. The incircle ω of <math>ABC</math> is tangent to sides <math>BC</math>, <math>CA</math>, and <math>AB</math> at <math>D</math>, <math>E</math>, and <math>F</math>, respectively. The line through <math>D</math> perpendicular to <math>EF</math> meets ω again at <math>R</math>. Line <math>AR</math> meets ω again at <math>P</math>. The circumcircles of triangles <math>PCE</math> and <math>PBF</math> meet again at <math>Q</math>.<br />
Prove that lines <math>DI</math> and <math>PQ</math> meet on the line through <math>A</math> perpendicular to <math>AI</math>.</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2019_IMO_Problems/Problem_6&diff=1230522019 IMO Problems/Problem 62020-05-27T03:31:14Z<p>Ultraman: /* Problem */</p>
<hr />
<div>==Problem==<br />
Let <math>I</math> be the incenter of acute triangle <math>ABC</math> with <math>AB \neq AC</math>. The incircle ω of <math>ABC</math> is tangent to sides <math>BC</math>, <math>CA</math>, and <math>AB</math> at <math>D</math>, <math>E</math>, and <math>F</math>, respectively. The line through <math>D</math> perpendicular to <math>EF</math> meets ω again at <math>R</math>. Line <math>AR</math> meets ω again at P. The circumcircles of triangles PCE and PBF meet again at Q.<br />
Prove that lines <math>DI</math> and <math>PQ</math> meet on the line through <math>A</math> perpendicular to <math>AI</math>.</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2019_IMO_Problems/Problem_6&diff=1230512019 IMO Problems/Problem 62020-05-27T03:27:38Z<p>Ultraman: Created page with "==Problem== Let I be the incentre of acute triangle ABC with AB ̸= AC. The incircle ω of ABC is tangent to sides BC, CA, and AB at D, E, and F, respectively. The line throug..."</p>
<hr />
<div>==Problem==<br />
Let I be the incentre of acute triangle ABC with AB ̸= AC. The incircle ω of ABC is tangent to sides BC, CA, and AB at D, E, and F, respectively. The line through D perpendicular to EF meets ω again at R. Line AR meets ω again at P. The circumcircles of triangles PCE and PBF meet again at Q.<br />
Prove that lines DI and PQ meet on the line through A perpendicular to AI.</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=119835User:Ultraman2020-03-20T02:19:00Z<p>Ultraman: /* About Me */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, doing maths, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[2020 AMC 10A Problems/Problem 20]]<br />
<br />
[[2015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 1]]<br />
<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1166462020 AMC 10A Problems/Problem 202020-02-02T20:05:29Z<p>Ultraman: /* Solution 1 (Just Drop An Altitude) */</p>
<hr />
<div>{{duplicate|[[2020 AMC 12A Problems|2020 AMC 12A #18]] and [[2020 AMC 10A Problems|2020 AMC 10A #20]]}}<br />
<br />
== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution 1 (Just Drop An Altitude)==<br />
<br />
<asy><br />
size(15cm,0);<br />
import olympiad;<br />
draw((0,0)--(0,2)--(6,4)--(4,0)--cycle);<br />
label("A", (0,2), NW);<br />
label("B", (0,0), SW);<br />
label("C", (4,0), SE);<br />
label("D", (6,4), NE);<br />
label("E", (1.714,1.143), N);<br />
label("F", (1,1.5), N);<br />
draw((0,2)--(4,0), dashed);<br />
draw((0,0)--(6,4), dashed);<br />
draw((0,0)--(1,1.5), dashed);<br />
label("20", (0,2)--(4,0), SW);<br />
label("30", (4,0)--(6,4), SE);<br />
label("$x$", (1,1.5)--(1.714,1.143), NE);<br />
draw(rightanglemark((0,2),(0,0),(4,0)));<br />
draw(rightanglemark((0,2),(4,0),(6,4)));<br />
draw(rightanglemark((0,0),(1,1.5),(0,2)));<br />
</asy><br />
<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {\textbf{(D) }360}</math><br />
<br />
(I'm very sorry if you're a visual learner but now you have a diagram by ciceronii)<br />
<br />
~ Solution by Ultraman<br />
<br />
~ Diagram by ciceronii<br />
<br />
==Solution 2 (Pro Guessing Strats)==<br />
We know that the big triangle has area 300. Use the answer choices which would mean that the area of the little triangle is a multiple of 10. Thus the product of the legs is a multiple of 20. Guess that the legs are equal to <math>\sqrt{20a}</math> and <math>\sqrt{20b}</math>, and because the hypotenuse is 20 we get <math>a+b=20</math>. Testing small numbers, we get that when <math>a=2</math> and <math>b=18</math>, <math>ab</math> is indeed a square. The area of the triangle is thus 60, so the answer is <math>\boxed {\textbf{(D) }360}</math>.<br />
<br />
~tigershark22<br />
~(edited by HappyHuman)<br />
<br />
==Solution 3 (coordinates)==<br />
<asy><br />
size(10cm,0);<br />
draw((10,30)--(10,0)--(-8,-6)--(-10,0)--(10,30));<br />
draw((-20,0)--(20,0));<br />
draw((0,-15)--(0,35));<br />
draw((10,30)--(-8,-6));<br />
draw(circle((0,0),10));<br />
label("E",(-4.05,-.25),S);<br />
label("D",(10,30),NE);<br />
label("C",(10,0),NE);<br />
label("B",(-8,-6),SW);<br />
label("A",(-10,0),NW);<br />
label("5",(-10,0)--(-5,0), NE);<br />
label("15",(-5,0)--(10,0), N);<br />
label("30",(10,0)--(10,30), E);<br />
dot((-5,0));<br />
dot((-10,0));<br />
dot((-8,-6));<br />
dot((10,0));<br />
dot((10,30));<br />
</asy><br />
Let the points be <math>A(-10,0)</math>, <math>\:B(x,y)</math>, <math>\:C(10,0)</math>, <math>\:D(10,30)</math>,and <math>\:E(-5,0)</math>, respectively. Since <math>B</math> lies on line <math>DE</math>, we know that <math>y=2x+10</math>. Furthermore, since <math>\angle{ABC}=90^\circ</math>, <math>B</math> lies on the circle with diameter <math>AC</math>, so <math>x^2+y^2=100</math>. Solving for <math>x</math> and <math>y</math> with these equations, we get the solutions <math>(0,10)</math> and <math>(-8,-6)</math>. We immediately discard the <math>(0,10)</math> solution as <math>y</math> should be negative. Thus, we conclude that <math>[ABCD]=[ACD]+[ABC]=\frac{20\cdot30}{2}+\frac{20\cdot6}{2}=\boxed{\textbf{(D)}\:360}</math>.<br />
<br />
==Solution 4 (Trigonometry)==<br />
Let <math>\angle C = \angle{ACB}</math> and <math>\angle{B} = \angle{CBE}.</math> Using Law of Sines on <math>\triangle{BCE}</math> we get <cmath>\dfrac{BE}{\sin{C}} = \dfrac{CE}{\sin{B}} = \dfrac{15}{\sin{B}}</cmath> and LoS on <math>\triangle{ABE}</math> yields <cmath>\dfrac{BE}{\sin{(90 - C)}} = \dfrac{5}{\sin{(90 - B)}} = \dfrac{BE}{\cos{C}} = \dfrac{5}{\cos{B}}.</cmath> Divide the two to get <math>\tan{B} = 3 \tan{C}.</math> Now, <cmath>\tan{\angle{CED}} = 2 = \tan{\angle{B} + \angle{C}} = \dfrac{4 \tan{C}}{1 - 3\tan^2{C}}</cmath> and solve the quadratic, taking the positive solution (C is acute) to get <math>\tan{C} = \frac{1}{3}.</math> So if <math>AB = a,</math> then <math>BC = 3a</math> and <math>[ABC] = \frac{3a^2}{2}.</math> By Pythagorean Theorem, <math>10a^2 = 400 \iff \frac{3a^2}{2} = 60</math> and the answer is <math>300 + 60 \iff \boxed{\textbf{(D)}}.</math><br />
<br />
(This solution is incomplete, can someone complete it please-Lingjun) ok<br />
Latex edited by kc5170<br />
<br />
==Video Solution==<br />
On The Spot STEM<br />
https://www.youtube.com/watch?v=hIdNde2Vln4<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{AMC12 box|year=2020|ab=A|num-b=17|num-a=19}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1166452020 AMC 10A Problems/Problem 202020-02-02T20:04:39Z<p>Ultraman: /* Solution 1 (Just Drop An Altitude) */</p>
<hr />
<div>{{duplicate|[[2020 AMC 12A Problems|2020 AMC 12A #18]] and [[2020 AMC 10A Problems|2020 AMC 10A #20]]}}<br />
<br />
== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution 1 (Just Drop An Altitude)==<br />
<br />
<asy><br />
size(15cm,0);<br />
import olympiad;<br />
draw((0,0)--(0,2)--(6,4)--(4,0)--cycle);<br />
label("A", (0,2), NW);<br />
label("B", (0,0), SW);<br />
label("C", (4,0), SE);<br />
label("D", (6,4), NE);<br />
label("E", (1.714,1.143), N);<br />
label("F", (1,1.5), N);<br />
draw((0,2)--(4,0), dashed);<br />
draw((0,0)--(6,4), dashed);<br />
draw((0,0)--(1,1.5), dashed);<br />
label("20", (0,2)--(4,0), SW);<br />
label("30", (4,0)--(6,4), SE);<br />
label("$x$", (1,1.5)--(1.714,1.143), NE);<br />
draw(rightanglemark((0,2),(0,0),(4,0)));<br />
draw(rightanglemark((0,2),(4,0),(6,4)));<br />
draw(rightanglemark((0,0),(1,1.5),(0,2)));<br />
</asy><br />
<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {\textbf{(D) }360}</math><br />
<br />
(I'm very sorry if you're a visual learner)<br />
<br />
~ Solution by Ultraman<br />
<br />
~ Diagram by ciceronii<br />
<br />
==Solution 2 (Pro Guessing Strats)==<br />
We know that the big triangle has area 300. Use the answer choices which would mean that the area of the little triangle is a multiple of 10. Thus the product of the legs is a multiple of 20. Guess that the legs are equal to <math>\sqrt{20a}</math> and <math>\sqrt{20b}</math>, and because the hypotenuse is 20 we get <math>a+b=20</math>. Testing small numbers, we get that when <math>a=2</math> and <math>b=18</math>, <math>ab</math> is indeed a square. The area of the triangle is thus 60, so the answer is <math>\boxed {\textbf{(D) }360}</math>.<br />
<br />
~tigershark22<br />
~(edited by HappyHuman)<br />
<br />
==Solution 3 (coordinates)==<br />
<asy><br />
size(10cm,0);<br />
draw((10,30)--(10,0)--(-8,-6)--(-10,0)--(10,30));<br />
draw((-20,0)--(20,0));<br />
draw((0,-15)--(0,35));<br />
draw((10,30)--(-8,-6));<br />
draw(circle((0,0),10));<br />
label("E",(-4.05,-.25),S);<br />
label("D",(10,30),NE);<br />
label("C",(10,0),NE);<br />
label("B",(-8,-6),SW);<br />
label("A",(-10,0),NW);<br />
label("5",(-10,0)--(-5,0), NE);<br />
label("15",(-5,0)--(10,0), N);<br />
label("30",(10,0)--(10,30), E);<br />
dot((-5,0));<br />
dot((-10,0));<br />
dot((-8,-6));<br />
dot((10,0));<br />
dot((10,30));<br />
</asy><br />
Let the points be <math>A(-10,0)</math>, <math>\:B(x,y)</math>, <math>\:C(10,0)</math>, <math>\:D(10,30)</math>,and <math>\:E(-5,0)</math>, respectively. Since <math>B</math> lies on line <math>DE</math>, we know that <math>y=2x+10</math>. Furthermore, since <math>\angle{ABC}=90^\circ</math>, <math>B</math> lies on the circle with diameter <math>AC</math>, so <math>x^2+y^2=100</math>. Solving for <math>x</math> and <math>y</math> with these equations, we get the solutions <math>(0,10)</math> and <math>(-8,-6)</math>. We immediately discard the <math>(0,10)</math> solution as <math>y</math> should be negative. Thus, we conclude that <math>[ABCD]=[ACD]+[ABC]=\frac{20\cdot30}{2}+\frac{20\cdot6}{2}=\boxed{\textbf{(D)}\:360}</math>.<br />
<br />
==Solution 4 (Trigonometry)==<br />
Let <math>\angle C = \angle{ACB}</math> and <math>\angle{B} = \angle{CBE}.</math> Using Law of Sines on <math>\triangle{BCE}</math> we get <cmath>\dfrac{BE}{\sin{C}} = \dfrac{CE}{\sin{B}} = \dfrac{15}{\sin{B}}</cmath> and LoS on <math>\triangle{ABE}</math> yields <cmath>\dfrac{BE}{\sin{(90 - C)}} = \dfrac{5}{\sin{(90 - B)}} = \dfrac{BE}{\cos{C}} = \dfrac{5}{\cos{B}}.</cmath> Divide the two to get <math>\tan{B} = 3 \tan{C}.</math> Now, <cmath>\tan{\angle{CED}} = 2 = \tan{\angle{B} + \angle{C}} = \dfrac{4 \tan{C}}{1 - 3\tan^2{C}}</cmath> and solve the quadratic, taking the positive solution (C is acute) to get <math>\tan{C} = \frac{1}{3}.</math> So if <math>AB = a,</math> then <math>BC = 3a</math> and <math>[ABC] = \frac{3a^2}{2}.</math> By Pythagorean Theorem, <math>10a^2 = 400 \iff \frac{3a^2}{2} = 60</math> and the answer is <math>300 + 60 \iff \boxed{\textbf{(D)}}.</math><br />
<br />
(This solution is incomplete, can someone complete it please-Lingjun) ok<br />
Latex edited by kc5170<br />
<br />
==Video Solution==<br />
On The Spot STEM<br />
https://www.youtube.com/watch?v=hIdNde2Vln4<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{AMC12 box|year=2020|ab=A|num-b=17|num-a=19}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1163032020 AMC 10A Problems/Problem 202020-02-01T19:29:02Z<p>Ultraman: /* Solution 1 */</p>
<hr />
<div>== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution 1 (Just Drop An Altitude)==<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {\textbf{D) }360}</math><br />
<br />
(I'm very sorry if you're a visual learner)<br />
<br />
~Ultraman<br />
<br />
==Solution 2 (Pro Guessing Strats)==<br />
We know that the big triangle has area 300. Use the answer choices which would mean that the area of the little triangle is a multiple of 10. Thus the product of the legs is a multiple of 20. Guess that the legs are equal to <math>\sqrt{20a}</math> and <math>\sqrt{20b}</math>, and because the hypotenuse is 20 we get <math>a+b=20</math>. Testing small numbers, we get that when <math>a=2</math> and <math>b=18</math>, <math>ab</math> is indeed a square. The area of the triangle is thus 60, so the answer is <math>\boxed {\textbf{D) }360}</math>.<br />
<br />
~tigershark22<br />
~(edited by HappyHuman)<br />
<br />
==Solution 3 (coordinates)==<br />
<asy><br />
draw((10,30)--(10,0)--(-8,-6)--(-10,0)--(10,30));<br />
draw(circle((0,0),10));<br />
label("D",(10,30),N);<br />
label("C",(10,0),E);<br />
label("B",(-8,-6),S);<br />
label("A",(-10,0),W);<br />
</asy><br />
Let the points be <math>A(-10,0)</math>, <math>\:B(x,y)</math>, <math>\:C(10,0)</math>, <math>\:D(10,30)</math>,and <math>\:E(-5,0)</math>, respectively. Since <math>B</math> lies on line <math>DE</math>, we know that <math>y=2x+10</math>. Furthermore, since <math>\angle{ABC}=90^\circ</math>, <math>B</math> lies on the circle with diameter <math>AC</math>, so <math>x^2+y^2=100</math>. Solving for <math>x</math> and <math>y</math> with these equations, we get the solutions <math>(0,10)</math> and <math>(-8,-6)</math>. We immediately discard the <math>(0,10)</math> solution as <math>y</math> should be negative. Thus, we conclude that <math>[ABCD]=[ACD]+[ABC]=\frac{20\cdot30}{2}+\frac{20\cdot6}{2}=\boxed{\textbf{(D)}\:360}</math>.<br />
<br />
==Solution 4 (Trignometry)==<br />
Using the law of cosines, express <math>AB^2</math> and <math>BC^2</math> in terms of <math>\angle{AEB}</math>. The sum of these two equations is <math>AC^2</math> by the Pythagorean Theorem. Solving for <math>BE</math>, we find <math>BE=3\sqrt5</math>. Since <math>EC=15</math> and <math>DC=30</math>, <math>DE=15\sqrt3</math>, which is five times <math>BE</math>, so <math>[ABCD]=[ACD]+\frac{1/5}{[ACD]}=300+60=\boxed {\textbf{D) }360}</math><br />
<br />
(This solution is incomplete, can someone complete it please)<br />
Latex edited by kc5170<br />
<br />
==Video Solution==<br />
https://youtu.be/RKlG6oZq9so<br />
<br />
~IceMatrix<br />
<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{AMC12 box|year=2020|ab=A|num-b=17|num-a=19}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1161622020 AMC 10A Problems/Problem 202020-02-01T05:00:17Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution ==<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {D)360}</math><br />
<br />
(I'm very sorry if you're a visual learner)<br />
<br />
~Ultraman<br />
<br />
==Video Solution==<br />
https://youtu.be/RKlG6oZq9so<br />
<br />
~IceMatrix<br />
<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1161602020 AMC 10A Problems/Problem 202020-02-01T04:59:33Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution ==<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {D)360}</math><br />
<br />
(I'm very sorry if you're a visual learner - Ultraman)<br />
<br />
==Video Solution==<br />
https://youtu.be/RKlG6oZq9so<br />
<br />
~IceMatrix<br />
<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=116159User:Ultraman2020-02-01T04:57:51Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[2020 AMC 10A Problems/Problem 20]]<br />
<br />
[[2015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 1]]<br />
<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2020_AMC_10A_Problems/Problem_20&diff=1161572020 AMC 10A Problems/Problem 202020-02-01T04:57:15Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Quadrilateral <math>ABCD</math> satisfies <math>\angle ABC = \angle ACD = 90^{\circ}, AC=20,</math> and <math>CD=30.</math> Diagonals <math>\overline{AC}</math> and <math>\overline{BD}</math> intersect at point <math>E,</math> and <math>AE=5.</math> What is the area of quadrilateral <math>ABCD?</math><br />
<br />
<math>\textbf{(A) } 330 \qquad \textbf{(B) } 340 \qquad \textbf{(C) } 350 \qquad \textbf{(D) } 360 \qquad \textbf{(E) } 370</math><br />
<br />
== Solution ==<br />
It's crucial to draw a good diagram for this one. Since <math>AC=20</math> and <math>CD=30</math>, we get <math>[ACD]=300</math>. Now we need to find <math>[ABC]</math> to get the area of the whole quadrilateral. Drop an altitude from <math>B</math> to <math>AC</math> and call the point of intersection <math>F</math>. Let <math>FE=x</math>. Since <math>AE=5</math>, then <math>AF=5-x</math>. By dropping this altitude, we can also see two similar triangles, <math>BFE</math> and <math>DCE</math>. Since <math>EC</math> is <math>20-5=15</math>, and <math>DC=30</math>, we get that <math>BF=2x</math>. Now, if we redraw another diagram just of <math>ABC</math>, we get that <math>(2x)^2=(5-x)(15+x)</math>. Now expanding, simplifying, and dividing by the GCF, we get <math>x^2+2x-15=0</math>. This factors to <math>(x+5)(x-3)</math>. Since lengths cannot be negative, <math>x=3</math>. Since <math>x=3</math>, <math>[ABC]=60</math>. So <math>[ABCD]=[ACD]+[ABC]=300+60=\boxed {D)360}</math><br />
<br />
==Video Solution==<br />
https://youtu.be/RKlG6oZq9so<br />
<br />
~IceMatrix<br />
<br />
<br />
==See Also==<br />
<br />
{{AMC10 box|year=2020|ab=A|num-b=19|num-a=21}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1161322015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-02-01T04:18:12Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512</math>, the answer is <math>\boxed{1024}</math>.<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1161312015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-02-01T04:17:56Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512</math>, the answer is <math>\boxed1024</math>.<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1161302015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-02-01T04:17:43Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512</math>, the answer is \boxed<math>1024</math>.<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_1&diff=1143042018 UNCO Math Contest II Problems/Problem 12020-01-04T22:59:09Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
A printer used 1890 digits to number all the pages in the Seripian Puzzle Book. How many pages are in the book? (For example, to number the pages in a book with twelve pages, the printer would use fifteen digits.)<br />
<br />
== Solution ==<br />
We know that we use <math>1</math> digit <math>9</math> times, <math>2</math> digits <math>90</math> times, and <math>3</math> digits <math>900</math> times. So if we have <math>999</math> pages, we have <math>1 \cdot 9 + 2 \cdot 90 + 3 \cdot 900 = 2889</math> digits. Since we want to have <math>1890</math> digits, we do <math>\frac{2889 - 1890}{3}=333</math> pages less than <math>999</math>. So, <math>999-333=\boxed {666}</math> pages.<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|before=First Question|num-a=2}}<br />
<br />
[[Category:Introductory Number Theory Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=1966_AHSME_Problems/Problem_24&diff=1143031966 AHSME Problems/Problem 242020-01-04T22:58:58Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
If <math>Log_M{N}=Log_N{M},M \ne N,MN>0,M \ne 1, N \ne 1</math>, then <math>MN</math> equals:<br />
<br />
<math>\text{(A) } \frac{1}{2} \quad \text{(B) } 1 \quad \text{(C) } 2 \quad \text{(D) } 10 \\ \text{(E) a number greater than 2 and less than 10}</math><br />
<br />
== Solution ==<br />
If we change the base of <math>Log_M{N}</math> to base <math>N</math>, we get <math>\frac{1}{log_N{M}}= Log_N{M}</math>. Multiplying both sides by <math>Log_N{M}</math>, we get <math>Log_N{M}^2=1</math>. Since <math>N\not = M</math>, <math>Log_N{M}=-1</math>. So <math>N^{-1}=M \rightarrow \frac{1}{N} = M \rightarrow MN=1</math>. So the answer is <math>\boxed{B}</math>.<br />
<br />
== See also ==<br />
{{AHSME box|year=1966|num-b=23|num-a=25}} <br />
<br />
[[Category:Introductory Algebra Problems]]<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1143022015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-01-04T22:58:45Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512</math>, the answer is <math>1024</math>.<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114121User:Ultraman2020-01-03T00:21:16Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[2015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 1]]<br />
<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1141202015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-01-03T00:20:36Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512</math>, the answer is <math>1024</math>.<br />
<br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2015_UNM-PNM_Statewide_High_School_Mathematics_Contest_II_Problems/Problem_1&diff=1141192015 UNM-PNM Statewide High School Mathematics Contest II Problems/Problem 12020-01-03T00:20:22Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
In the sequence<br />
<math>1, 2, 2, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, \cdots </math><br />
what number occupies position <math>2015</math>?<br />
<br />
== Solution==<br />
Since there is <math>1</math> one, <math>2</math> twos, <math>4</math> fours and so on, the number that occupies a position is <math>1+2+4+8+ \cdot \cdot \cdot</math>. Since <math>2^0+2^1+2^2+2^3+ \cdot \cdot \cdot +2^{n-1} = 2^n-1</math>, we get the <math>1023</math>rd number to be <math>512</math>. Since the <math>2015</math>th position is <math>992</math> positions higher than the last <math>512, the answer is </math>1024$.<br />
<br />
== See also ==<br />
{{UNM-PNM Math Contest box|year=2015|n=II|before=First question|num-a=2}}<br />
<br />
[[Category:Beginning Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114104User:Ultraman2020-01-02T21:29:34Z<p>Ultraman: /* About Me */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114103User:Ultraman2020-01-02T21:29:19Z<p>Ultraman: /* About Me */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using [[Unity]], math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=1966_AHSME_Problems/Problem_24&diff=1140961966 AHSME Problems/Problem 242020-01-02T20:49:34Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
If <math>Log_M{N}=Log_N{M},M \ne N,MN>0,M \ne 1, N \ne 1</math>, then <math>MN</math> equals:<br />
<br />
<math>\text{(A) } \frac{1}{2} \quad \text{(B) } 1 \quad \text{(C) } 2 \quad \text{(D) } 10 \\ \text{(E) a number greater than 2 and less than 10}</math><br />
<br />
== Solution ==<br />
If we change the base of <math>Log_M{N}</math> to base <math>N</math>, we get <math>\frac{1}{log_N{M}}= Log_N{M}</math>. Multiplying both sides by <math>Log_N{M}</math>, we get <math>Log_N{M}^2=1</math>. Since <math>N\not = M</math>, <math>Log_N{M}=-1</math>. So <math>N^{-1}=M \rightarrow \frac{1}{N} = M \rightarrow MN=1</math>. So the answer is <math>\boxed{B}</math>.<br />
<br />
~Ultraman<br />
<br />
== See also ==<br />
{{AHSME box|year=1966|num-b=23|num-a=25}} <br />
<br />
[[Category:Introductory Algebra Problems]]<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114094User:Ultraman2020-01-02T20:49:00Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[1966 AHSME Problems/Problem 24]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=1966_AHSME_Problems/Problem_24&diff=1140931966 AHSME Problems/Problem 242020-01-02T20:48:28Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
If <math>Log_M{N}=Log_N{M},M \ne N,MN>0,M \ne 1, N \ne 1</math>, then <math>MN</math> equals:<br />
<br />
<math>\text{(A) } \frac{1}{2} \quad \text{(B) } 1 \quad \text{(C) } 2 \quad \text{(D) } 10 \\ \text{(E) a number greater than 2 and less than 10}</math><br />
<br />
== Solution ==<br />
If we change the base of <math>Log_M{N}</math> to base <math>N</math>, we get <math>\frac{1}{log_N{M}}= Log_N{M}</math>. Multiplying both sides by <math>Log_N{M}</math>, we get <math>Log_N{M}^2=1</math>. Since <math>N\not = M</math>, <math>Log_N{M}=-1</math>. So <math>N^{-1}=M \rightarrow \frac{1}{N} = M \rightarrow MN=1</math>. So the answer is <math>\boxed{B}</math>.<br />
<br />
== See also ==<br />
{{AHSME box|year=1966|num-b=23|num-a=25}} <br />
<br />
[[Category:Introductory Algebra Problems]]<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2012_AMC_12B_Problems/Problem_12&diff=1140682012 AMC 12B Problems/Problem 122020-01-02T19:13:01Z<p>Ultraman: /* Solution */</p>
<hr />
<div>==Problem==<br />
<br />
How many sequences of zeros and ones of length 20 have all the zeros consecutive, or all the ones consecutive, or both?<br />
<br />
<math>\textbf{(A)}\ 190\qquad\textbf{(B)}\ 192\qquad\textbf{(C)}\ 211\qquad\textbf{(D)}\ 380\qquad\textbf{(E)}\ 382</math><br />
<br />
==Solutions==<br />
<br />
===Solution 1===<br />
<br />
There are <math>\binom{20}{2}</math> selections; however, we count these twice, therefore<br />
<br />
<math>2\cdot\binom{20}{2} = 380</math>. The wording of the question implies D not E.<br />
<br />
MAA decided to accept both D and E, however.<br />
<br />
===Solution 2===<br />
<br />
Consider the 20 term sequence of <math>0</math>'s and <math>1</math>'s. Keeping all other terms 1, a sequence of <math>k>0</math> consecutive 0's can be placed in <math>21-k</math> locations. That is, there are 20 strings with 1 zero, 19 strings with 2 consecutive zeros, 18 strings with 3 consecutive zeros, ..., 1 string with 20 consecutive zeros. Hence there are <math>20+19+\cdots+1=\binom{21}{2}</math> strings with consecutive zeros. The same argument shows there are <math>\binom{21}{2}</math> strings with consecutive 1's. This yields <math>2\binom{21}{2}</math> strings in all. However, we have counted twice those strings in which all the 1's and all the 0's are consecutive. These are the cases <math>01111...</math>, <math>00111...</math>, <math>000111...</math>, ..., <math>000...0001</math> (of which there are 19) as well as the cases <math>10000...</math>, <math>11000...</math>, <math>111000...</math>, ..., <math>111...110</math> (of which there are 19 as well). This yields <math>2\binom{21}{2}-2\cdot19=382</math> so that the answer is <math>\framebox{E}</math>.<br />
<br />
== See Also ==<br />
<br />
{{AMC12 box|year=2012|ab=B|num-b=11|num-a=13}}<br />
{{MAA Notice}}</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=University_of_Northern_Colorado_Math_Contest&diff=114066University of Northern Colorado Math Contest2020-01-02T19:09:16Z<p>Ultraman: /* Past Exams */</p>
<hr />
<div>== Past Exams ==<br />
This is a list of all UNC Math Contests in the AoPSWiki. Users are encouraged to post additional solutions to the problems.<br />
<br />
* [[2006 UNCO Math Contest II]]<br />
* [[2007 UNCO Math Contest II]]<br />
* [[2008 UNCO Math Contest II]]<br />
* [[2009 UNCO Math Contest II]]<br />
* [[2010 UNCO Math Contest II]]<br />
* [[2011 UNCO Math Contest II]]<br />
* [[2012 UNCO Math Contest II]]<br />
* [[2013 UNCO Math Contest II]]<br />
* [[2014 UNCO Math Contest II]]<br />
* [[2015 UNCO Math Contest II]]<br />
* [[2016 UNCO Math Contest II]]<br />
* [[2017 UNCO Math Contest II]]<br />
* [[2018 UNCO Math Contest II]]<br />
<br />
==Format & Scoring==<br />
The contest consists of two rounds. Each round is a paper and pencil exam with about 9-12 problems. Students compete individually and no electronic devices are to be used in working the problems. The First Round of the contest is administered in early November in schools around the state and the answers are sent to UNC for grading. Students are allowed ninety minutes to work the First Round problems.<br />
Students who make high scores on the First Round of the contest are invited to the UNC campus in Greeley for the Final Round of the contest in late January. The Final Round is similar in spirit to the First Round, but the problems are more challenging. Students are allowed three hours to work the Final Round problems.<br />
Both rounds challenge students to exercise their creativity and ingenuity to solve problems in geometry, algebra, combinatorics, probability, and number theory. All the old contest exams are archived on the contest website.<br />
<br />
== Eligibility ==<br />
The contest is for all interested students in Colorado. It is designed for students in grades 7-12, but younger students are welcome to participate if they have an interest. All schools in the state, public, private, and home schools, are invited to administer the First Round of the contest in early November. <br />
<br />
== History ==<br />
The University of Northern Colorado Math Contest was founded in 1992 by Richard Grassl and has been directed by Ricardo Diaz since 2011-12.<br />
<br />
== Resources ==<br />
*[http://uncmathcontest.wordpress.com/ Here is the contest website]<br />
* [[American Mathematics Competitions]]<br />
* [[Colorado mathematics competitions]]<br />
* [[Mathematics competition resources]]<br />
<br />
<br />
[[Category: Math Contest Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=University_of_Northern_Colorado_Math_Contest&diff=114065University of Northern Colorado Math Contest2020-01-02T19:08:00Z<p>Ultraman: /* Past Exams */</p>
<hr />
<div>== Past Exams ==<br />
This is a list of all UNC Math Contests in the AoPSWiki. Users are encouraged to post additional solutions to the problems.<br />
<br />
* [[2006 UNCO Math Contest II]]<br />
* [[2007 UNCO Math Contest II]]<br />
* [[2008 UNCO Math Contest II]]<br />
* [[2009 UNCO Math Contest II]]<br />
* [[2010 UNCO Math Contest II]]<br />
* [[2011 UNCO Math Contest II]]<br />
* [[2012 UNCO Math Contest II]]<br />
* [[2013 UNCO Math Contest II]]<br />
* [[2014 UNCO Math Contest II]]<br />
* [[2015 UNCO Math Contest II]]<br />
* [[2016 UNCO Math Contest II]]<br />
* [[2017 UNCO Math Contest II]]<br />
* [[2018 UNCO Math Contest II]]<br />
* [[2019 UNCO Math Contest II]]<br />
<br />
==Format & Scoring==<br />
The contest consists of two rounds. Each round is a paper and pencil exam with about 9-12 problems. Students compete individually and no electronic devices are to be used in working the problems. The First Round of the contest is administered in early November in schools around the state and the answers are sent to UNC for grading. Students are allowed ninety minutes to work the First Round problems.<br />
Students who make high scores on the First Round of the contest are invited to the UNC campus in Greeley for the Final Round of the contest in late January. The Final Round is similar in spirit to the First Round, but the problems are more challenging. Students are allowed three hours to work the Final Round problems.<br />
Both rounds challenge students to exercise their creativity and ingenuity to solve problems in geometry, algebra, combinatorics, probability, and number theory. All the old contest exams are archived on the contest website.<br />
<br />
== Eligibility ==<br />
The contest is for all interested students in Colorado. It is designed for students in grades 7-12, but younger students are welcome to participate if they have an interest. All schools in the state, public, private, and home schools, are invited to administer the First Round of the contest in early November. <br />
<br />
== History ==<br />
The University of Northern Colorado Math Contest was founded in 1992 by Richard Grassl and has been directed by Ricardo Diaz since 2011-12.<br />
<br />
== Resources ==<br />
*[http://uncmathcontest.wordpress.com/ Here is the contest website]<br />
* [[American Mathematics Competitions]]<br />
* [[Colorado mathematics competitions]]<br />
* [[Mathematics competition resources]]<br />
<br />
<br />
[[Category: Math Contest Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114063User:Ultraman2020-01-02T19:04:27Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 4]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_4&diff=1140602018 UNCO Math Contest II Problems/Problem 42020-01-02T19:02:57Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
How many positive integer factors of <math>36,000,000</math> are not perfect squares?<br />
<br />
== Solution ==<br />
We can use [[complementary counting]]. Taking the prime factorization of <math>36,000,000</math>, we get <math>2^8\cdot3^2\cdot5^6</math>.So the total number of factors of <math>36,000,000</math> is <math>(8+1)(2+1)(6+1) = 189</math> factors. Now we need to find the number of factors that are perfect squares. So back to the prime factorization, <math>2^8\cdot3^2\cdot5^6 = 4^4\cdot9^1\cdot5^3</math>. Now we get <math>(4+1)(1+1)(3+1)=40</math> factors that are perfect squares. So there are <math>189-40=\boxed{149}</math> positive integer factors that are not perfect squares.<br />
<br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=3|num-a=5}}<br />
<br />
[[Category:Intermediate Number Theory Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_4&diff=1140592018 UNCO Math Contest II Problems/Problem 42020-01-02T19:02:23Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
How many positive integer factors of <math>36,000,000</math> are not perfect squares?<br />
<br />
== Solution ==<br />
We can use [[complementary counting]]. Taking the prime factorization of <math>36,000,000</math>, we get <math>2^8\cdot3^2\cdot5^6</math>.So the total number of factors of <math>36,000,000</math> is <math>(8+1)(2+1)(6+1) = 189</math> factors. <br />
<br />
Now we need to find the number of factors that are perfect squares. So back to the prime factorization, <math>2^8\cdot3^2\cdot5^6 = 4^4\cdot9^1\cdot5^3</math>. Now we get <math>(4+1)(1+1)(3+1)=40</math> factors that are perfect squares.<br />
<br />
So there are <math>189-40=\boxed149</math> positive integer factors that are not perfect squares.<br />
<br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=3|num-a=5}}<br />
<br />
[[Category:Intermediate Number Theory Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114054User:Ultraman2020-01-02T18:54:50Z<p>Ultraman: /* About Me */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
Also, please improve my solutions...<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114053User:Ultraman2020-01-02T18:54:29Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_3&diff=1140522018 UNCO Math Contest II Problems/Problem 32020-01-02T18:53:45Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Find all values of <math>B</math> that have the property that if <math>(x, y)</math> lies on the hyperbola <math>2y^2-x^2 = 1</math>,<br />
then so does the point <math>(3x + 4y, 2x + By)</math>.<br />
<br />
== Solution ==<br />
We can write a system of equations - <br />
<cmath>2y^2-x^2 = 1</cmath><br />
<cmath>2(2x + By)^2 - (3x+4y)^2 = 1</cmath><br />
<br />
Expanding the second equation, we get <math>-x^2+8Bxy-24xy+2B^2y^2-16y^2=1</math>.<br />
<br />
Since we want this to look like <math>2y^2-x^2=1</math>, we plug in B's that would put it into that form. If we plug in <math>B=3</math>, things cancel, and we get <math>-x^2+24xy-24xy+18y^2-16y^2=1 \rightarrow 2y^2-x^2=1</math>. So <math>\boxed{B=3}</math><br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=2|num-a=4}}<br />
<br />
[[Category:Introductory Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114050User:Ultraman2020-01-02T18:53:14Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
(please improve them)<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114049User:Ultraman2020-01-02T18:52:57Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
(please improve them)<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114048User:Ultraman2020-01-02T18:52:50Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
(please improve them)<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 3]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_3&diff=1140462018 UNCO Math Contest II Problems/Problem 32020-01-02T18:52:08Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Find all values of <math>B</math> that have the property that if <math>(x, y)</math> lies on the hyperbola <math>2y^2-x^2 = 1</math>,<br />
then so does the point <math>(3x + 4y, 2x + By)</math>.<br />
<br />
== Solution ==<br />
We can write a system of equations - <br />
<cmath>2y^2-x^2 = 1</cmath><br />
<cmath>2(2x + By)^2 - (3x+4y)^2 = 1</cmath><br />
<br />
Expanding the second equation, we get <math>-x^2+8Bxy-24xy+2B^2y^2-16y^2=1</math><br />
Since we want this to look like <math>2y^2-x^2=1</math>, we plug in B's that would put it into that form. If we plug in <math>B=3</math>, things cancel, and we get <math>-x^2+24xy-24xy+18y^2-16y^2=1 \rightarrow 2y^2-x^2=1</math>. So <math>\boxed{B=3}</math><br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=2|num-a=4}}<br />
<br />
[[Category:Introductory Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_3&diff=1140432018 UNCO Math Contest II Problems/Problem 32020-01-02T18:51:50Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
Find all values of <math>B</math> that have the property that if <math>(x, y)</math> lies on the hyperbola <math>2y^2-x^2 = 1</math>,<br />
then so does the point <math>(3x + 4y, 2x + By)</math>.<br />
<br />
== Solution ==<br />
We can write a system of equations - <br />
<cmath>2y^2-x^2 = 1</cmath><br />
<cmath>2(2x + By)^2 - (3x+4y)^2 = 1</cmath><br />
<br />
Expanding the second equation, we get <math>-x^2+8Bxy-24xy+2B^2y^2-16y^2=1</math><br />
Since we want this to look like <math>2y^2-x^2=1</math>, we plug in B's that would put it into that form. If we plug in <math>B=3</math>, things cancel, and we get <math>-x^2+24xy-24xy+18y^2-16y^2=1 \rightarrow 2y^2-x^2=1</math> So <math>\boxed{B=3}</math><br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=2|num-a=4}}<br />
<br />
[[Category:Introductory Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_3&diff=1140422018 UNCO Math Contest II Problems/Problem 32020-01-02T18:05:50Z<p>Ultraman: /* Problem */</p>
<hr />
<div>== Problem ==<br />
Find all values of <math>B</math> that have the property that if <math>(x, y)</math> lies on the hyperbola <math>2y^2-x^2 = 1</math>,<br />
then so does the point <math>(3x + 4y, 2x + By)</math>.<br />
<br />
== Solution ==<br />
<br />
<math>B=3</math><br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=2|num-a=4}}<br />
<br />
[[Category:Introductory Algebra Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_2&diff=1140412018 UNCO Math Contest II Problems/Problem 22020-01-02T18:04:55Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<asy><br />
pair D=(0,0),B=(0,12),C=(16,0),A=(-9,0);<br />
draw(A--B--C--A,dot);<br />
draw(D--B,dot);<br />
MP("D",D,S);MP("A",A,S);MP("C",C,S);MP("B",B,N);<br />
MP("16",(8,0),S);MP("15",(A+B)/2,NW);<br />
</asy><br />
<br />
Segment AB is perpendicular to segment BC and<br />
segment AC is perpendicular to segment BD. If segment AB has length 15 and segment DC has length 16,<br />
then what is the area of triangle ABC?<br />
<br />
== Solution ==<br />
Let the altitude <math>BD</math> be called <math>h</math>, <math>AD</math> be called <math>x</math>, and <math>BC</math> called <math>y</math>. Since <math>ABC</math> is a right triangle, we can write a system of equations.<br />
<cmath>h^2=16x</cmath><br />
<cmath>15^2=x(x+16)</cmath><br />
<cmath>y^2=16(16+x)</cmath><br />
<br />
Solving the second equation, we get <math>x^2+16x-225=0 \rightarrow (x-9)(x+25)=0 \rightarrow x=9</math> or <math>-25</math>. Since <math>x</math> has to be positive, <math>x=9</math>. Plugging <math>9</math> into the first equation, we get that <math>h^2=4^2\cdot3^2 \rightarrow h=12</math> or <math>-12</math>. Once again, side lengths must be positive, so <math>h=12</math>. Now we have an altitude and a base, so the area of <math>ABC</math> is <math>\frac{(9+16)\cdot12}{2} = \boxed{150}</math><br />
<br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=1|num-a=3}}<br />
<br />
[[Category:Introductory Geometry Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114040User:Ultraman2020-01-02T18:04:37Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2018 UNCO Math Contest II Problems/Problem 2]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_2&diff=1140392018 UNCO Math Contest II Problems/Problem 22020-01-02T18:03:36Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<asy><br />
pair D=(0,0),B=(0,12),C=(16,0),A=(-9,0);<br />
draw(A--B--C--A,dot);<br />
draw(D--B,dot);<br />
MP("D",D,S);MP("A",A,S);MP("C",C,S);MP("B",B,N);<br />
MP("16",(8,0),S);MP("15",(A+B)/2,NW);<br />
</asy><br />
<br />
Segment AB is perpendicular to segment BC and<br />
segment AC is perpendicular to segment BD. If segment AB has length 15 and segment DC has length 16,<br />
then what is the area of triangle ABC?<br />
<br />
== Solution ==<br />
Let the altitude <math>BD</math> be called <math>h</math>, <math>AD</math> be called <math>x</math>, and <math>BC</math> called <math>y</math>. Since <math>ABC</math> is a right triangle, we can write a system of equations.<br />
<cmath>h^2=16x</cmath><br />
<cmath>15^2=x(x+16)</cmath><br />
<cmath>y^2=16(16+x)</cmath><br />
<br />
Solving the second equation, we get <math>x^2+16x-225=0 \rightarrow (x-9)(x+25)=0 \rightarrow x=9</math> or <math>-25</math>. Since <math>x</math> has to be positive, <math>x=9</math>. Plugging <math>9</math> into the first equation, we get that <math>h^2=4^2\cdot3^2 \rightarrow h=12</math> or <math>-12</math>. Once again, side lengths must be positive, so <math>h=12</math>. Now we have an altitude and a base, so the area of <math>ABC</math> is <math>\frac{(9+16)\cdot12}{2} = \boxed{150}</math><br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|num-b=1|num-a=3}}<br />
<br />
[[Category:Introductory Geometry Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114038User:Ultraman2020-01-02T17:35:10Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_1&diff=1140372018 UNCO Math Contest II Problems/Problem 12020-01-02T17:32:42Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
A printer used 1890 digits to number all the pages in the Seripian Puzzle Book. How many pages are in the book? (For example, to number the pages in a book with twelve pages, the printer would use fifteen digits.)<br />
<br />
== Solution ==<br />
We know that we use <math>1</math> digit <math>9</math> times, <math>2</math> digits <math>90</math> times, and <math>3</math> digits <math>900</math> times. So if we have <math>999</math> pages, we have <math>1 \cdot 9 + 2 \cdot 90 + 3 \cdot 900 = 2889</math> digits. Since we want to have <math>1890</math> digits, we do <math>\frac{2889 - 1890}{3}=333</math> pages less than <math>999</math>. So, <math>999-333=\boxed {666}</math> pages.<br />
~Ultraman<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|before=First Question|num-a=2}}<br />
<br />
[[Category:Introductory Number Theory Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114036User:Ultraman2020-01-02T17:32:28Z<p>Ultraman: /* Solutions */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2018 UNCO Math Contest II Problems/Problem 1]]<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=2018_UNCO_Math_Contest_II_Problems/Problem_1&diff=1140352018 UNCO Math Contest II Problems/Problem 12020-01-02T17:31:49Z<p>Ultraman: /* Solution */</p>
<hr />
<div>== Problem ==<br />
<br />
A printer used 1890 digits to number all the pages in the Seripian Puzzle Book. How many pages are in the book? (For example, to number the pages in a book with twelve pages, the printer would use fifteen digits.)<br />
<br />
== Solution ==<br />
We know that we use <math>1</math> digit <math>9</math> times, <math>2</math> digits <math>90</math> times, and <math>3</math> digits <math>900</math> times. So if we have <math>999</math> pages, we have <math>1 \cdot 9 + 2 \cdot 90 + 3 \cdot 900 = 2889</math> digits. Since we want to have <math>1890</math> digits, we do <math>\frac{2889 - 1890}{3}=333</math> pages less than <math>999</math>. So, <math>999-333=\boxed {666}</math> pages.<br />
<br />
== See also ==<br />
{{UNCO Math Contest box|year=2018|n=II|before=First Question|num-a=2}}<br />
<br />
[[Category:Introductory Number Theory Problems]]</div>Ultramanhttps://artofproblemsolving.com/wiki/index.php?title=User:Ultraman&diff=114034User:Ultraman2020-01-02T17:27:42Z<p>Ultraman: /* About Me */</p>
<hr />
<div>==About Me==<br />
I currently live in Texas, and I love playing [[badminton]], violin, Greed Control, using Unity, math, and most importantly, sleep.<br />
<br />
==Solutions==<br />
[[2012 UNCO Math Contest II Problems/Problem 7]]<br />
<br />
==Edits==<br />
[[Power of a Point Theorem/Introductory Problem 1]]<br />
<br />
[[2005 CEMC Gauss (Grade 7) Problems/Problem 2a]]<br />
<br />
[[2019 AMC 12A Problems/Problem 14]]<br />
<br />
[[2002 AMC 12B Problems/Problem 7]]<br />
<br />
[[2005 PMWC Problems/Problem T8]]<br />
<br />
[[2017 AMC 10B Problems/Problem 14]]<br />
<br />
[[2004 AMC 10A Problems/Problem 16]]</div>Ultraman