11,297 views
30 votes
30 votes

Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is:

  1. 3
  2. 4
  3. 6
  4. 9

3 Answers

Best answer
29 votes
29 votes
We can use just horner's method, according to which, we can write p(x) as :

        $$p(x) = a_0 + x(a_1 + x(a_2 + a_3x))$$

        As we can see, here we need only three multiplications, so option (A) is correct.
selected by
5 votes
5 votes

Answer will be 3

mul= pair of brackets

p(x)=a0+x(a1+x(a2+a3(x)))

edited by
Answer:

Related questions

3 votes
3 votes
2 answers
3
go_editor asked Jun 15, 2016
1,852 views
The formula $P_k = y_0 + k \triangledown y_0+ \frac{k(k+1)}{2} \triangledown ^2 y_0 + \dots + \frac{k \dots (k+n-1)}{n!} \triangledown ^n y_0$ isNewton's backward formula...
3 votes
3 votes
1 answer
4