Find the number of quadratic polynomials ax² + bx + c such that:
a) a, b, c are distinct.
b) a, b, c ε {1, 2, 3, …2008}
c) x + 1 divides ax² + bx + c
Reasoning->b=a+c b ranges from 3 to 2008 x1+x2=n has n-1C1 solns. Using th elogic we get 2+3+..2007 solutions. A total of 2015027 solutions.here,condition 1 comes into picture telling us that a,b,c are distinct. Therefore the even values of b ie.4,6,8,..2008 will have one solution less ie.from the given solution subtract 1003 thus giving us 20104024
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
|||||||
|
|
Ross's answer was my first thought, but as a slightly-different alternative, use the remainder theorem:
So if $x+1=x-(-1)$ divides $P(x)=ax^2+bx+c$ (leaving remainder $0$), $P(-1)=0$, which should give the same condition on $a$, $b$, and $c$ that would result from long division. |
|||||||||||||||
|
|
Hint: try polynomial long division to find a condition on $a,b,c$. Then it is a combinatoric question how many sets of that kind there are. |
|||||||
|
|
Your question and answers to your question can be found here. For the answer see: abhitsian's Comment in this link: |
|||||||
|