By Horner's Rule

The Gateway to Computer Science Excellence

+27 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:

- 3
- 4
- 6
- 9

52,223 questions

59,818 answers

201,021 comments

118,091 users