8/11/2023

Today I continued the math book I was doing, and I did problems 1-9 in Chapter 2 :)

My favorite problem was an AIME problem: 


My Solution: 

Note that, by the Binomial Theorem, x2001+(12x)2001 =x2001+(x2001+(20011)x2000(12)1(20012)x1999(12)2++(20012001)x0(12)2001) The x2001 terms cancel, and we know that this whole expression is 0, so =(20011)x2000(12)1(20012)x1999(12)2++(20012001)x0(12)2001=0 Now, we have to find the sum of roots of this expression. For this, we can use Vieta's formula for the sum of roots: roots=(20012)14(20011)12=500.

Cool solution by the author:

Note that when you plug in x=12r, then you get the same equation as when you plug in x=r
This implies that the solutions to this equation come in pairs: if r is a solution, then 12r is also a solution. Since there are pairs of (r,12r), the sum of all of the roots would be 12 summed up several times. It would be summed for each pair, and since we have a polynomial of degree 2000, there are 20002=1000 pairs. The sum of roots is thus 121000=500.



I think the author's solution was a cool and slick way that was applicable in this problem, but in my opinion, the best way to approach these types of problems with a foolproof approach is the Vieta's formulas.

Comments

Post a Comment