|
|
| (60 intermediate revisions by 20 users not shown) |
| Line 1: |
Line 1: |
| − | ==Introduction==
| + | If you have a problem or solution to contribute, please go to [[Problems Collection|this page]]. |
| − | I am a 5th grader who likes making and doing problems, doing math, and redirecting pages (see [[Principle of Insufficient Reasons]]). I like geometry and don't like counting and probability. My number theory skill are also not bad.
| |
| | | | |
| − | ==User Counts==
| |
| | | | |
| − | If this is your first time visiting this page, please change the number below by one. (Add 1, do NOT subtract 1)
| + | I am a aops user who likes making and doing problems, doing math, and redirecting pages (see [[Principle of Insufficient Reasons]]). I like geometry and don't like counting and probability. My number theory skill are also not bad |
| | | | |
| − | <math>\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{\boxed{13}}}}}}}}}}}}}}}}</math> | + | <br> |
| | + | __NOTOC__<div style="border:2px solid black; -webkit-border-radius: 10px; background:#F0F2F3"> |
| | | | |
| − | For those of you who want more boxes, me too. However, this is the max number of boxes. Also, I check the pages history so I know if someone edited something.
| + | ==<font color="black" style="font-family: ITC Avant Garde Gothic Std, Verdana"><div style="margin-left:10px">User Count</div></font>== |
| | + | <div style="margin-left: 10px; margin-bottom:10px"><font color="black">If this is your first time visiting this page, edit it by incrementing the user count below by one.</font></div> |
| | + | <center><font size="100px">31</font></center> |
| | + | </div> |
| | | | |
| − | (Please don't mess with the user count)
| + | Credits given to [[User:Firebolt360|Firebolt360]] for inventing the box above. |
| − | | |
| − | Doesn't that look like a number on a pyramid
| |
| | | | |
| | ==Cool asyptote graphs== | | ==Cool asyptote graphs== |
| Line 24: |
Line 24: |
| | | | |
| | ==Problems Sharing Contest== | | ==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: | + | Here, you can post all the math problems 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 30: |
Line 30: |
| | <cmath>(p^2+1)(q^2+1)-((pq)^2-pq+1)</cmath> | | <cmath>(p^2+1)(q^2+1)-((pq)^2-pq+1)</cmath> |
| | | | |
| − | 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. ~[[Ddk001]] |
| − | (DO NOT LOOK AT MY SOLUTIONS YET)
| |
| − | | |
| − | ==Contributions==
| |
| − | [[2005 AMC 8 Problems/Problem 21]] Solution 2 | |
| − | | |
| − | [[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
| |
| − | | |
| − | Restored diagram for [[1994 AIME Problems/Problem 7]]
| |
| − | | |
| − | [[Divergence Theorem]]
| |
| − | | |
| − | [[Stokes' Theorem]]
| |
| − | | |
| − | [[Principle of Insufficient Reasons]]
| |
| − | | |
| − | ==Problems I made==
| |
| − | ===Aime styled===
| |
| − | ====Introductory====
| |
| − | 1. There is one and only one perfect square in the form
| |
| − | | |
| − | <cmath>(p^2+1)(q^2+1)-((pq)^2-pq+1)</cmath>
| |
| − | | |
| − | where <math>p</math> and <math>q</math> are prime. Find that perfect square.
| |
| − | | |
| − | | |
| − | 2. <math>m</math> and <math>n</math> are positive integers. If <math>m^2=2^8+2^{11}+2^n</math>, find <math>m+n</math>.
| |
| − | | |
| − | ====Intermediate====
| |
| − | 3.The fraction,
| |
| − | | |
| − | <cmath>\frac{ab+bc+ac}{(a+b+c)^2}</cmath>
| |
| − | | |
| − | 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>.
| |
| − | | |
| − | | |
| − | 4. Suppose there is complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy
| |
| − | | |
| − | <cmath>(x_i-\sqrt[3]{13})((x_i-\sqrt[3]{53})(x_i-\sqrt[3]{103})=\frac{1}{3}</cmath>
| |
| − | | |
| − | Find <math>x_{1}^3+x_{2}^3+x_{2}^3</math>.
| |
| − | | |
| − | | |
| − | 5. Suppose
| |
| − | | |
| − | <cmath>x \equiv 2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6 \pmod{7!}</cmath>
| |
| − | | |
| − | Find the remainder when <math>\min{x}</math> is divided by <math>1000</math>.
| |
| − | | |
| − | | |
| − | 6. Suppose that there is <math>192</math> rings, each of different size. All of them are placed on a peg, smallest on the top and biggest on the bottom. There are <math>2</math> other pegs positioned sufficiently apart. A <math>move</math> is made if
| |
| − | | |
| − | (i) <math>1</math> ring changed position (i.e., that ring is transferred from one peg to another)
| |
| − | | |
| − | (ii) No rings are on top of smaller rings.
| |
| − | | |
| − | Then, let <math>x</math> be the minimum possible number <math>moves</math> that can transfer all <math>192</math> rings onto the second peg. Find the remainder when <math>x</math> is divided by <math>1000</math>.
| |
| − | | |
| − | | |
| − | 7. 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
| |
| − | | |
| − | <cmath>(2+r_1)(2+r_2) \dots (2+r_{10000000010})=m!</cmath>
| |
| − | | |
| − | for an integer <math>m</math>. If <math>p</math> is the minimum possible positive integral value of
| |
| − | | |
| − | <cmath>(1+r_1)(1+r_2) \dots (1+r_{10000000010})</cmath>.
| |
| − | | |
| − | Find the number of factors of the prime <math>999999937</math> in <math>p</math>.
| |
| − | | |
| − | | |
| − | ====Olympiad====
| |
| − | | |
| − | 8. (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?
| |
| − | | |
| − | | |
| − | 9. Suppose <cmath>\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{n \cdot m^2+m \cdot n^2+2mn}+\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 [\frac{(1+\frac{1}{x})^{x}}{e}-1]]=\frac{p}{q}</cmath> where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
| |
| − | | |
| − | | |
| − | ===Proofs===
| |
| − | 10. In <math>\Delta ABC</math> with <math>AB=AC</math>, <math>D</math> is the foot of the perpendicular from <math>A</math> to <math>BC</math>. <math>E</math> is the foot of the perpendicular from <math>D</math> to <math>AC</math>. <math>F</math> is the midpoint of <math>DE</math>. Prove that <math>AF</math> is perpendicular to <math>BE</math>.
| |
| − | | |
| − | I will leave a big gap below this sentence so you won't see the answers accidentally.
| |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| − | | |
| | | | |
| | + | <math>\textbf{Solution by cxsmi}</math> |
| | | | |
| | + | 1. We can expand the product in the expression. <math>(p^2+1)(q^2+1)-((pq)^2-pq+1) = p^2q^2+p^2+q^2+1-((pq)^2-pq+1) = p^2 + q^2 + pq</math>. Suppose this equals <math>m^2</math> for some positive integer <math>m</math>. We rewrite using the square of a binomial pattern to find that <math>m^2 = (p + q)^2 - pq</math>. Through trial and error on small values of <math>p</math> and <math>q</math>, we find that <math>p</math> and <math>q</math> must equal <math>3</math> and <math>5</math> in some order. The perfect square formed using these numbers is <math>\boxed{49}</math>. |
| | | | |
| | + | Note: I will be the first to admit that this solution is somewhat lucky. |
| | | | |
| | | | |
| | + | 2. A diamond is created by connecting the points at which a square circumscribed around the incircle of an isosceles right triangle <math>\triangle ABC</math> intersects <math>\triangle ABC</math> itself. <math>\triangle ABC</math> has leg length <math>2024</math>. The perimeter of this diamond is expressible as <math>a\sqrt{b}-c</math>, where <math>a</math>, <math>b</math>, and <math>c</math> are integers, and <math>c</math> is not divisible by the square of any prime. What is the remainder when <math>a + b + c</math> is divided by <math>1000</math>? |
| | | | |
| | + | <asy> |
| | + | unitsize(1inch); |
| | + | draw((0,0)--(0,2)); |
| | + | draw((0,2)--(2,0)); |
| | + | draw((2,0)--(0,0)); |
| | + | draw(circle((0.586,0.586),0.586)); |
| | + | draw((0,0)--(0,1.172),red); |
| | + | draw((0,1.172)--(1.172,1.172)); |
| | + | draw((1.172,1.172)--(1.172,0)); |
| | + | draw((1.172,0)--(0,0),red); |
| | + | draw((0,1.172)--(0.828,1.172),red); |
| | + | draw((0.828,1.172)--(1.172,0.828),red); |
| | + | draw((1.172,0.828)--(1.172,0),red); |
| | + | draw((0,0.1)--(0.1,0.1)); |
| | + | draw((0.1,0.1)--(0.1,0)); |
| | + | label("$A$",(0,2.1)); |
| | + | label("$B$",(0,-0.1)); |
| | + | label("$C$",(2,-0.1)); |
| | + | label("$2024$",(-0.2,1)); |
| | + | label("$2024$",(1,-0.2)); |
| | + | </asy> |
| | | | |
| | | | |
| | + | <math>\textbf{Solution by Ddk001}</math> |
| | | | |
| | | | |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − |
| |
| − | ==Answer key==
| |
| − |
| |
| − | 1. 049
| |
| − |
| |
| − | 2. 019
| |
| − |
| |
| − | 3. 092
| |
| − |
| |
| − | 4. 170
| |
| − |
| |
| − | 5. 736
| |
| − |
| |
| − | 6. 895
| |
| − |
| |
| − | 7. 011
| |
| − |
| |
| − | 8. 054
| |
| − |
| |
| − | 9. 077
| |
| − |
| |
| − | ==Solutions==
| |
| − |
| |
| − | *Note: All the solutions so far have been made by me :)
| |
| − |
| |
| − | ===Problem 1===
| |
| − | There is one and only one perfect square in the form
| |
| − |
| |
| − | <cmath>(p^2+1)(q^2+1)-((pq)^2-pq+1)</cmath>
| |
| − |
| |
| − | where <math>p</math> and <math>q</math> is prime. Find that perfect square.
| |
| − |
| |
| − | ===Solution 1===
| |
| − | <math>(p^2+1)(q^2+1)-((pq)^2-pq+1)=p^2 \cdot q^2 +p^2+q^2+1-p^2 \cdot q^2 +pq-1=p^2+q^2+pq</math>.
| |
| − | Suppose <math>n^2=(p^2+1)(q^2+1)-((pq)^2-pq+1)</math>.
| |
| − | Then,
| |
| − |
| |
| − | <cmath>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)</cmath>
| |
| − |
| |
| − | , 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 2===
| |
| − | <math>m</math> and <math>n</math> are positive integers. If <math>m^2=2^8+2^{11}+2^n</math>, find <math>m+n</math>.
| |
| | ===Solution 1=== | | ===Solution 1=== |
| − | <cmath>m^2=2^8+2^{11}+2^n</cmath>
| + | The inradius of <math>\Delta ABC</math>, <math>r</math>, can be calculated as |
| − | | |
| − | <cmath>\implies 2^n=m^2-2^8-2^{11}</cmath>
| |
| − | | |
| − | <cmath>\implies 2^n=(m+48)(m-48)</cmath>
| |
| − | | |
| − | Let <math>m+48=2^t</math> and <math>m-48=2^s</math>. Then,
| |
| − | | |
| − | <cmath>2^t-2^s=96 \implies 2^s(2^{t-s}-1)=2^5 \cdot 3 \implies 2^{t-s}-1=3,2^s=2^5 \implies (t,s)=(7,5) \implies m+n=80+12=\boxed{092}</cmath> <math>\square</math>
| |
| − | | |
| − | ===Problem 3===
| |
| − | The fraction, | |
| − | | |
| − | <cmath>\frac{ab+bc+ac}{(a+b+c)^2}</cmath>
| |
| − | | |
| − | 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,
| |
| − | | |
| − | <cmath>\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})}</cmath>
| |
| − | | |
| − | , 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
| |
| | | | |
| − | <cmath>a^2-2ac+c^2+b^2-2bc+c^2+a^2-2ab+b^2 \ge 0</cmath> | + | <cmath>r=\frac{\textbf{Area}_{ABC}}{\textbf{Semiperimeter}} \implies r=\frac{2024^2/2}{(2024+2024+2024 \sqrt{2})/2}=\frac{2024}{2+\sqrt{2}}=2024-1012\sqrt{2}</cmath> |
| | | | |
| − | <cmath>\implies a^2+b^2+c^2 \ge ac+bc+ab</cmath> | + | so the square have side length <math>4048-2024 \sqrt{2}</math>. Let the <math>D</math> be the vertex of the square <math>D \ne B</math> on side <math>BC</math>. Then <math>DC= 2024 (\sqrt{2} -1)</math>. Let the sides of the square intersect <math>AC</math> at <math>E</math> and <math>F</math>, with <math>AE<AF</math>. Then <math>AE=CF=2024(2-\sqrt{2})</math> so <math>EF=2024 (3 \sqrt{2} -4)</math>. Let <math>G</math> be the vertex of the square across from <math>B</math>. Then <math>EG=FG=2024 (3-2\sqrt{2})</math>. Thus the perimeter of the diamond is |
| | | | |
| − | <cmath>\implies a^2+b^2+c^2+2(ac+bc+ab) \ge 3(ac+bc+ab)</cmath> | + | <cmath>4(4048-2024 \sqrt{2})-2 \cdot 2024 (3-2\sqrt{2})+2024 (3 \sqrt{2} -4)=2024 (8-4 \sqrt{2}-6+4\sqrt{2}+3\sqrt{2}-4)=2024(3\sqrt{2}-2)=7072\sqrt{2}-4048</cmath> |
| | | | |
| − | <cmath>\implies (a+b+c)^2 \ge 3(ac+bc+ab)</cmath> | + | The desired sum is <math>7072+2+4048=\boxed{11122}</math>. <math>\blacksquare</math> |
| | | | |
| − | <cmath>\implies \frac{(a+b+c)^2}{ab+bc+ac} \ge 3</cmath>
| |
| | | | |
| − | <cmath>\implies \frac{ab+bc+ac}{(a+b+c)^2} \le \frac{1}{3}</cmath>
| + | [[Ddk001]] Presents |
| | | | |
| − | 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.
| + | THE FOLLOWING PROBLEM |
| | | | |
| − | Thus, <math>q=\frac{1}{3}</math>.
| + | Note: This is one of my favorite problems. Very well designed and actually used two of my best tricks without looking weird. |
| | | | |
| − | '''Lemma 2: <math>\frac{ab+bc+ac}{(a+b+c)^2}>\frac{1}{4}</math>'''
| |
| − |
| |
| − | ''Proof:'' By the [[Triangle Inequality]], we have
| |
| − |
| |
| − | <cmath>a+b>c</cmath>
| |
| − |
| |
| − | <cmath>b+c>a</cmath>
| |
| − |
| |
| − | <cmath>a+c>b</cmath>.
| |
| − |
| |
| − | Since <math>a,b,c>0</math>, we have
| |
| − |
| |
| − | <cmath>c(a+b)>c^2</cmath>
| |
| − |
| |
| − | <cmath>a(b+c)>a^2</cmath>
| |
| − |
| |
| − | <cmath>b(a+c)>b^2</cmath>.
| |
| − |
| |
| − | Add them together gives
| |
| − |
| |
| − | <cmath>a^2+b^2+c^2<c(a+b)+a(b+c)+b(a+c)=2(ab+bc+ac)</cmath>
| |
| − |
| |
| − | <cmath>\implies a^2+b^2+c^2+2(ab+bc+ac)<4(ab+bc+ac)</cmath>
| |
| − |
| |
| − | <cmath>\implies (a+b+c)^2<4(ab+bc+ac)</cmath>
| |
| − |
| |
| − | <cmath>\implies \frac{(a+b+c)^2}{ab+bc+ac}<4</cmath>
| |
| − |
| |
| − | <cmath>\implies \frac{ab+bc+ac}{(a+b+c)^2}>\frac{1}{4}</cmath> <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
| |
| − |
| |
| − | <cmath>\lim_{b=c,a \to 0} (\frac{ab+bc+ac}{(a+b+c)^2})=\frac{1}{4}</cmath>.
| |
| − |
| |
| − | 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 4===
| |
| − | Suppose there are complex values <math>x_1, x_2,</math> and <math>x_3</math> that satisfy
| |
| − |
| |
| − | <cmath>(x_i-\sqrt[3]{13})((x_i-\sqrt[3]{53})(x_i-\sqrt[3]{103})=\frac{1}{3}</cmath>
| |
| − |
| |
| − | Find <math>x_{1}^3+x_{2}^3+x_{2}^3</math>.
| |
| − | ===Solution 1===
| |
| − | To make things easier, instead of saying <math>x_i</math>, we say <math>x</math>.
| |
| − |
| |
| − | Now, we have
| |
| − | <cmath>(x-\sqrt[3]{13})(x-\sqrt[3]{53})(x-\sqrt[3]{103})=\frac{1}{3}</cmath>.
| |
| − | Expanding gives
| |
| − |
| |
| − | <cmath>x^3-(\sqrt[3]{13}+\sqrt[3]{53}+\sqrt[3]{103}) \cdot x^2+(\sqrt[3]{13 \cdot 53}+\sqrt[3]{13 \cdot 103}+\sqrt[3]{53 \cdot 103})x-(\sqrt[3]{13 \cdot 53 \cdot 103}+\frac{1}{3})=0</cmath>.
| |
| − |
| |
| − | To make things even simpler, let
| |
| − |
| |
| − | <cmath>a=\sqrt[3]{13}+\sqrt[3]{53}+\sqrt[3]{103}, b=\sqrt[3]{13 \cdot 53}+\sqrt[3]{13 \cdot 103}+\sqrt[3]{53 \cdot 103}, c=\sqrt[3]{13 \cdot 53 \cdot 103}+\frac{1}{3}</cmath>
| |
| − |
| |
| − | , so that <math>x^3-ax^2+bx-c=0</math>.
| |
| − |
| |
| − | Then, if <math>P_n=x_{1}^n+x_{2}^n+x_{3}^n</math>, [[Newton's Sums]] gives
| |
| − |
| |
| − | <cmath>P_1+(-a)=0</cmath> <math>(1)</math>
| |
| − |
| |
| − | <cmath>P_2+(-a) \cdot P_1+2 \cdot b=0</cmath> <math>(2)</math>
| |
| − |
| |
| − | <cmath>P_3+(-a) \cdot P_1+b \cdot P_1+3 \cdot (-c)=0</cmath> <math>(3)</math>
| |
| − |
| |
| − | Therefore,
| |
| − |
| |
| − | <cmath>P_3=0-((-a) \cdot P_1+b \cdot P_1+3 \cdot (-c))</cmath>
| |
| − |
| |
| − | <cmath>=a \cdot P_2-b \cdot P_1+3 \cdot c</cmath>
| |
| − |
| |
| − | <cmath>=a(a \cdot P_1-2b)-b \cdot P_1 +3 \cdot c</cmath>
| |
| − |
| |
| − | <cmath>=a(a^2-2b)-ab+3c</cmath>
| |
| − |
| |
| − | <cmath>=a^3-3ab+3c</cmath>
| |
| − |
| |
| − | Now, we plug in <math>a=\sqrt[3]{13}+\sqrt[3]{53}+\sqrt[3]{103}, b=\sqrt[3]{13 \cdot 53}+\sqrt[3]{13 \cdot 103}+\sqrt[3]{53 \cdot 103}, c=\sqrt[3]{13 \cdot 53 \cdot 103}+\frac{1}{3}:</math>
| |
| − |
| |
| − | <cmath>P_3=(\sqrt[3]{13}+\sqrt[3]{53}+\sqrt[3]{103})^3-3(\sqrt[3]{13}+\sqrt[3]{53}+\sqrt[3]{103})(\sqrt[3]{13 \cdot 53}+\sqrt[3]{13 \cdot 103}+\sqrt[3]{53 \cdot 103})+3(\sqrt[3]{13 \cdot 53 \cdot 103}+\frac{1}{3})</cmath>.
| |
| − |
| |
| − | We substitute <math>x=\sqrt[3]{13},y=\sqrt[3]{53},z=\sqrt[3]{103}</math> to get
| |
| − |
| |
| − | <cmath>P_3=(x+y+z)^3-3(x+y+z)(xy+yz+xz)+3(abc+\frac{1}{3})</cmath>
| |
| − |
| |
| − | <cmath>=x^3+y^3+z^3+3x^2y+3y^2x+3x^2z+3z^2x+3z^2y+3y^2z+6xyz-3(x^2y+y^2x+x^2z+z^2x+z^2y+y^2z+3xyz)+3xyz+1</cmath>
| |
| − |
| |
| − | <cmath>=x^3+y^3+z^3+3x^2y+3y^2x+3x^2z+3z^2x+3z^2y+3y^2z+6xyz-3x^2y-3y^2x-3x^2z-3z^2x-3z^2y-3y^2z-9xyz+3xyz+1</cmath>
| |
| − |
| |
| − | <cmath>=x^3+y^3+z^3+1</cmath>
| |
| − |
| |
| − | <cmath>=13+53+103+1</cmath>
| |
| − |
| |
| − | <cmath>=\boxed{170}</cmath>. <math>\square</math>
| |
| − |
| |
| − | Note: If you don't know [[Newton's Sums]], you can also use [[Vieta's Formulas]] to bash.
| |
| − |
| |
| − | ===Problem 5===
| |
| | Suppose | | Suppose |
| | | | |
| Line 428: |
Line 92: |
| | Find the remainder when <math>\min{x}</math> is divided by 1000. | | Find the remainder when <math>\min{x}</math> is divided by 1000. |
| | | | |
| − | ===Solution 1 (Euler's Totient Theorem)=== | + | ==Contributions== |
| − | We first simplify <math>2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6:</math>
| + | [[2005 AMC 8 Problems/Problem 21]] Solution 2 |
| | | | |
| − | <cmath>2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6=42^4+6 \cdot 30^6=(\frac{5 \cdot 6 \cdot 7}{5})^{\phi (5)}+6\cdot (\frac{5 \cdot 6 \cdot 7}{7})^{\phi (7)}+0 \cdot (\frac{5 \cdot 6 \cdot 7}{6})^{\phi (6)}</cmath>
| + | [[2022 AMC 12B Problems/Problem 25]] Solution 5 (Now it's solution 6) |
| | | | |
| − | so
| + | [[2023 AMC 12B Problems/Problem 20]] Solution 3 |
| | | | |
| − | <cmath>x \equiv (\frac{5 \cdot 6 \cdot 7}{5})^{\phi (5)}+6\cdot (\frac{5 \cdot 6 \cdot 7}{7})^{\phi (7)}+0 \cdot (\frac{5 \cdot 6 \cdot 7}{6})^{\phi (6)} \equiv (\frac{5 \cdot 6 \cdot 7}{5})^{\phi (5)} \equiv 1 \pmod{5}</cmath>
| + | [[2016 AIME I Problems/Problem 10]] Solution 3 |
| | | | |
| − | <cmath>x \equiv (\frac{5 \cdot 6 \cdot 7}{5})^{\phi (5)}+6\cdot (\frac{5 \cdot 6 \cdot 7}{7})^{\phi (7)}+0 \cdot (\frac{5 \cdot 6 \cdot 7}{6})^{\phi (6)} \equiv 0 \cdot (\frac{5 \cdot 6 \cdot 7}{6})^{\phi (6)} \equiv 0 \pmod{6}</cmath>
| + | [[2017 AIME I Problems/Problem 14]] Solution 2 |
| | | | |
| − | <cmath>x \equiv (\frac{5 \cdot 6 \cdot 7}{5})^{\phi (5)}+6\cdot (\frac{5 \cdot 6 \cdot 7}{7})^{\phi (7)}+0 \cdot (\frac{5 \cdot 6 \cdot 7}{6})^{\phi (6)} \equiv 6 \cdot (\frac{5 \cdot 6 \cdot 7}{7})^{\phi (7)} \equiv 6 \pmod{7}</cmath>.
| + | [[2019 AIME I Problems/Problem 15]] Solution 6 |
| | | | |
| − | where the last step of all 3 congruences hold by the [[Euler's Totient Theorem]].
| + | [[2022 AIME II Problems/Problem 3]] Solution 3 |
| − | Hence,
| |
| | | | |
| − | <cmath>x \equiv 1 \pmod{5}</cmath>
| + | [[1978 USAMO Problems/Problem 1]] Solution 4 |
| | | | |
| − | <cmath>x \equiv 0 \pmod{6}</cmath>
| + | Restored diagram for [[1994 AIME Problems/Problem 7]] |
| | | | |
| − | <cmath>x \equiv 6 \pmod{7}</cmath>
| + | [[Divergence Theorem]] |
| | | | |
| − | Now, you can bash through solving linear congruences, but there is a smarter way. Notice that <math>5|x-6,6|x-6</math>, and <math>7|x-6</math>. Hence, <math>210|x-6</math>, so <math>x \equiv 6 \pmod{210}</math>. With this in mind, we proceed with finding <math>x \pmod{7!}</math>.
| + | [[Stokes' Theorem]] |
| | | | |
| − | Notice that <math>7!=5040= \text{lcm}(144,210)</math> and that <math>x \equiv 0 \pmod{144}</math>. Therefore, we obtain the system of congruences :
| + | [[Principle of Insufficient Reasons]] |
| − | | |
| − | <cmath>x \equiv 6 \pmod{210}</cmath>
| |
| − | | |
| − | <cmath>x \equiv 0 \pmod{144}</cmath>.
| |
| − | | |
| − | Solving yields <math>x \equiv 2\boxed{736} \pmod{7!}</math>, and we're done. <math>\square</math>
| |
| − | | |
| − | ===Problem 6===
| |
| − | Suppose that there is <math>192</math> rings, each of different size. All of them are placed on a peg, smallest on the top and biggest on the bottom. There are <math>2</math> other pegs positioned sufficiently apart. A <math>move</math> is made if
| |
| − | | |
| − | (i) <math>1</math> ring changed position (i.e., that ring is transferred from one peg to another)
| |
| − | | |
| − | (ii) No bigger rings are on top of smaller rings.
| |
| − | | |
| − | Then, let <math>x</math> be the minimum possible number <math>moves</math> that can transfer all <math>192</math> rings onto the second peg. Find the remainder when <math>x</math> is divided by <math>1000</math>.
| |
| − | ===Solution 1 (Recursion)===
| |
| − | Let <math>M_n</math> be the minimum possible number <math>moves</math> that can transfer <math>n</math> rings onto the second peg. To build the recursion, we consider what is the minimum possible number <math>moves</math> that can transfer <math>n+1</math> rings onto the second peg. If we use only legal <math>moves</math>, then <math>n+1</math> will be smaller on the top, bigger on the bottom. Hence, the largest ring have to be at the bottom of the second peg, or the largest peg will have nowhere to go. In order for the largest ring to be at the bottom, we must first move the top <math>n</math> rings to the third peg using <math>M_n</math> <math>moves</math>, then place the largest ring onto the bottom of the second peg using <math>1</math> <math>move</math>, and then get all the rings from the third peg on top of the largest ring using another <math>M_n</math> <math>moves</math>. This gives a total of <math>2M_n+1</math>, hence we have <math>M_{n+1}=2M_{n}+1</math>. Obviously, <math>M_1=1</math>. We claim that <math>M_n=2^n-1</math>. This is definitely the case for <math>n=1</math>. If this is true for <math>n</math>, then
| |
| − | | |
| − | <cmath>M_{n+1}=2M_{n}+1=2(2^n-1)+1=2^{n+1}-1</cmath>
| |
| − | | |
| − | so this is true for <math>n+1</math>. Therefore, by [[induction]], <math>M_n=2^n-1</math> is true for all <math>n</math>. Now, <math>x=M_{192}=2^{192}-1</math>. Therefore, we see that
| |
| − | | |
| − | <cmath>x+1 \equiv 0 \pmod{8}</cmath>.
| |
| − | | |
| − | But the <math>\text{mod 125}</math> part is trickier. Notice that by the [[Euler's Totient Theorem]],
| |
| − | | |
| − | <cmath>2^{\phi (125)}=2^{100} \equiv 1 \pmod{125} \implies 2^{200} \equiv 1 \pmod{125}</cmath>
| |
| − | | |
| − | so <math>x+1=\frac{2^{200}}{256}</math> is equivalent to the inverse of <math>256</math> in <math>\text{mod 125}</math>, which is equivalent to the inverse of <math>6</math> in <math>\text{mod 125}</math>, which, by inspection, is simply <math>21</math>. Hence,
| |
| − | | |
| − | <cmath>x+1 \equiv 0 \pmod{8}</cmath>
| |
| − | | |
| − | <cmath>x+1 \equiv 21 \pmod{125}</cmath>
| |
| − | | |
| − | , so by the [[Chinese Remainder Theorem]], <math>x+1 \equiv 896 \pmod{1000} \implies x \equiv \boxed{895} \pmod{1000}</math>. <math>\square</math>
| |
| − | | |
| − | ===Problem 7===
| |
| − | 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
| |
| − | | |
| − | <cmath>(2+r_1)(2+r_2) \dots (2+r_{10000000010})=m!</cmath>
| |
| − | | |
| − | for an integer <math>m</math>. If <math>p</math> is the minimum possible positive integral value of
| |
| − | | |
| − | <cmath>(1+r_1)(1+r_2) \dots (1+r_{10000000010})</cmath>.
| |
| − | | |
| − | Find the number of factors of the prime <math>999999937</math> in <math>p</math>.
| |
| − | | |
| − | ===Solution 1===
| |
| − | Since all integers <math>n</math> ranging from <math>-1</math> to <math>10000000008</math> satisfies <math>f(n)=n</math>, we have that all integers <math>n</math> ranging from <math>-1</math> to <math>10000000008</math> satisfies <math>f(n)-n=0</math>, so by the [[Factor Theorem]],
| |
| − | | |
| − | <cmath>n+1|f(n)-n, n|f(n)-n, \dots, n-10000000008|f(n)-n</cmath>
| |
| − | | |
| − | <cmath>\implies (n+1)n \dots (n-10000000008)|f(n)-n</cmath>.
| |
| − | | |
| − | <cmath>\implies f(n)=a(n+1)n \dots (n-10000000008)+n</cmath>
| |
| − | | |
| − | since <math>f(n)</math> is a <math>10000000010</math>-degrees polynomial, and we let <math>a</math> to be the leading coefficient of <math>f(n)</math>.
| |
| − | | |
| − | Also note that since <math>r_1, r_2, \dots, r_{10000000010}</math> is the roots of <math>f(n)</math>, <math>f(n)=a(n-r_1)(n-r_2) \dots (n-r_{10000000010})</math>
| |
| − | | |
| − | Now, notice that
| |
| − | | |
| − | <cmath>m!=(2+r_1)(2+r_2) \dots (2+r_{10000000010})</cmath>
| |
| − | | |
| − | <cmath>=(-2-r_1)(-2-r_2) \dots (-2-r_{10000000010})</cmath>
| |
| − | | |
| − | <cmath>=\frac{f(-2)}{a}</cmath>
| |
| − | | |
| − | <cmath>=\frac{a(-1) \cdot (-2) \dots (-10000000010)-2}{a}</cmath>
| |
| − | | |
| − | <cmath>=\frac{10000000010! \cdot a-2}{a}</cmath>
| |
| − | | |
| − | <cmath>=10000000010!-\frac{2}{a}</cmath>
| |
| − | | |
| − | Similarly, we have
| |
| − | | |
| − | <cmath>(1+r_1)(1+r_2) \dots (1+r_{10000000010})=\frac{f(-1)}{a}=-\frac{1}{a}</cmath>
| |
| − | | |
| − | To minimize this, we minimize <math>m</math>. The minimum <math>m</math> can get is when <math>m=10000000011</math>, in which case
| |
| − | | |
| − | <cmath>-\frac{2}{a}=10000000011!-10000000010!</cmath>
| |
| − | | |
| − | <cmath>=10000000011 \cdot 10000000010!-10000000010!</cmath>
| |
| − | | |
| − | <cmath>=10000000010 \cdot 10000000010!</cmath>
| |
| − | | |
| − | <cmath>\implies p=(1+r_1)(1+r_2) \dots (1+r_{10000000010})</cmath>
| |
| − | | |
| − | <cmath>=-\frac{1}{a}</cmath>
| |
| − | | |
| − | <cmath>=\frac{10000000010 \cdot 10000000010!}{2}</cmath>
| |
| − | | |
| − | <cmath>=5000000005 \cdot 10000000010!</cmath>
| |
| − | | |
| − | , so there is <math>\left\lfloor \frac{10000000010}{999999937} \right\rfloor=\boxed{011}</math> factors of <math>999999937</math>. <math>\square</math>
| |
| − | | |
| − | ===Problem 8===
| |
| − | <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?
| |
| − | ===Solution 1===
| |
| − | Line <math>IJ</math> is tangent to <math>\Omega</math> with point of tangency point <math>J</math> because <math>OJ=OA \implies \text{J is on } \Omega</math> and <math>IJ</math> is perpendicular to <math>OJ</math> so this is true by the definition of tangent lines. Both <math>G</math> and <math>K</math> are on <math>\Omega</math> and line <math>O’G</math>, so <math>O’G</math> intersects <math>\Omega</math> at both <math>G</math> and <math>K</math>, and since we’re given <math>O’G</math> intersects <math>\Omega</math> at one distinct point, <math>G</math> and <math>K</math> are not distinct, hence they are the same point.
| |
| − | | |
| − | Now, if the center of <math>2</math> tangent circles are connected, the line segment will pass through the point of tangency. In this case, if we connect the center of <math>2</math> tangent circles, <math>\Omega</math> and <math>\Omega_1</math> (<math>O</math> and <math>I</math> respectively), it is going to pass through the point of tangency, namely, <math>K</math>, which is the same point as <math>G</math>, so <math>O</math>, <math>I</math>, and <math>G</math> are collinear. Hence, <math>G</math> and <math>I</math> are on both lines <math>OI</math> and <math>CI</math>, so <math>CI</math> passes through point <math>O</math>, making <math>CG</math> a diameter of <math>\Omega</math>.
| |
| − | | |
| − | Now we state a few claims :
| |
| − | | |
| − | '''Claim 1: <math>\Delta O’IO</math> is equilateral. '''
| |
| − | | |
| − | ''Proof:''
| |
| − | | |
| − | <cmath>\frac{3}{4} (IK+O’L)^2</cmath>
| |
| − | | |
| − | <cmath>=\frac{3}{4} IK^2+\frac{3}{2} IK \cdot O’L+\frac{3}{4} O’L^2</cmath>
| |
| − | | |
| − | <cmath>=IG^2+IG \cdot GC</cmath>
| |
| − | | |
| − | <cmath>=IG \cdot (IG+GC)</cmath>
| |
| − | | |
| − | <cmath>=IG \cdot IC</cmath>
| |
| − | | |
| − | <cmath>=IJ^2</cmath>
| |
| − | | |
| − | where the last equality holds by the [[Power of a Point Theorem]].
| |
| − | | |
| − | Taking the square root of each side yields <math>IJ= \frac{\sqrt{3}}{2} (IK+O’L)^2</math>.
| |
| − | | |
| − | Since, by the definition of point <math>L</math>, <math>L</math> is on <math>\Omega_1</math>. Hence, <math>IK=IL</math>, so
| |
| − | | |
| − | <math>IJ= \frac{\sqrt{3}}{2} (IK+O’L)^2=\frac{\sqrt{3}}{2} (IL+O’L)^2=\frac{\sqrt{3}}{2} IO’^2</math>, and since <math>O’</math> is the reflection of point <math>O</math> over line <math>IJ</math>, <math>OJ=O’J=\frac{OO’}{2}</math>, and since <math>IJ=\frac{\sqrt{3}}{2} IO’^2</math>, by the [[Pythagorean Theorem]] we have
| |
| − | | |
| − | <math>JO’=\frac{IO’}{2} \implies \frac{OO’}{2}=\frac{IO’}{2} \implies OO’=IO’</math>
| |
| − | | |
| − | Since <math>IJ</math> is the perpendicular bisector of <math>OO’</math>, <math>IO’=IO</math> and we have <math>IO=IO’=OO’</math> hence <math>\Delta O’IO</math> is equilateral. <math>\square</math>
| |
| − | | |
| − | With this in mind, we see that
| |
| − | | |
| − | <cmath>2OJ=OO’=OI=OK+KI=OJ+GI=OJ+AC \implies OA=OJ=AC</cmath>
| |
| − | | |
| − | Here, we state another claim :
| |
| − | | |
| − | '''Claim 2 : <math>BH</math> is a diameter of <math>\Omega</math>'''
| |
| − | | |
| − | ''Proof:'' Since <math>OA=OC=AC</math>, we have
| |
| − | | |
| − | <cmath>\angle AOC =60^\circ \implies \angle ABC=\frac{1}{2} \angle AOC=30^\circ \implies AB=\sqrt{3} AC</cmath>
| |
| − | | |
| − | and the same reasoning with <math>\Delta CAH</math> gives <math>CH=\sqrt{3} AC</math> since <math>AH=IG=AC</math>.
| |
| − | | |
| − | Now, apply [[Ptolemy’s Theorem]] gives
| |
| − | | |
| − | <cmath>BH \cdot AC+BC \cdot AH=CH \cdot AB \implies BH \cdot AC+AC^2=3AC^2 \implies BH=2AC=2OA</cmath>
| |
| − | | |
| − | so <math>BH</math> is a diameter. <math>\square</math>
| |
| − | | |
| − | From that, we see that <math>\angle BEH=90^\circ</math>, so <math>\frac{EH}{BH}=\cos{BHE}</math>. Now,
| |
| − | | |
| − | <cmath>\angle BHE=\angle BAE=\frac{1}{2} \angle CAB=15^\circ</cmath>
| |
| − | | |
| − | , so
| |
| − | | |
| − | <cmath>\frac{EH}{BH}=\cos{15}=\frac{\sqrt{6}+\sqrt{2}}{4}=\frac{\sqrt{2}}{4} (\sqrt{3}+1)</cmath>
| |
| − | | |
| − | , so
| |
| − | | |
| − | <cmath>a=4, b=2, c=3, d=1 \implies a^2+b^2+c^2+d^2+abcd=1+4+9+16+24=\boxed{054}</cmath>
| |
| − | | |
| − | , and we’re done. <math>\blacksquare</math>
| |
| − | | |
| − | ===Problem 9===
| |
| − | Suppose <cmath>\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{n \cdot m^2+m \cdot n^2+2mn}+\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 [\frac{(1+\frac{1}{x})^{x}}{e}-1]]=\frac{p}{q}</cmath> where <math>p</math> and <math>q</math> are relatively prime positive integers. Find <math>p+q</math>.
| |
| − | | |
| − | ===Solution 1(Wordless endless bash)===
| |
| − | <cmath>\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{n \cdot m^2+m \cdot n^2+2mn}</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{mn(m+n+2)}</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \frac{1}{n} \sum_{m=1}^{\infty} \frac{1}{m(m+n+2)}</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \frac{1}{n} \sum_{m=1}^{\infty} \frac{1}{n+2} (\frac{1}{m}-\frac{1}{m+n+2})</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \frac{1}{n(n+2)} \sum_{m=1}^{\infty} (\frac{1}{m}-\frac{1}{m+n+2})</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \frac{1}{n(n+2)} \cdot [(1-\frac{1}{n+3})+(\frac{1}{2}-\frac{1}{n+4})+ \dots]</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} \frac{1}{n(n+2)} \cdot (1+\frac{1}{2}+\frac{1}{3}+ \dots \frac{1}{n+2})</cmath>
| |
| − | | |
| − | <cmath>=\sum_{n=1}^{\infty} (\frac{\frac{1}{2}}{n}-\frac{\frac{1}{2}}{n+2}) \cdot (1+\frac{1}{2}+\frac{1}{3}+ \dots \frac{1}{n+2})</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [(1-\frac{1}{3})(1+\frac{1}{2}+\frac{1}{3})+(\frac{1}{2}-\frac{1}{4})(1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4})+ \dots</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [[(1-\frac{1}{3})+(\frac{1}{3}-\frac{1}{5})+\dots](1+\frac{1}{2}+\frac{1}{3})+[(\frac{1}{2}-\frac{1}{4})+(\frac{1}{4}-\frac{1}{6})+\dots](1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4})+[(\frac{1}{3}-\frac{1}{5})+(\frac{1}{5}-\frac{1}{7})+\dots](\frac{1}{4}+\frac{1}{5})+\dots]</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [(1+\frac{1}{2}+\frac{1}{3})+\frac{1}{2} (1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4})+\frac{1}{3} (\frac{1}{4}+\frac{1}{5})+\dots]</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [\frac{11}{6}+\frac{1}{2} \cdot \frac{25}{12}+(\frac{1}{3 \cdot 4}+\frac{1}{4 \cdot 5}+\dots)+(\frac{1}{3 \cdot 5}+\frac{1}{4 \cdot 6}+\dots)]</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [\frac{69}{24}+[(\frac{1}{3}-\frac{1}{4})+(\frac{1}{4}-\frac{1}{5})+\dots ]+\frac{1}{2} [(\frac{1}{3}-\frac{1}{5})+(\frac{1}{4}-\frac{1}{6})+\dots ]</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} [\frac{69}{24}+\frac{1}{3}+\frac{1}{6}+\frac{1}{8}]</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2} \cdot \frac{84}{24}</cmath>
| |
| − | | |
| − | <cmath>=\frac{7}{4}</cmath>
| |
| − | | |
| − | <cmath>(1+\frac{1}{x})^x=e^{x \cdot \ln (1+\frac{1}{x})}</cmath>
| |
| − | | |
| − | <cmath>=e^{x \cdot [(\frac{1}{x})-\frac{(\frac{1}{x})^2}{2}+\frac{(\frac{1}{x})^3}{3}+\dots]}</cmath>
| |
| − | | |
| − | <cmath>=e^{1-\frac{1}{2} (\frac{1}{x})+\frac{1}{3} (\frac{1}{x})^2+\dots}</cmath>
| |
| − | | |
| − | <cmath>=e \cdot e^{-\frac{1}{2} (\frac{1}{x})} \cdot e^{\frac{1}{3} (\frac{1}{x})^2} \dots</cmath>
| |
| − | | |
| − | <cmath>=e \cdot [1-\frac{1}{2x}+\frac{1}{2!} (\frac{1}{2x})^2- \dots] \cdot [1+\frac{1}{3x^2}+\frac{1}{2!} (\frac{1}{3x^2})^2+ \dots]</cmath>
| |
| − | | |
| − | <cmath>=e[1-\frac{1}{2x}+\frac{11}{24} (\frac{1}{x})^2+\dots]</cmath>
| |
| − | | |
| − | <cmath>\implies \lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 [\frac{(1+\frac{1}{x})^{x}}{e}-1]]</cmath>
| |
| − | | |
| − | <cmath>=\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 [\frac{e[1-\frac{1}{2x}+\frac{11}{24} (\frac{1}{x})^2+\dots]}{e}-1]]</cmath>
| |
| − | | |
| − | <cmath>=\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 (1-\frac{1}{2x}+\frac{11}{24} (\frac{1}{x})^2+\dots-1)]</cmath>
| |
| − | | |
| − | <cmath>=\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 (-\frac{1}{2x}+\frac{11}{24} (\frac{1}{x})^2+\dots)]</cmath>
| |
| − | | |
| − | <cmath>=\lim_{x\rightarrow \infty} (\frac{x}{2}-\frac{x}{2}+\frac{11}{24}+\dots)</cmath>
| |
| − | | |
| − | <cmath>=\frac{11}{24}</cmath>
| |
| − | | |
| − | <cmath>\implies \sum_{n=1}^{\infty} \sum_{m=1}^{\infty} \frac{1}{n \cdot m^2+m \cdot n^2+2mn}+\lim_{x\rightarrow \infty} [\frac{x}{2}+x^2 [\frac{(1+\frac{1}{x})^{x}}{e}-1]]</cmath>
| |
| − | | |
| − | <cmath>=\frac{7}{4}+\frac{11}{24}</cmath>
| |
| − | | |
| − | <cmath>=\frac{53}{24}</cmath>
| |
| − | | |
| − | <cmath>\implies p=53,q=24</cmath>
| |
| − | | |
| − | <cmath>\implies p+q=\boxed{077}</cmath> <math>\square</math>
| |
| − | | |
| − | ===Problem 10===
| |
| − | In <math>\Delta ABC</math> with <math>AB=AC</math>, <math>D</math> is the foot of the perpendicular from <math>A</math> to <math>BC</math>. <math>E</math> is the foot of the perpendicular from <math>D</math> to <math>AC</math>. <math>F</math> is the midpoint of <math>DE</math>. Prove that <math>AF \perp BE</math>.
| |
| − | | |
| − | ===Solution 1 (Analytic geo)===
| |
| − | Let
| |
| − | | |
| − | <cmath>A=(0,0)</cmath>
| |
| − | | |
| − | <cmath>B=(4a,4b)</cmath>
| |
| − | | |
| − | <cmath>C=(4 \sqrt{a^2+b^2},0)</cmath>
| |
| − | | |
| − | We set it this way to simplify calculation when we calculate the coordinates of <math>E</math> and <math>F</math> (Notice to find <math>E</math>, you just need to take the x coordinate of <math>D</math> and let the y coordinate be <math>0</math>).
| |
| − | | |
| − | Obviously,
| |
| − | | |
| − | <cmath>D=(\frac{4a+4 \sqrt{a^2+b^2}}{2},\frac{4b+0}{2})=(2a+2 \sqrt{a^2+b^2},2b)</cmath>
| |
| − | | |
| − | <cmath>\implies E=(2a+2 \sqrt{a^2+b^2},0)</cmath>
| |
| − | | |
| − | <cmath>\implies F=(\frac{2a+2 \sqrt{a^2+b^2}+2a+2 \sqrt{a^2+b^2}}{2},\frac{2b+0}{2})=(2a+2 \sqrt{a^2+b^2},b)</cmath>
| |
| − | | |
| − | Now, we see that
| |
| − | | |
| − | <cmath>\text{Slope} _ {AF}=\frac{b}{2a+2 \sqrt{a^2+b^2}}</cmath>
| |
| − | | |
| − | <cmath>\text{Slope} _ {BE}=\frac{0-4b}{2a+2 \sqrt{a^2+b^2}-4a}=\frac{-2b}{\sqrt{a^2+b^2}-a}</cmath>
| |
| − | | |
| − | <cmath>\implies \text{Slope} _ {AF} \cdot \text{Slope} _ {BE}=\frac{b}{2a+2 \sqrt{a^2+b^2}} \cdot \frac{-2b}{a+ \sqrt{a^2+b^2}-2a}=\frac{-2b^2}{2(a+\sqrt{a^2+b^2})(\sqrt{a^2+b^2}-a)}=\frac{-2b^2}{2b^2}=-1</cmath>
| |
| − | | |
| − | , so <math>AF \perp BE</math>, as desired. <math>\square</math>
| |
| − | ===Solution 2 (Hard vector bash)===
| |
| − | ====Solution 2a (Hard)====
| |
| − | <cmath>\overrightarrow{AF} \cdot \overrightarrow{BE}</cmath>
| |
| − | | |
| − | <cmath>=(\overrightarrow{AE}+\overrightarrow{EF}) \cdot (\overrightarrow{BD}+\overrightarrow{DE})</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{AE} \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{DE}+\overrightarrow{AE} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{AE} \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=(\overrightarrow{AD}+\overrightarrow{DE}) \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{BD} + \overrightarrow{EF} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{DE} \cdot \overrightarrow{BD}+\overrightarrow{EF} \cdot \overrightarrow{BD} + \overrightarrow{EF} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{DE} \cdot \overrightarrow{DC}-\frac{\overrightarrow{DE}}{2} \cdot \overrightarrow{BD}-\frac{\overrightarrow{DE}}{2} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=\frac{\overrightarrow{DE}}{2} \cdot \overrightarrow{DC}-\frac{\overrightarrow{DE}}{2} \cdot \overrightarrow{DE}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{DE} \cdot (\frac{\overrightarrow{DC}-\overrightarrow{DE}}{2})</cmath>
| |
| − | | |
| − | <cmath>=\frac{\overrightarrow{DE} \cdot \overrightarrow{EC}}{2}</cmath>
| |
| − | | |
| − | <cmath>=0</cmath>
| |
| − | | |
| − | Hence, <math>AF \perp BE</math>. <math>\square</math>
| |
| − | ====Solution 2b (Harder)====
| |
| − | <cmath>\angle ACD=\angle ECD</cmath>
| |
| − | | |
| − | <cmath>\angle ADC=\angle DEC</cmath>
| |
| − | | |
| − | <cmath>\implies \Delta ADC \sim \Delta DEC</cmath>
| |
| − | | |
| − | <cmath>\implies \frac{EC}{DC}=\frac{DC}{AC}</cmath>
| |
| − | | |
| − | <cmath>\implies EC=\frac{DC^2}{AC}</cmath>
| |
| − | | |
| − | <cmath>\implies \overrightarrow{E}=\overrightarrow{C}+\overrightarrow{CE}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{C}+\frac{CE}{AC} \cdot \overrightarrow{CA}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{C}+\frac{DC^2}{AC^2} \overrightarrow{CA}</cmath>
| |
| − | | |
| − | <cmath>=\overrightarrow{C}+\frac{DC^2}{AC^2} (\overrightarrow{A}-\overrightarrow{C})</cmath>
| |
| − | | |
| − | <cmath>=\frac{AC^2-DC^2}{AC^2} \overrightarrow{C}+\frac{DC^2}{AC^2} \overrightarrow{A}</cmath>
| |
| − | | |
| − | <cmath>=\frac{AD^2}{AC^2} \overrightarrow{C}+\frac{DC^2}{AC^2} \overrightarrow{A}</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{D}=\frac{\overrightarrow{B}+\overrightarrow{C}}{2}</cmath>
| |
| − | | |
| − | Since <math>F</math> is the midpoint of <math>DE</math>,
| |
| − | | |
| − | <cmath>\overrightarrow{F}=\frac{\overrightarrow{D}+\overrightarrow{E}}{2}</cmath>
| |
| − | | |
| − | <cmath>=\frac{\frac{\overrightarrow{B}+\overrightarrow{C}}{2}+\frac{AD^2}{AC^2} \overrightarrow{C}+\frac{DC^2}{AC^2} \overrightarrow{A}}{2}</cmath>
| |
| − | | |
| − | <cmath>=\frac{\overrightarrow{B}}{4}+\frac{AC^2+2AD^2}{4AC^2} \overrightarrow{C}+\frac{DC^2}{2AC^2} \overrightarrow{A}</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{AF}=\overrightarrow{F}-\overrightarrow{A}=\frac{\overrightarrow{B}}{4}+\frac{AC^2+2AD^2}{4AC^2} \overrightarrow{C}+\frac{DC^2-2AC^2}{2AC^2} \overrightarrow{A}</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{BE}=\overrightarrow{E}-\overrightarrow{B}=\frac{AD^2}{AC^2} \overrightarrow{C}+\frac{DC^2}{AC^2} \overrightarrow{A}-\overrightarrow{B}</cmath>
| |
| − | | |
| − | Now come the coordinates. Let
| |
| − | | |
| − | <cmath>A=(0,0)</cmath>
| |
| − | | |
| − | <cmath>B=(-a,-b)</cmath>
| |
| − | | |
| − | <cmath>C=(a,-b)</cmath>
| |
| − | | |
| − | so that
| |
| − | | |
| − | <cmath>\overrightarrow{A}=\langle 0,0 \rangle</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{B}=\langle -a,-b \rangle</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{C}=\langle a,-b \rangle</cmath>.
| |
| − | | |
| − | Therefore,
| |
| − | | |
| − | <cmath>\overrightarrow{AF}=\langle \frac{-a}{4},\frac{-b}{4} \rangle + \frac{(a^2+b^2)+2b^2}{4(a^2+b^2)} \langle a,-b \rangle=\langle \frac{ab^2}{2(a^2+b^2)},\frac{-a^2b-2b^3}{2(a^2+b^2)} \rangle</cmath>
| |
| − | | |
| − | <cmath>\overrightarrow{BE}=\frac{b^2}{a^2+b^2} \langle a,-b \rangle-\langle -a,-b \rangle=\langle \frac{2ab^2+a^3}{a^2+b^2},\frac{a^2b}{a^2+b^2} \rangle</cmath>
| |
| − | | |
| − | <cmath>\implies \overrightarrow{AF} \cdot \overrightarrow{BE}=\langle \frac{ab^2}{2(a^2+b^2)},\frac{-a^2b-2b^3}{2(a^2+b^2)} \rangle \cdot \langle \frac{2ab^2+a^3}{a^2+b^2},\frac{a^2b}{a^2+b^2} \rangle</cmath>
| |
| − | | |
| − | <cmath>=\frac{1}{2(a^2+b^2)^2}[ab^2(a^3+2ab^2)-a^2b(a^2b+2b^3)]</cmath>
| |
| − | | |
| − | <cmath>=\frac{ab}{2(a^2+b^2)^2} (a^3b+2ab^3-a^3b-2ab^3)</cmath>
| |
| − | | |
| − | <cmath>=0</cmath>
| |
| − | | |
| − | Hence, we have that <math>AF</math> is perpendicular to <math>BE</math>. <math>\square</math>
| |
| | | | |
| | ==Vandalism area== | | ==Vandalism area== |
| − | Here, you can add anything, delete anything, and do anything! (Don't delete this line since it's instruction and don't be inappropriate) However, do NOT vandalize before this word (Feel free to delete this and the period that follows). | + | Here, you can add anything, delete anything, and do anything! (Don't delete this line since it's instruction and don't be inappropriate) Do not delete the see also. However, do NOT vandalize before this word (Feel free to delete this and the period that follows). |
| | | | |
| − | EX:{{AMC10 Problems|year=2021 Fall|ab=A}}
| + | (ok :) :) this page is so cool!) |
| | | | |
| − | ==Problem 1==
| + | honestly i think your user page is very cool. :) |
| − | What is the value of <math>\frac{(2112-2021)^2}{169}</math>?
| |
| | | | |
| − | <math>\textbf{(A) } 7 \qquad\textbf{(B) } 21 \qquad\textbf{(C) } 49 \qquad\textbf{(D) } 64 \qquad\textbf{(E) } 91</math>
| + | Hi Ddk001 [[User:zhenghua]] (Taking Oly Geo) |
| | | | |
| − | [[2021 Fall AMC 10A Problems/Problem 1|Solution]]
| + | Zhenghua I havent seen you since forever!!! I'm not focusing on compitition right now so you probably won't see me in any of your classes. |
| | | | |
| − | ==Problem 2== | + | ==See also== |
| − | Menkara has a <math>4 \times 6</math> index card. If she shortens the length of one side of this card by <math>1</math> inch, the card would have area <math>18</math> square inches. What would the area of the card be in square inches if instead she shortens the length of the other side by <math>1</math> inch?
| + | * My [[User talk:Ddk001|talk page]] |
| − | | + | * [[Problems Collection|My problems collection]] |
| − | <math>\textbf{(A) }16\qquad\textbf{(B) }17\qquad\textbf{(C) }18\qquad\textbf{(D) }19\qquad\textbf{(E) }20</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 2|Solution]]
| |
| − | | |
| − | ==Problem 3==
| |
| − | | |
| − | What is the maximum number of balls of clay of radius <math>2</math> that can completely fit inside a cube of side length <math>6</math> assuming the balls can be reshaped but not compressed before they are packed in the cube?
| |
| − | | |
| − | <math>\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad\textbf{(E) }7</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 3|Solution]]
| |
| − | | |
| − | ==Problem 4==
| |
| − | Mr. Lopez has a choice of two routes to get to work. Route A is <math>6</math> miles long, and his average speed along this route is <math>30</math> miles per hour. Route B is <math>5</math> miles long, and his average speed along this route is <math>40</math> miles per hour, except for a <math>\frac{1}{2}</math>-mile stretch in a school zone where his average speed is <math>20</math> miles per hour. By how many minutes is Route B quicker than Route A?
| |
| − | | |
| − | <math>\textbf{(A)}\ 2 \frac{3}{4} \qquad\textbf{(B)}\ 3 \frac{3}{4} \qquad\textbf{(C)}\ 4 \frac{1}{2} \qquad\textbf{(D)}\
| |
| − | 5 \frac{1}{2} \qquad\textbf{(E)}\ 6 \frac{3}{4}</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 4|Solution]]
| |
| − | | |
| − | ==Problem 5==
| |
| − | The six-digit number <math>\underline{2}\,\underline{0}\,\underline{2}\,\underline{1}\,\underline{0}\,\underline{A}</math> is prime for only one digit <math>A.</math> What is <math>A?</math>
| |
| − | | |
| − | <math>\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 5|Solution]]
| |
| − | | |
| − | ==Problem 6==
| |
| − | | |
| − | Elmer the emu takes <math>44</math> equal strides to walk between consecutive telephone poles on a rural road. Oscar the ostrich can cover the same distance in <math>12</math> equal leaps. The telephone poles are evenly spaced, and the <math>41</math>st pole along this road is exactly one mile (<math>5280</math> feet) from the first pole. How much longer, in feet, is Oscar's leap than Elmer's stride?
| |
| − | | |
| − | <math>\textbf{(A) }6\qquad\textbf{(B) }8\qquad\textbf{(C) }10\qquad\textbf{(D) }11\qquad\textbf{(E) }15</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 6|Solution]]
| |
| − | | |
| − | ==Problem 7==
| |
| − | | |
| − | As shown in the figure below, point <math>E</math> lies on the opposite half-plane determined by line <math>CD</math> from point <math>A</math> so that <math>\angle CDE = 110^\circ</math>. Point <math>F</math> lies on <math>\overline{AD}</math> so that <math>DE=DF</math>, and <math>ABCD</math> is a square. What is the degree measure of <math>\angle AFE</math>?
| |
| − | | |
| − | <asy>
| |
| − | size(6cm);
| |
| − | pair A = (0,10);
| |
| − | label("$A$", A, N);
| |
| − | pair B = (0,0);
| |
| − | label("$B$", B, S);
| |
| − | pair C = (10,0);
| |
| − | label("$C$", C, S);
| |
| − | pair D = (10,10);
| |
| − | label("$D$", D, SW);
| |
| − | pair EE = (15,11.8);
| |
| − | label("$E$", EE, N);
| |
| − | pair F = (3,10);
| |
| − | label("$F$", F, N);
| |
| − | filldraw(D--arc(D,2.5,270,380)--cycle,lightgray);
| |
| − | dot(A^^B^^C^^D^^EE^^F);
| |
| − | draw(A--B--C--D--cycle);
| |
| − | draw(D--EE--F--cycle);
| |
| − | label("$110^\circ$", (15,9), SW);
| |
| − | </asy>
| |
| − | | |
| − | <math>\textbf{(A) }160\qquad\textbf{(B) }164\qquad\textbf{(C) }166\qquad\textbf{(D) }170\qquad\textbf{(E) }174</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 7|Solution]]
| |
| − | | |
| − | ==Problem 8==
| |
| − | | |
| − | A two-digit positive integer is said to be <math>\emph{cuddly}</math> if it is equal to the sum of its nonzero tens digit and the square of its units digit. How many two-digit positive integers are cuddly?
| |
| − | | |
| − | <math>\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 8|Solution]]
| |
| − | | |
| − | ==Problem 9== | |
| − | | |
| − | When a certain unfair die is rolled, an even number is <math>3</math> times as likely to appear as an odd number. The die is rolled twice. What is the probability that the sum of the numbers rolled is even?
| |
| − | | |
| − | <math>\textbf{(A) }\dfrac38\qquad\textbf{(B) }\dfrac49\qquad\textbf{(C) }\dfrac59\qquad\textbf{(D) }\dfrac9{16}\qquad\textbf{(E) }\dfrac58</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 9|Solution]]
| |
| − | | |
| − | ==Problem 10==
| |
| − | | |
| − | A school has <math>100</math> students and <math>5</math> teachers. In the first period, each student is taking one class, and each teacher is teaching one class. The enrollments in the classes are <math>50, 20, 20, 5, </math> and <math>5</math>. Let <math>t</math> be the average value obtained if a teacher is picked at random and the number of students in their class is noted. Let <math>s</math> be the average value obtained if a student was picked at random and the number of students in their class, including the student, is noted. What is <math>t-s</math>?
| |
| − | | |
| − | <math>\textbf{(A)}\ {-}18.5 \qquad\textbf{(B)}\ {-}13.5 \qquad\textbf{(C)}\ 0 \qquad\textbf{(D)}\ 13.5 \qquad\textbf{(E)}\ 18.5</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 10|Solution]]
| |
| − | | |
| − | ==Problem 11==
| |
| − | | |
| − | Emily sees a ship traveling at a constant speed along a straight section of a river. She walks parallel to the riverbank at a uniform rate faster than the ship. She counts <math>210</math> equal steps walking from the back of the ship to the front. Walking in the opposite direction, she counts <math>42</math> steps of the same size from the front of the ship to the back. In terms of Emily's equal steps, what is the length of the ship?
| |
| − | | |
| − | <math>\textbf{(A) }70\qquad\textbf{(B) }84\qquad\textbf{(C) }98\qquad\textbf{(D) }105\qquad\textbf{(E) }126</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 11|Solution]]
| |
| − | | |
| − | ==Problem 12==
| |
| − | The base-nine representation of the number <math>N</math> is <math>27{,}006{,}000{,}052_{\text{nine}}.</math> What is the remainder when <math>N</math> is divided by <math>5?</math>
| |
| − | | |
| − | <math>\textbf{(A) } 0\qquad\textbf{(B) } 1\qquad\textbf{(C) } 2\qquad\textbf{(D) } 3\qquad\textbf{(E) }4</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 12|Solution]]
| |
| − | | |
| − | ==Problem 13==
| |
| − | Each of <math>6</math> balls is randomly and independently painted either black or white with equal probability. What is the probability that every ball is different in color from more than half of the other <math>5</math> balls?
| |
| − | | |
| − | <math>\textbf{(A) } \frac{1}{64}\qquad\textbf{(B) } \frac{1}{6}\qquad\textbf{(C) } \frac{1}{4}\qquad\textbf{(D) } \frac{5}{16}\qquad\textbf{(E) }\frac{1}{2}</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 13|Solution]]
| |
| − | | |
| − | ==Problem 14==
| |
| − | How many ordered pairs <math>(x,y)</math> of real numbers satisfy the following system of equations?
| |
| − | <cmath>\begin{align*}
| |
| − | x^2+3y&=9 \\
| |
| − | (|x|+|y|-4)^2 &= 1
| |
| − | \end{align*}</cmath>
| |
| − | <math>\textbf{(A) } 1 \qquad\textbf{(B) } 2 \qquad\textbf{(C) } 3 \qquad\textbf{(D) } 5 \qquad\textbf{(E) } 7</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 14|Solution]]
| |
| − | | |
| − | ==Problem 15==
| |
| − | Isosceles triangle <math>ABC</math> has <math>AB = AC = 3\sqrt6</math>, and a circle with radius <math>5\sqrt2</math> is tangent to line <math>AB</math> at <math>B</math> and to line <math>AC</math> at <math>C</math>. What is the area of the circle that passes through vertices <math>A</math>, <math>B</math>, and <math>C?</math>
| |
| − | | |
| − | <math>\textbf{(A) }24\pi\qquad\textbf{(B) }25\pi\qquad\textbf{(C) }26\pi\qquad\textbf{(D) }27\pi\qquad\textbf{(E) }28\pi</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 15|Solution]] | |
| − | | |
| − | ==Problem 16==
| |
| − | The graph of <cmath>f(x) = |\lfloor x \rfloor| - |\lfloor 1 - x \rfloor|</cmath> is symmetric about which of the following? (Here <math>\lfloor x \rfloor</math> is the greatest integer not exceeding <math>x</math>.)
| |
| − | | |
| − | <math>\textbf{(A) }\text{the }y\text{-axis}\qquad \textbf{(B) }\text{the line }x = 1\qquad \textbf{(C) }\text{the origin}\qquad
| |
| − | \textbf{(D) }\text{ the point }\left(\dfrac12, 0\right)\qquad \textbf{(E) }\text{the point }(1,0)</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 16|Solution]]
| |
| − | | |
| − | ==Problem 17==
| |
| − | An architect is building a structure that will place vertical pillars at the vertices of regular hexagon <math>ABCDEF</math>, which is lying horizontally on the ground. The six pillars will hold up a flat solar panel that will not be parallel to the ground. The heights of pillars at <math>A</math>, <math>B</math>, and <math>C</math> are <math>12</math>, <math>9</math>, and <math>10</math> meters, respectively. What is the height, in meters, of the pillar at <math>E</math>?
| |
| − | | |
| − | <math>\textbf{(A) }9 \qquad\textbf{(B) } 6\sqrt{3} \qquad\textbf{(C) } 8\sqrt{3} \qquad\textbf{(D) } 17 \qquad\textbf{(E) }12\sqrt{3}</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 17|Solution]]
| |
| − | | |
| − | ==Problem 18==
| |
| − | A farmer's rectangular field is partitioned into <math>2</math> by <math>2</math> grid of <math>4</math> rectangular sections as shown in the figure. In each section the farmer will plant one crop: corn, wheat, soybeans, or potatoes. The farmer does not want to grow corn and wheat in any two sections that share a border, and the farmer does not want to grow soybeans and potatoes in any two sections that share a border. Given these restrictions, in how many ways can the farmer choose crops to plant in each of the four sections of the field?
| |
| − | <asy>
| |
| − | draw((0,0)--(100,0)--(100,50)--(0,50)--cycle);
| |
| − | draw((50,0)--(50,50));
| |
| − | draw((0,25)--(100,25));
| |
| − | </asy>
| |
| − | <math>\textbf{(A)}\ 12 \qquad \textbf{(B)}\ 64 \qquad \textbf{(C)}\ 84 \qquad \textbf{(D)}\ 90 \qquad \textbf{(E)}\ 144</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 18|Solution]]
| |
| − | | |
| − | ==Problem 19==
| |
| − | A disk of radius <math>1</math> rolls all the way around the inside of a square of side length <math>s>4</math> and sweeps out a region of area <math>A</math>. A second disk of radius <math>1</math> rolls all the way around the outside of the same square and sweeps out a region of area <math>2A</math>. The value of <math>s</math> can be written as <math>a+\frac{b\pi}{c}</math>, where <math>a,b</math>, and <math>c</math> are positive integers and <math>b</math> and <math>c</math> are relatively prime. What is <math>a+b+c</math>?
| |
| − | | |
| − | <math>\textbf{(A)} ~10\qquad\textbf{(B)} ~11\qquad\textbf{(C)} ~12\qquad\textbf{(D)} ~13\qquad\textbf{(E)} ~14</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 19|Solution]]
| |
| − | | |
| − | ==Problem 20==
| |
| − | For how many ordered pairs <math>(b,c)</math> of positive integers does neither <math>x^2+bx+c=0</math> nor <math>x^2+cx+b=0</math> have two distinct real solutions?
| |
| − | | |
| − | <math>\textbf{(A) } 4 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 12 \qquad \textbf{(E) } 16 \qquad</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 20|Solution]]
| |
| − | | |
| − | ==Problem 21==
| |
| − | Each of the <math>20</math> balls is tossed independently and at random into one of the <math>5</math> bins. Let <math>p</math> be the probability that some bin ends up with <math>3</math> balls, another with <math>5</math> balls, and the other three with <math>4</math> balls each. Let <math>q</math> be the probability that every bin ends up with <math>4</math> balls. What is <math>\frac{p}{q}</math>?
| |
| − | | |
| − | <math>\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\
| |
| − | 12 \qquad\textbf{(E)}\ 16</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 21|Solution]]
| |
| − | | |
| − | ==Problem 22==
| |
| − | Inside a right circular cone with base radius <math>5</math> and height <math>12</math> are three congruent spheres with radius <math>r</math>. Each sphere is tangent to the other two spheres and also tangent to the base and side of the cone. What is <math>r</math>?
| |
| − | | |
| − | <math>\textbf{(A)}\ \frac{3}{2} \qquad\textbf{(B)}\ \frac{90-40\sqrt{3}}{11} \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ \frac{144-25\sqrt{3}}{44} \qquad\textbf{(E)}\ \frac{5}{2}</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 22|Solution]]
| |
| − | | |
| − | ==Problem 23==
| |
| − | | |
| − | For each positive integer <math>n</math>, let <math>f_1(n)</math> be twice the number of positive integer divisors of <math>n</math>, and for <math>j \ge 2</math>, let <math>f_j(n) = f_1(f_{j-1}(n))</math>. For how many values of <math>n \le 50</math> is <math>f_{50}(n) = 12?</math>
| |
| − | | |
| − | <math>\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 23|Solution]]
| |
| − | | |
| − | ==Problem 24==
| |
| − | Each of the <math>12</math> edges of a cube is labeled <math>0</math> or <math>1</math>. Two labelings are considered different even if one can be obtained from the other by a sequence of one or more rotations and/or reflections. For how many such labelings is the sum of the labels on the edges of each of the <math>6</math> faces of the cube equal to <math>2</math>?
| |
| − | | |
| − | <math>\textbf{(A) } 8 \qquad\textbf{(B) } 10 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 16 \qquad\textbf{(E) } 20</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 24|Solution]]
| |
| − | | |
| − | ==Problem 25==
| |
| − | A quadratic polynomial with real coefficients and leading coefficient <math>1</math> is called <math>\emph{disrespectful}</math> if the equation <math>p(p(x))=0</math> is satisfied by exactly three real numbers. Among all the disrespectful quadratic polynomials, there is a unique such polynomial <math>\tilde{p}(x)</math> for which the sum of the roots is maximized. What is <math>\tilde{p}(1)</math>?
| |
| − | | |
| − | <math>\textbf{(A) } \frac{5}{16} \qquad\textbf{(B) } \frac{1}{2} \qquad\textbf{(C) } \frac{5}{8} \qquad\textbf{(D) } 1 \qquad\textbf{(E) } \frac{9}{8}</math>
| |
| − | | |
| − | [[2021 Fall AMC 10A Problems/Problem 25|Solution]] | |
| | | | |
| − | ==See Also==
| + | The problems on this page are NOT copyrighted by the [http://www.maa.org Mathematical Association of America]'s [http://amc.maa.org American Mathematics Competitions]. [[File:AMC_logo.png|middle]] |
| − | {{AMC10 box|year=2021 Fall|ab=A|before=[[2021 AMC 10B]]|after=[[2021 Fall AMC 10B]]}}
| + | <div style="clear:both;"> |
| − | * [[AMC 10]]
| |
| − | * [[AMC 10 Problems and Solutions]]
| |
| − | * [[Mathematics competitions]]
| |
| − | * [[Mathematics competition resources]]
| |
| − | {{MAA Notice}}
| |
| | | | |
| − | ==See also==
| + | Can someone help me clear out [[Problems Collection|this page]]? |
| − | * My [[User talk:Ddk001|talk page]]
| |
![[asy]draw((0,0)----(0,6));draw((0,-3)----(-3,3));draw((3,0)----(-3,6));draw((6,-6)----(-6,3));draw((6,0)----(-6,0));[/asy]](http://latex.artofproblemsolving.com/d/6/1/d61604256e9de426afc94111a204811ff9d3cf0e.png)
![[asy]draw(circle((0,0),1));draw((1,0)----(0,1));draw((1,0)----(0,2));draw((0,-1)----(0,2));draw(circle((0,3),2));draw(circle((0,4),3));draw(circle((0,5),4));draw(circle((0,2),1));draw((0,9)----(0,18));[/asy]](http://latex.artofproblemsolving.com/d/7/8/d78519cbbf9c22e2c4ea74ee089557db7a04e2ba.png)
![\[(p^2+1)(q^2+1)-((pq)^2-pq+1)\]](http://latex.artofproblemsolving.com/b/1/1/b11bf3dce41593092737df0eea5f902de3989389.png)
and 
are prime. Find that perfect square. ~Ddk001
. Suppose this equals 
for some positive integer 
. We rewrite using the square of a binomial pattern to find that 
. Through trial and error on small values of 
and 
in some order. The perfect square formed using these numbers is 
.
intersects 
. The perimeter of this diamond is expressible as 
, where 
, 
, and 
are integers, and 
is divided by 
?
![[asy] unitsize(1inch); draw((0,0)--(0,2)); draw((0,2)--(2,0)); draw((2,0)--(0,0)); draw(circle((0.586,0.586),0.586)); draw((0,0)--(0,1.172),red); draw((0,1.172)--(1.172,1.172)); draw((1.172,1.172)--(1.172,0)); draw((1.172,0)--(0,0),red); draw((0,1.172)--(0.828,1.172),red); draw((0.828,1.172)--(1.172,0.828),red); draw((1.172,0.828)--(1.172,0),red); draw((0,0.1)--(0.1,0.1)); draw((0.1,0.1)--(0.1,0)); label("$A$",(0,2.1)); label("$B$",(0,-0.1)); label("$C$",(2,-0.1)); label("$2024$",(-0.2,1)); label("$2024$",(1,-0.2)); [/asy]](http://latex.artofproblemsolving.com/c/f/4/cf4b2b8da31fb32285d5b573ffbb35e870afea4c.png)
, 
, can be calculated as
![\[r=\frac{\textbf{Area}_{ABC}}{\textbf{Semiperimeter}} \implies r=\frac{2024^2/2}{(2024+2024+2024 \sqrt{2})/2}=\frac{2024}{2+\sqrt{2}}=2024-1012\sqrt{2}\]](http://latex.artofproblemsolving.com/d/0/2/d02fa3396a9eff50f834c674242087b858095775.png)
. Let the 
be the vertex of the square 
on side 
. Then 
. Let the sides of the square intersect 
at 
and 
, with 
. Then 
so 
. Let 
be the vertex of the square across from 
. Then 
. Thus the perimeter of the diamond is
![\[4(4048-2024 \sqrt{2})-2 \cdot 2024 (3-2\sqrt{2})+2024 (3 \sqrt{2} -4)=2024 (8-4 \sqrt{2}-6+4\sqrt{2}+3\sqrt{2}-4)=2024(3\sqrt{2}-2)=7072\sqrt{2}-4048\]](http://latex.artofproblemsolving.com/b/c/8/bc8e18a5b46de191c8436a2d6d363517962ce15f.png)
. 
![\[x \equiv 2^4 \cdot 3^4 \cdot 7^4+2^7 \cdot 3^7 \cdot 5^6 \pmod{7!}\]](http://latex.artofproblemsolving.com/2/a/4/2a4c33ddcd46bcf5c89a3e3115bc73c2c9c5d3d5.png)
is divided by 1000.
