Skip to main content
Mathematics LibreTexts

5.11.1.5E: An Application to Polynomials Exercises

  • Page ID
    134822
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\dsum}{\displaystyle\sum\limits} \)

    \( \newcommand{\dint}{\displaystyle\int\limits} \)

    \( \newcommand{\dlim}{\displaystyle\lim\limits} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \(\newcommand{\longvect}{\overrightarrow}\)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)
    Exercise \(\PageIndex{1}\)

    If polynomials \(f(x)\) and \(g(x)\) satisfy \(f(a) = g(a)\), show that \(f(x) - g(x) = (x - a)h(x)\) for some polynomial \(h(x)\).

    Exercises 6.5.2, 6.5.3, 6.5.4, and 6.5.5 require polynomial differentiation.

    Exercise \(\PageIndex{2}\)

    Expand each of the following as a polynomial in powers of \(x - 1\).

    1. \(f(x) = x^{3} - 2x^{2} + x - 1\)
    2. \(f(x) = x^{3} + x + 1\)
    3. \(f(x) = x^{4}\)
    4. \(f(x) = x^{3} - 3x^{2} + 3x\)
    Answer
    1. \(3 + 4(x - 1) + 3(x - 1)^{2} + (x - 1)^{3}\)
    2. \(1 + (x - 1)^{3}\)
    Exercise \(\PageIndex{3}\)

    Prove Taylor’s theorem for polynomials.

    Exercise \(\PageIndex{4}\)

    Use Taylor’s theorem to derive the binomial theorem:

    \[(1 + x)^n = \binom{n}{0} + \binom{n}{1} x + \binom{n}{2} x^2 + \dots + \binom{n}{n} x^n \nonumber \]

    Here the binomial coefficients \(\binom{n}{r}\) are defined by

    \[\binom{n}{r} = \frac{n!}{r!(n - r)!} \nonumber \]

    where \(n! = n(n - 1) \cdots 2 \cdot 1\) if \(n \geq 1\) and \(0! = 1\).

    Exercise \(\PageIndex{5}\)

    Let \(f(x)\) be a polynomial of degree \(n\). Show that, given any polynomial \(g(x)\) in \(\mathbf{P}_{n}\), there exist numbers \(b_{0}, b_{1}, \dots, b_{n}\) such that

    \[g(x) = b_0f(x) + b_1f^{(1)}(x) + \dots + b_nf^{(n)}(x) \nonumber \]

    where \(f^{(k)}(x)\) denotes the \(k\)th derivative of \(f(x)\).

    Exercise \(\PageIndex{6}\)

    Use Theorem 6.5.2 to show that the following are bases of \(\mathbf{P}_{2}\).

    1. \(\{x^{2} - 2x, x^{2} + 2x, x^{2} - 4\}\)
    2. \(\{x^{2} - 3x + 2, x^{2} - 4x + 3, x^{2} - 5x + 6\}\)
    Answer
    1. The polynomials are \((x - 1)(x - 2)\), \((x - 1)(x - 3)\), \((x - 2)(x - 3)\). Use \(a_{0} = 3\), \(a_{1} = 2\), and \(a_{2} = 1\).
    Exercise \(\PageIndex{7}\)

    Find the Lagrange interpolation expansion of \(f(x)\) relative to \(a_{0} = 1\), \(a_{1} = 2\), and \(a_{2} = 3\) if:

    \(f(x) = x^{2} + 1\) \(f(x) = x^{2} + x + 1\)

    Answer

    \(f(x) = \frac{3}{2}(x - 2)(x - 3) - 7(x - 1)(x - 3) + \frac{13}{2}(x - 1)(x - 2)\).

    Exercise \(\PageIndex{8}\)

    Let \(a_{0}, a_{1}, \dots, a_{n}\) be distinct numbers. If \(f(x)\) and \(g(x)\) in \(\mathbf{P}_{n}\) satisfy \(f(a_{i}) = g(a_{i})\) for all \(i\), show that \(f(x) = g(x)\). [Hint: See Theorem 6.5.4.]

    Exercise \(\PageIndex{9}\)

    Let \(a_{0}, a_{1}, \dots, a_{n}\) be distinct numbers. If \(f(x) \in\|{P}_{n+1}\) satisfies \(f(a_{i}) = 0\) for each \(i = 0, 1, \dots, n\), show that \(f(x) = r(x - a_{0})(x - a_{1}) \cdots (x - a_{n})\) for some \(r\) in \(\mathbb{R}\). [Hint: \(r\) is the coefficient of \(x^{n+1}\) in \(f(x)\). Consider \(f(x) - r(x - a_{0}) \cdots (x - a_{n})\) and use Theorem 6.5.4.]

    Exercise \(\PageIndex{10}\)

    Let \(a\) and \(b\) denote distinct numbers.

    1. Show that \(\{(x - a), (x - b)\}\) is a basis of \(\mathbf{P}_{1}\).
    2. Show that \(\{(x - a)^{2}, (x - a)(x - b), (x - b)^{2}\}\) is a basis of \(\mathbf{P}_{2}\).
    3. Show that \(\{(x - a)^{n}, (x - a)^{n-1}(x - b), \\ \dots, (x - a)(x - b)^{n-1}, (x - b)^{n}\}\) is a basis of \(\mathbf{P}_{n}\). [Hint: If a linear combination vanishes, evaluate at \(x = a\) and \(x = b\). Then reduce to the case \(n - 2\) by using the fact that if \(p(x)q(x) = 0\) in \(\mathbf{P}\), then either \(p(x) = 0\) or \(q(x) = 0\).]
    Answer
    1. If \(r(x - a)^{2} + s(x - a)(x - b) + t(x - b)^{2} = 0\), then evaluation at \(x = a (x = b)\) gives \(t = 0 (r = 0)\). Thus \(s(x - a)(x - b) = 0\), so \(s = 0\). Use Theorem 6.4.4.
    Exercise \(\PageIndex{11}\)

    Let \(a\) and \(b\) be two distinct numbers. Assume that \(n \geq 2\) and let

    \[U_n = \{f(x) \mbox{ in }\|{P}_n \mid f(a) = 0 = f(b) \}. \nonumber \]

    1. Show that \[U_n = \{(x - a)(x - b)p(x) \mid p(x) \mbox{ in }\|{P}_{n - 2} \} \nonumber \]
    2. [Hint: If \(p(x)q(x) = 0\) in \(\mathbf{P}\), then either \(p(x) = 0\), or \(q(x) = 0\).]
    3. Show \(\{(x - a)^{n-1}(x - b), (x - a)^{n-2}(x - b)^{2}, \\ \dots, (x - a)^{2}(x - b)^{n-2}, (x - a)(x - b)^{n-1}\}\) is a basis of \(U_{n}\). [Hint: Exercise 6.5.10.]
    Answer
    1. Suppose \(\{p_{0}(x), p_{1}(x), \dots, p_{n-2}(x)\}\) is a basis of \(\mathbf{P}_{n-2}\). We show that \(\{(x - a)(x - b)p_{0}(x), (x - a)(x - b)p_{1}(x), \dots, (x - a)(x - b)p_{n-2}(x)\}\) is a basis of \(U_{n}\). It is a spanning set by part (a), so assume that a linear combination vanishes with coefficients \(r_{0}, r_{1}, \dots, r_{n-2}\). Then \((x - a)(x - b)[r_{0}p_{0}(x) + \dots + r_{n-2}p_{n-2}(x)] = 0\), so \(r_{0}p_{0}(x) + \dots + r_{n-2}p_{n-2}(x) = 0\) by the Hint. This implies that \(r_{0} = \dots = r_{n-2} = 0\).

    5.11.1.5E: An Application to Polynomials Exercises is shared under a not declared license and was authored, remixed, and/or curated by LibreTexts.

    • Was this article helpful?