2020 AIME I真题及答案
In with point lies strictly between and on side and point lies strictly between and on side such that The degree measure of is where and are relatively prime positive integers. Find
There is a unique positive real number such that the three numbers , , and , in that order, form a geometric progression with positive common ratio. The number can be written as , where and are relatively prime positive integers. Find .
A positive integer has base-eleven representation and base-eight representation where and represent (not necessarily distinct) digits. Find the least such expressed in base ten.
Let be the set of positive integers with the property that the last four digits of are and when the last four digits are removed, the result is a divisor of For example, is in because is a divisor of Find the sum of all the digits of all the numbers in For example, the number contributes to this total.
Six cards numbered through are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order.
A flat board has a circular hole with radius and a circular hole with radius such that the distance between the centers of the two holes is Two spheres with equal radii sit in the two holes such that the spheres are tangent to each other. The square of the radius of the spheres is where and are relatively prime positive integers. Find
A club consisting of men and women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as member or as many as members. Let be the number of such committees that can be formed. Find the sum of the prime numbers that divide
A bug walks all day and sleeps all night. On the first day, it starts at point faces east, and walks a distance of units due east. Each night the bug rotates counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point Then where and are relatively prime positive integers. Find
Let be the set of positive integer divisors of Three numbers are chosen independently and at random with replacement from the set and labeled and in the order they are chosen. The probability that both divides and divides is where and are relatively prime positive integers. Find
Let and be positive integers satisfying the conditions
is a multiple of and
is not a multiple of
Find the least possible value of
For integers and let and Find the number of ordered triples of integers with absolute values not exceeding for which there is an integer such that
Let be the least positive integer for which is divisible by Find the number of positive integer divisors of
Point lies on side of so that bisects The perpendicular bisector of intersects the bisectors of and in points and respectively. Given that and the area of can be written as where and are relatively prime positive integers, and is a positive integer not divisible by the square of any prime. Find
Let be a quadratic polynomial with complex coefficients whose coefficient is Suppose the equation has four distinct solutions, Find the sum of all possible values of
Let be an acute triangle with circumcircle and let be the intersection of the altitudes of Suppose the tangent to the circumcircle of at intersects at points and with and The area of can be written as where and are positive integers, and is not divisible by the square of any prime. Find
- Solution 1
If we set to , we can find all other angles through these two properties: 1. Angles in a triangle sum to . 2. The base angles of an isosceles triangle are congruent.
Now we angle chase. , , , , , . Since as given by the problem, , so . Therefore, , and our desired angle isfor an answer of .
Let be in degrees. . By Exterior Angle Theorem on triangle , . By Exterior Angle Theorem on triangle , . This tells us and . Thus and we want to get an answer of .
Solution 3 (Official MAA)
Let . Because is isosceles, . ThenBecause and are also isosceles,Because is isosceles, is also , so , and it follows that . The requested sum is .
Since these form a geometric series, is the common ratio. Rewriting this, we get by base change formula. Therefore, the common ratio is 2. Now
. Therefore, .
If we set , we can obtain three terms of a geometric sequence through logarithm properties. The three terms areIn a three-term geometric sequence, the middle term squared is equal to the product of the other two terms, so we obtain the following:which can be solved to reveal . Therefore, , so our answer is .
Let be the common ratio. We haveHence we obtainIdeally we change everything to base and we can get:Now divide to get:By change-of-base we obtain:Hence and we have as desired.
Solution 4 (Exponents > Logarithms)
Let be the common ratio, and let be the starting term (). We then have:Rearranging these equations gives:Deal with the last two equations first: Setting them equal gives:Using LTE results in:Using this value of , substitute into the first and second equations (or the first and third, it doesn't really matter) to get:Changing these to a common base gives:Dividing the first equation by 2 on both sides yields:Setting these equations equal to each other and applying LTE again gives:Substituting this back into the first equation gives:Therefore,
We can relate the logarithms as follows:
Now we can convert all logarithm bases to using the identity :
We can solve for as follows:
We get . Verifying that the common ratio is positive, we find the answer of .
If the numbers are in a geometric sequence, the middle term must be the geometric mean of the surrounding terms. We can rewrite the first two logarithmic expressions as and , respectively. Therefore:Let . We can rewrite the expression as:Zero does not work in this case, so we consider : . Therefore, .
Solution 7 (Official MAA)
By the Change of Base Formula the common ratio of the progression isHence must satisfyThis is equivalent to . Hence and . The requested sum is .
From the given information, . Since , , and have to be positive, . Since we need to minimize the value of , we want to minimize , so we have . Then we know , and we can see the only solution is , . Finally, , so our answer is .
Solution 2 (Official MAA)
The conditions of the problem imply that , so . The maximum digit in base eight is and because , it must be that is or When , it follows that , which implies that . Then must be or If , then is not an integer, and if , then , so . Thus , and . The number also satisfies the conditions of the problem, but is the least such number.
We note that any number in can be expressed as for some integer . The problem requires that divides this number, and since we know divides , we need that divides 2020. Each number contributes the sum of the digits of , as well as . Since can be prime factorized as , it has factors. So if we sum all the digits of all possible values, and add , we obtain the answer.
Now we list out all factors of , or all possible values of . . If we add up these digits, we get , for a final answer of .
Solution 2 (Official MAA)
Suppose that has the required property. Then there are positive integers and such that . Thus , which holds exactly when is a positive divisor of The number has divisors: , and The requested sum is therefore the sum of the digits in these divisors plus times the sum of the digits in which is
Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two.
If we choose any of the numbers through , there are five other spots to put them, so we get . However, we overcount some cases. Take the example of . We overcount this case because we can remove the or the . Therefore, any cases with two adjacent numbers swapped is overcounted, so we subtract cases (namely, ,) to get , but we have to add back one more for the original case, . Therefore, there are cases. Multiplying by gives the desired answer, .
Solution 2 (Inspired by 2018 CMIMC combo round)
Similar to above, a correspondence between ascending and descending is established by subtracting each number from .
We note that the given condition is equivalent to "cycling" for a contiguous subset of it. For example,
It's not hard to see that no overcount is possible, and that the cycle is either "right" or "left." Therefore, we consider how many elements we flip by. If we flip or such elements, then there is one way to cycle them. Otherwise, we have ways. Therefore, the total number of ascending is , and multiplying by two gives ~awang11
Similarly to above, we find the number of ascending arrangements and multiply by 2.
We can choose cards to be the ascending cards, therefore leaving places to place the remaining card. There are to do this. However, since the problem is asking for the number of arrangements, we overcount cases such as . Notice that the only arrangements that overcount are (case 1) or if two adjacent numbers of are switched (case 2).
This arrangement is counted times. Each time it is counted for any of the numbers selected. Therefore we need to subtract cases of overcounting.
Each time adjacent numbers of switched, there is one overcount. For example, if we have , both or could be removed. Since there are possible switches, we need to subtract cases of overcounting.
Therefore, we have total arrangements of ascending numbers. We multiply by two (for descending) to get the answer of -PCChess
Solution 4 (No overcounting)
Like in previous solutions, we will count the number of ascending arrangements and multiply by 2.
First, consider the arrangement 1-2-3-4-5-6. That gives us 1 arrangement which works.
Next, we can switch two adjacent cards. There are 5 ways to pick two adjacent cards, so this gives us 5 arrangements.
Now, we can "cycle" 3 adjacent cards. For example, 1-2-3 becomes 2-3-1 which becomes 3-1-2. There are 4 ways to pick a set of 3 adjacent cards, so this gives us 4x2=8 arrangements.
Cycling 4 adjacent cards, we get the new arrangements 2-3-4-1 (which works,) 3-4-1-2 (which doesn't work,) and 4-1-2-3 (which does work.) We get 6 arrangements.
Similarly, when cycling 5 cards, we find 2x2=4 arrangements, and when cycling 6 cards, we find 2x1=2 arrangements.
Adding, we figure out that there are 1+5+8+6+4+2=26 ascending arrangements. Multiplying by 2, we get the answer -i8Pie
Solution 5 (Official MAA 1)
First count the number of permutations of the cards such that if one card is removed, the remaining cards will be in ascending order. There is such permutation where all the cards appear in order: There are such permutations where two adjacent cards are interchanged, as in The other such permutations arise from removing one card from and placing it in a position at least two away from its starting location. There are such positions to place each of the cards numbered and and such positions for each of the cards numbered and This accounts for permutations. Thus there are permutations where one card can be removed so that the remaining cards are in ascending order. There is an equal number of permutations that result in the cards' being in descending order. This gives the total .
Solution 6 (Official MAA 2)
More generally, suppose there are cards numbered arranged in ascending order. If any one of the cards is removed and placed in one of the positions in the arrangement, the resulting permutation will have the property that one card can be removed so that the remaining cards are in ascending order. This accounts for permutations. However, the original ascending order has been counted times, and each order that arises by switching two neighboring cards has been counted twice. Hence the number of arrangements where one card can be removed resulting in the remaining cards' being in ascending order is When , this is , and the final answer is .
Solution 7 (Simple and Easy, don't know why it's hard)
For ascending you can place the in locations and the rest of the numbers in locations based on the sequence . . Multiply by to account for the descending and get . ~Lopkiloinm
Set the common radius to . First, take the cross section of the sphere sitting in the hole of radius 1. If we draw the perpendicular bisector of the chord (the hole) through the circle, this line goes through the center. Connect the center also to where the chord hits the circle, for a right triangle with hypotenuse and base . Therefore, the height of this circle outside of the hole is .
The other circle follows similarly for a height (outside the hole) of . Now, if we take the cross section of the entire board, essentially making it 2-D, we can connect the centers of the two spheres, then form another right triangle with base , as given by the problem. The height of this triangle is the difference between the heights of the parts of the two spheres outside the holes, which is . Now we can set up an equation in terms of with the Pythagorean theorem:Simplifying a few times,Therefore, our answer is .
Solution 2 (Official MAA)
Consider a cross section of the board and spheres with a plane that passes through the centers of the holes and centers of the spheres as shown.
Let , , and be, respectively, the center of the hole with radius the center of the sphere resting in that hole, and a point on the edge of that hole. Let , , and be the corresponding points for the hole with radius Let be the point on such that . Let the radius of the spheres be . Because and , it follows thatBecause , , and , it follows thatwhich simplifies to . The requested sum is . The value of is approximately
Let be the number of women selected. Then, the number of men not selected is . Note that the sum of the number of women selected and the number of men not selected is constant at . Each combination of women selected and men not selected corresponds to a committee selection. Since choosing 12 individuals from the total of 23 would give women and men, the number of committee selections is . The answer is . ~awang11's sol
Solution 2 (Bash)
We casework on the amount of men on the committee.
If there are no men in the committee, there are ways to pick the women on the committee, for a total of . Notice that is equal to , so the case where no men are picked can be grouped with the case where all men are picked. When all men are picked, all females must also be picked, for a total of . Therefore, these cases can be combined toSince , and , we can further simplify this to
All other cases proceed similarly. For example, the case with one men or ten men is equal to . Now, if we factor out a , then all cases except the first two have a factor of , so we can factor this out too to make our computation slightly easier. The first two cases (with factored out) give , and the rest gives . Adding the gives . Now, we can test for prime factors. We know there is a factor of , and the rest is . We can also factor out a , for , and the rest is . Adding up all the prime factors gives .
Solution 3 (Vandermonde's identity)
Applying Vandermonde's identity by setting , , and , we obtain . ~Lcz
Consider the following setup:The dots to the left represent the men, and the dots to the right represent the women. Now, suppose we put a mark on people (the ). Those to the left of the dashed line get to be "in" on the committee if they have a mark. Those on the right side of the dashed line are already on the committee, but if they're marked they get forcibly evicted from it. If there were people marked on the left, there ends up being people not marked on the right. Circles represent those in the committee.
We have our bijection, so the number of ways will be .
Notice that the committee can consist of boys and girls. Summing over all possible givesUsing the identity , and Pascal's Identity , we getUsing the identity , this simplifies toso the desired answer is ~ktong
Solution 5 (Official MAA)
Select any club members. That group will have men and women, so the number of women in the club not selected in that group is . Thus, if the committee includes the men who were selected and the women who were not selected, the committee would have the correct number of men and women. Conversely, for every committee that could be formed with men and women, the men on this committee together with the women not on the committee comprise a subset of club members. ThusThe requested sum is
Solution 1 (Coordinates)
We plot this on the coordinate grid with point as the origin. We will keep a tally of the x-coordinate and y-coordinate separately.
First move: The ant moves right . Second move: We use properties of a triangle to get right, up. Third move: left, up. Fourth move: left. Fifth move: left, down. Sixth move: right, down.
Total of x-coordinate: . Total of y-coordinate: .
After this cycle of six moves, all moves repeat with a factor of . Using the formula for a geometric series, multiplying each sequence by will give us the point .
, . Therefore, the coordinates of point are , so using the Pythagorean Theorem, , for an answer of .
Solution 2 (Complex)
We place the ant at the origin of the complex plane with its first move being in the positive real direction. Then the ant's journey can be represented as the infinite seriesUsing the formula for an infinite geometric series, this is equal toWe are looking for the square of the modulus of this value:so the answer is .
Solution 3 (Solution 1 faster)
The ant goes in the opposite direction every moves, going the distance backwards. Using geometric series, he travels the distance of the first three moves over infinity moves. Now, we use coordinates meaning or . Multiplying these by , we get .
Solution 4 (Official MAA 1)
Suppose that the bug starts at the origin and travels a distance of units due east on the first day, and that there is a real number with such that each day after the first, the bug walks times as far as the previous day. On day , the bug travels along the vector that has magnitude and direction . Then is the terminal point of the infinite sum of the vectors . The -coordinate of this sum isBecause the angles repeat after 6 terms, this sum is equal towhereSimilarly, the -coordinate of will be , whereIn this case and , soand the coordinates of areThus the square of the distance from the origin to is . The requested sum is .
Solution 5 (Official MAA 2)
Let point be the origin in the complex plane. Point is the complex sum , where . The distance squared is
First, prime factorize as . Denote as , as , and as .
In order for to divide , and for to divide , , and . We will consider each case separately. Note that the total amount of possibilities is , as there are choices for each factor.
We notice that if we add to and to , then we can reach the stronger inequality . Therefore, if we pick integers from to , they will correspond to a unique solution, forming a 1-1 correspondence between the numbers , , and . This is also equivalent to applying stars and bars on distributing the powers of 2 and 5 through differences. The amount of solutions to this inequality is .
The case for ,, and proceeds similarly for a result of . Therefore, the probability of choosing three such factors isSimplification gives , and therefore the answer is .
Same as before, say the factors have powers of and . can either be all distinct, all equal, or two of the three are equal. As well, we must have . If they are all distinct, the number of cases is simply . If they are all equal, there are only cases for the general value. If we have a pair equal, then we have . We need to multiply by because if we have two values , we can have either or .
Likewise for , we get
The final probability is simply . Simplification gives , and therefore the answer is .
Similar to before, we calculate that there are ways to choose factors with replacement. Then, we figure out the number of triplets and , where , , and represent powers of and , , and represent powers of , such that the triplets are in non-descending order. The maximum power of is , and the maximum power of is . Using the Hockey Stick identity, we figure out that there are ways to choose , and , and ways to choose , , and . Therefore, the probability of choosing factors which satisfy the conditions isThis simplifies to , therefore .
Taking inspiration from we are inspired to take to be , the lowest prime not dividing , or . Now, there are factors of , so , and then for . Now, . Noting is the minimal that satisfies this, we get . Thus, it is easy to verify this is minimal and we get . ~awang11
Assume for the sake of contradiction that is a multiple of a single digit prime number, then must also be a multiple of that single digit prime number to accommodate for . However that means that is divisible by that single digit prime number, which violates , so contradiction.
is also not 1 because then would be a multiple of it.
Thus, is a multiple of 11 and/or 13 and/or 17 and/or...
Assume for the sake of contradiction that has at most 1 power of 11, at most 1 power of 13...and so on... Then, for to be satisfied, must contain at least the same prime factors that has. This tells us that for the primes where has one power of, also has at least one power, and since this holds true for all the primes of , . Contradiction.
Thus needs more than one power of some prime. The obvious smallest possible value of now is . Since , we need to be a multiple of 11 at least that is not divisible by and most importantly, . is divisible by , out. is divisible by 2, out. is divisible by 5, out. is divisible by 2, out. and satisfies all the conditions in the given problem, and the next case will give us at least , so we get .
Solution 1 (Strategic Casework)
Either or not. If it is, note that Vieta's forces . Then, can be anything. However, can also be anything, as we can set the root of (not equal to ) to any integer, producing a possible integer value of . Therefore there are in this case*. If it isn't, then are the roots of . This means by Vieta's, that:
Solving these inequalities while considering that to prevent , we obtain possible tuples and adding gives . ~awang11
Solution 2 (Bash)
Define . Since , we know . Plugging in into , we get . Setting ,. Simplifying and cancelling terms,
Therefore, either or . The first case is easy: and there are tuples in that case. In the second case, we simply perform casework on even values of , to get tuples, subtracting the tuples in both cases we get .
Notes For *
In case anyone is confused by this (as I initially was). In the case where , this does not mean that g has a double root of , ONLY that is one of the roots of g. So basically since in this case, , and we have choices for b and we still can ensure c is an integer with absolute value less than or equal to 10 simply by having another integer root of g that when added to ensures this, and of course an integer multiplied by an integer is an integer so will still be an integer. In other words, you have can have and be any integer with absolute value less than or equal to 10 with still being an integer. Now refer back to the 1st solution. ~First
Lifting the Exponent shows thatso thus, divides . It also shows thatso thus, divides .
Now, multiplying by , we seeand since and then meaning that we have that by LTE, divides .
Since , and all divide , the smallest value of working is their LCM, also . Thus the number of divisors is .
Solution 2 (Simpler, just basic mods and Fermat's theorem)
Note that for all , is divisible by because that is a factor. That is , so now we can clearly see that the smallest to make the expression divisible by is just . Similarly, we can reason that the smallest to make the expression divisible by is just .
Finally, for , take and of each quantity (They happen to both be and respectively, so you only need to compute once). One knows from Fermat's theorem that the maximum possible minimum for divisibility by is , and other values are factors of . Testing all of them(just ,, using mods-not too bad), is indeed the smallest value to make the expression divisible by , and this clearly is NOT divisible by . Therefore, the smallest to make this expression divisible by is .
Calculating the LCM of all these, one gets . Using the factor counting formula, the answer is = .
~Solution by thanosaops
~formatted by MY-2
~also formatted by pandyhu2001
Solution 3 (Elementary and Thorough)
As usual, denote the highest power of prime that divides . For divisibility by , notice that as , and upon checking mods, is divisible by but not . In addition, is divisible by because , and the rightmost factor equates to . In fact, is the least possible choice to ensure divisibility by because if , with and , we writeThen, the rightmost factor is equivalent to , and .
For divisibility by , we'll induct, claiming that for whole numbers . The base case is clear. Then,By the induction hypothesis, . Then, notice thatThis tells us that is divisible by , but not so that , completing our induction. We can verify that is the least choice of to ensure divisibility by by arguing similarly to the case.
Finally, for , we take the powers of and in mod and mod . Writing out these mods, we have that if and only if , in which . So here we claim that and perform yet another induction. The base case is true: , but . Now then, assuming the induction statement to hold for some ,Note that equates to in both mod and mod . We notice that . Writing out the powers of mod , we have . Also when is a multiple of . Hence for , . Thus, , completing our induction. Applying the same argument from the previous two cases, is the least choice to ensure divisibility by .
Our answer is the number of divisors of . It is .
Points are defined as shown. It is pretty easy to show that by spiral similarity at by some short angle chasing. Now, note that is the altitude of , as the altitude of . We need to compare these altitudes in order to compare their areas. Note that Stewart's theorem implies that , the altitude of . Similarly, the altitude of is the altitude of , or . However, it's not too hard to see that , and therefore . From here, we get that the area of is , by similarity. ~awang11
Solution 2(coord bash + basic geometry)
Let lie on the x-axis and be the origin. is . Use Heron's formula to compute the area of triangle . We have . and . We now find the altitude, which is , which is the y-coordinate of . We now find the x-coordinate of , which satisfies , which gives since the triangle is acute. Now using the Angle Bisector Theorem, we have and to get . The coordinates of D are . Since we want the area of triangle , we will find equations for perpendicular bisector of AD, and the other two angle bisectors. The perpendicular bisector is not too challenging: the midpoint of AD is and the slope of AD is . The slope of the perpendicular bisector is . The equation is(in point slope form) . The slope of AB, or in trig words, the tangent of is . Finding and . Plugging this in to half angle tangent, it gives as the slope of the angle bisector, since it passes through , the equation is . Similarly, the equation for the angle bisector of will be . For use the B-angle bisector and the perpendicular bisector of AD equations to intersect at . For use the C-angle bisector and the perpendicular bisector of AD equations to intersect at . The area of AEF is equal to since AD is the altitude of that triangle with EF as the base, with being the height. and , so which gives . NEVER overlook coordinate bash in combination with beginner synthetic techniques.~vvluo
Solution 3 (Coordinate Bash + Trig)
Let and be the line . We compute that , so . Thus, lies on the line . The length of at a point is , so .
We now have the coordinates , and . We also have by the angle-bisector theorem and by taking the midpoint. We have that because , by half angle formula.
We also compute , so .
Now, has slope , so it's perpendicular bisector has slope and goes through .
We find that this line has equation .
As , we have that line has form . Solving for the intersection point of these two lines, we get and thus
We also have that because , has form .
Intersecting the line and the perpendicular bisector of yields .
Solving this, we get and so .
We now compute . We also have .
As , we have .
The desired answer is ~Imayormaynotknowcalculus
Solution 4 (Barycentric Coordinates)
As usual, we will use homogenized barycentric coordinates.
We have that will have form . Similarly, has form and has form . Since and , we also have . It remains to determine the equation of the line formed by the perpendicular bisector of .
This can be found using EFFT. Let a point on have coordinates . We then have that the displacement vector and that the displacement vector has form . Now, by EFFT, we have . This equates to .
Now, intersecting this with , we have , , and . This yields , , and , or .
Similarly, intersecting this with , we have , , and . Solving this, we obtain , , and , or .
We finish by invoking the Barycentric Distance Formula twice; our first displacement vector being . We then have , thus .
Our second displacement vector is . As a result, , so .
As , the desired area is . ~Imayormaynotknowcalculus
Remark: The area of can also be computed using the Barycentric Area Formula, although it may increase the risk of computational errors; there are also many different ways to proceed once the coordinates are determined.
Solution 5 (geometry+trig)
To get the area of , we try to find and .
Since is the angle bisector, we can get that and . By applying Stewart's Theorem, we can get that . Therefore .
Since is the perpendicular bisector of , we know that . Since is the angle bisector of , we know that . By applying the Law of Sines to and , we know that . Since is not equal to and therefore these two triangles are not congruent, we know that and are supplementary. Then we know that and are also supplementary. Given that , we can get that is half of . Similarly, we have is half of .
By applying the Law of Cosines, we get , and then . Similarly, we can get and . Based on some trig identities, we can compute that , and .
Finally, the area of equals . Therefore, the final answer is . ~xamydad
Remark: I didn't figure out how to add segments , , and . Can someone please help add these segments?
(Added 🙂 ~Math_Genius_164)
First and foremost as is the perpendicular bisector of . Now note that quadrilateral is cyclic, because and . Similarly quadrilateral is cyclic,Let ,, be the ,, and excenters of respectively. Then it follows that . By angle bisector theorem we have . Now let the feet of the perpendiculars from and to be and resptively. Then by tangents we haveFrom the previous ratios, Similarly we can find that and and thus-tkhalid
Either or not. We first see that if it's easy to obtain by Vieta's that . Now, take and WLOG . Now, consider the parabola formed by the graph of . It has vertex . Now, say that . We note . Now, we note by plugging in again. Now, it's easy to find that , yielding a value of . Finally, we add . ~awang11, charmander3333
Remark: We know that from .
Let the roots of be and , then we can write . The fact that has solutions implies that some combination of of these are the solution to , and the other are the solution to . It's fairly easy to see there are only possible such groupings: and , or and (Note that are interchangeable, and so are and ). We now casework: If , thenso this gives . Next, if , thenSubtracting the first part of the first equation from the first part of the second equation givesHence, , and so . Therefore, the solution is ~ktong
Write . Split the problem into two cases: and .
Case 1: We have . We must haveRearrange and divide through by to obtainNow, note thatNow, rearrange to getand thusSubstituting this into our equation for yields . Then, it is clear that does not have a double root at , so we must have and or vice versa. This gives and or vice versa, implying that and .
Case 2: We have . Then, we must have . It is clear that (we would otherwise get implying or vice versa), so and .
Thus, our final answer is . ~GeronimoStilton
Let . There are two cases: in the first case, equals (without loss of generality), and thus . By Vieta's formulas .
In the second case, say without loss of generality and . Subtracting gives , so . From this, we have .
Note , so by Vieta's, we have . In this case, .
The requested sum is .~TheUltimate123
The following is a power of a point solution to this menace of a problem:
Let points be what they appear as in the diagram below. Note that is not insignificant; from here, we set by PoP and trivial construction. Now, is the reflection of over . Note , and therefore by Pythagorean theorem we have . Consider . We have that , and therefore we are ready to PoP with respect to . Setting , we obtain by PoP on , and furthermore, we have . Now, we get , and from we takeHowever, squaring and manipulating with yields that and from here, since we get the area to be . ~awang11's sol
As in the diagram, let ray extended hits BC at L and the circumcircle at say . By power of the point at H, we have . The three values we are given tells us that . L is the midpoint of (see here: https://www.cut-the-knot.org/Curriculum/Geometry/AltitudeAndCircumcircle.shtml ), so .
As in the diagram provided, let K be the intersection of and . By power of a point on the circumcircle of triangle , . By power of a point on the circumcircle of triangle , , thus . Solving gives or .
By the Pythagorean Theorem on triangle , . Now continue with solution 1.
Diagram not to scale.
We first observe that , the image of the reflection of over line , lies on circle . This is because . This is a well known lemma. The result of this observation is that circle , the circumcircle of is the image of circle over line , which in turn implies that and thus is a parallelogram. That is a parallelogram implies that is perpendicular to , and thus divides segment in two equal pieces, and , of length .
Using Power of a Point,This means that and , where is the foot of the altitude from onto . All that remains to be found is the length of segment .
Looking at right triangle , we find thatLooking at right triangle , we get the equationPlugging in known values, and letting be the radius of the circle, we find that
Recall that is a parallelogram, so . So, , where is the midpoint of . This means that
Thus, the area of triangle isThe answer is .