<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
   "http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head> 
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<title>Sheet6: 620-295 Real Analysis with applications</title>
<style type="text/css">
body {
    counter-reset: section 0;  
    text-align: justify
}

h2.title {
    text-align:center
}
p.author {
    text-align:center
}
li {
    text-indent: 0em;
}
p.indent {
    text-indent: 2em; 
}

h2.section {
    counter-reset: eqn 0 result 0 subsection 0;  
}
h2.section:before {
    content: counter(section) ". ";
    counter-increment: section 1;  /* Add 1 to section */
}
h3.subsection:before {
    content: counter(section) "." counter(subsection);
    counter-increment: subsection;  /* Add 1 to subsection */
}

div.theorem:before { 
    content: "Theorem " counter(section) "." counter(result) " "; 
    counter-increment: result 1;
    font-style: normal; 
    font-weight: bold; 
}
div.theorem{ font-style:italic }
div.proposition:before { 
    content: "Proposition " counter(section) "." counter(result) " "; 
	counter-increment: result 1;
    font-style: normal; 
    font-weight: bold; 
}
div.proposition{ font-style:italic }
div.lemma:before { 
    content: "Lemma " counter(section) "." counter(result) " "; 
    counter-increment: result;
    font-style: normal; 
    font-weight: bold; 
}
div.lemma{ font-style:italic }

table.dispeq {
   width:100%;
   }
td.eq {
   text-align:center;
     }
td.eqno {
    width: 10px;
    text-align:right;
    }
td.eqno:after { 
     content: "("counter(section)"."counter(eqn)")";
     counter-increment: eqn;
     font-style: normal; 
  }
</style>
</head>

<body>
<h2 class="title"> 620-295 Real Analysis with applications <br /><br />
Problem Sheet 6</h2>

<p class="author">
Arun Ram <br />
Department of Mathematics and Statistics <br />
University of Melbourne <br />
Parkville VIC 3010 Australia <br />
aram@unimelb.edu.au <br />
<br />
</p>


<p> Last updates: 16 October 2009 </p>




<h2 class="section"> Trapezoidal and Simpson approximations </h2>

<ol>
<li> Determine the area of a trapezoid with 
left edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi>
</mrow></math>,
right edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi>
</mrow></math>,
left height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>)</mo>
</mrow></math>,
and right height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
</mrow></math>.
</li>
<li> Determine the area of a parabola topped slice with 
left edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi>
</mrow></math>,
right edge at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi>
</mrow></math>,
middle at 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>x</mi><mo>=</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi>
</mrow></math>,
left height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>)</mo>
</mrow></math>,
middle height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
</mrow></math>,
and right height
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>(</mo><mi>l</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
</mrow></math>.
</li>
<li> 
Let
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>N</mi>
</mrow></math>
be a positive integer.  Show that adding up 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>N</mi>
</mrow></math>
trapezoidal slices gives the approximation
to
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup> <mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mi>d</mi><mi>x</mi>
</mrow></math>
given by
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mfrac><mrow><mi>&Delta;</mi><mi>x</mi></mrow><mn>2</mn></mfrac>
	<mrow><mo>(</mo>
	<mi>f</mi><mo>(</mo><mi>a</mi><mo>)</mo>
	  <mo>+</mo>
	<mn>2</mn><mi>f</mi><mo>(</mo><mi>a</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo>
	<mn>2</mn><mi>f</mi><mo>(</mo><mi>a</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo><mi>&ctdot;</mi><mo>+</mo>
	<mn>2</mn><mi>f</mi><mo>(</mo><mi>b</mi><mo>-</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo>
	<mi>f</mi><mo>(</mo><mi>b</mi><mo>)</mo>
	<mo>)</mo></mrow>
</mrow></math>,
where
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>&Delta;</mi><mi>x</mi><mo>=</mo>
	<mfrac><mrow><mi>b</mi><mo>-</mo><mi>a</mi></mrow><mi>N</mi></mfrac>
</mrow></math>.
</li>
<li> 
Let
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>N</mi>
</mrow></math>
be an even positive integer.  Show that adding up 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>N</mi>
</mrow></math>
parabola topped slices gives the approximation
to
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<msubsup><mi>&int;</mi><mi>a</mi><mi>b</mi></msubsup> <mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mi>d</mi><mi>x</mi>
</mrow></math>
given by
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mfrac><mrow><mi>&Delta;</mi><mi>x</mi></mrow><mn>2</mn></mfrac>
	<mrow><mo>(</mo>
	<mi>f</mi><mo>(</mo><mi>a</mi><mo>)</mo>
	  <mo>+</mo>
	<mn>4</mn><mi>f</mi><mo>(</mo><mi>a</mi><mo>+</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo>
	<mn>2</mn><mi>f</mi><mo>(</mo><mi>a</mi><mo>+</mo><mn>2</mn><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo><mi>&ctdot;</mi><mo>+</mo>
	<mn>4</mn><mi>f</mi><mo>(</mo><mi>b</mi><mo>-</mo><mi>&Delta;</mi><mi>x</mi><mo>)</mo>
	  <mo>+</mo>
	<mi>f</mi><mo>(</mo><mi>b</mi><mo>)</mo>
	<mo>)</mo></mrow>
</mrow></math>,
where
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>&Delta;</mi><mi>x</mi><mo>=</mo>
	<mfrac><mrow><mi>b</mi><mo>-</mo><mi>a</mi></mrow><mi>N</mi></mfrac>
</mrow></math>.
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>2</mn></msubsup>
	<mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup>
	<mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>2</mn></msubsup>
	<mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup>
	<mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><mi>x</mi></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><mi>x</mi></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mi>sin</mi><mi>x</mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mi>sin</mi><mi>x</mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup><mo>)</mo></mrow><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup><mo>)</mo></mrow><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>

<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>2</mn></msubsup>
	<mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup>
	<mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>2</mn></msubsup>
	<mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup>
	<mo>)</mo>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><mi>x</mi></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><mi>x</mi></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mi>sin</mi><mi>x</mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mi>sin</mi><mi>x</mi>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup><mo>)</mo></mrow><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup><mo>)</mo></mrow><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math> and obtain a bound for the error.<br /><br />
</li>
<li>  Let 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msub><mi>T</mi><mn>4</mn></msub>
</math> be the trapezoidal approximation 
with
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msup><mi>x</mi><mn>2</mn></msup><mo>)</mo></mrow><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mo>&vert;</mo>
	<mi>f</mi><mi><mi>&prime;</mi><mi>&prime;</mi></mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>&vert;</mo>
	<mo>&le;</mo><mn>2</mn>
</math> for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>x</mi><mo>&isin;</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>]</mo>
</math> and that
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mo>&vert;</mo>
	<msub><mi>T</mi><mn>4</mn></msub><mo>-</mo><mfrac><mn>1</mn><mn>4</mn></mfrac><mi>&pi;</mi>
	<mo>&vert;</mo>
	<mo>&le;</mo><mn>1/96</mn>
	<mo>&lt;</mo><mn>0.0105</mn>
</math>.<br /><br />
</li>
<li> Use the trapezoidal approximation with
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices to approximate the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>log</mi><mi><mn>2</mn></mi>
	<mo>=</mo>
	<msubsup><mi>&int;</mi><mn>1</mn><mn>2</mn></msubsup>
	<msup><mi>x</mi><mn>-1</mn></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mn>0.6866</mn><mo>&le;</mo><mi>log</mi><mi><mn>2</mn></mi><mo>&le;</mo><mn>0.6958</mn>
</math>.
<br /><br />
</li>
<li> Use Simpson's approximation with
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>4</mn>
</math> slices to approximate
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>log</mi><mi><mn>2</mn></mi>
</math>.  Show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mn>0.6927</mn><mo>&le;</mo><mi>log</mi><mi><mn>2</mn></mi><mo>&le;</mo><mn>0.6933</mn>
</math>.
<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><msup><mi>x</mi><mn>2</mn></msup></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>16</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><msup><mi>x</mi><mn>2</mn></msup></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><msup><mi>x</mi><mn>2</mn></msup></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>16</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msubsup><mi>&int;</mi><mn>0</mn><mn>1</mn></msubsup>
	<msup><mi>e</mi><mrow><mo>-</mo><msup><mi>x</mi><mn>2</mn></msup></mrow></msup>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<msubsup><mo>&int;</mo><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mfrac><mrow><mi>sin</mi><mi>x</mi></mrow><mi>x</mi></mfrac>
</mstyle><mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a trapezoidal approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>16</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<msubsup><mo>&int;</mo><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mfrac><mrow><mi>sin</mi><mi>x</mi></mrow><mi>x</mi></mfrac>
</mstyle><mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>8</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<msubsup><mo>&int;</mo><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mfrac><mrow><mi>sin</mi><mi>x</mi></mrow><mi>x</mi></mfrac>
</mstyle><mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li>  Compute a Simpson approximation with 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi><mo>=</mo><mn>16</mn>
</math> slices for the integral
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<msubsup><mo>&int;</mo><mn>0</mn><mrow><mi>&pi;</mi><mo>/</mo><mn>2</mn></mrow></msubsup>
	<mfrac><mrow><mi>sin</mi><mi>x</mi></mrow><mi>x</mi></mfrac>
</mstyle><mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.<br /><br />
</li>
<li> Derive the <em>midpoint approximation</em> for
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<msubsup><mo>&int;</mo><mi>a</mi><mi>b</mi></msubsup>
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
</mstyle><mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
</math>.  With 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi>
</math> slices it is obtained by adding up the areas of rectangles with
height equal to the value of the function at the midpoint of the interval.  
Show that the error estimate is given by 
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mstyle displaystyle="true">
	<mo>&vert;</mo>
<msubsup><mo>&int;</mo><mi>a</mi><mi>b</mi></msubsup>
	<mrow><mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo></mrow>
<mphantom><mi>,</mi></mphantom>
	<mi><mi>d</mi><mi>x</mi></mi>
	<mo>-</mo>
	<msub><mi>M</mi><mi>N</mi></msub>
<mo>&vert;</mo>
	<mo>&le;</mo>
	<mfrac><mrow><msup><mrow><mo>(</mo><mi>b</mi><mo>-</mo><mi>a</mi><mo>)</mo></mrow><mn>3</mn></msup></mrow>
	<mrow><mn>24</mn><msup><mi>n</mi><mn>2</mn></msup></mrow>
	</mfrac>
	<mi>M</mi>
</mstyle>
</math>, where 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>M</mi>
</math> is an upper bound for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mo>&vert;</mo><mi>f</mi><mi><mi>&prime;</mi><mi>&prime;</mi></mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>&vert;</mo>
</math> on
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mo>[</mo><mi>a</mi><mo>,</mo><mi>b</mi><mo>]</mo>
</math>.
<br /><br />
</li>
</ol>



<h2 class="section"> Taylor approximations</h2>

<ol>
<li>Define the following and give an example of each:
<dl>
<dt> (a) &nbsp;
converges pointwise
</dt>
<dt> (b) &nbsp;
converges uniformly
</dt>
</dl>
</li>
<li> Write a quadratic approximation for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
	<msup><mi>x</mi><mn>1/3</mn></msup>
</math>
near 8 and approximate
9<sup>1/3</sup>.  Estimate the error and find the smallest interval that you can be sure contains the 
value.
<br /><br /></li>
<li> Write a quadratic approximation for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
	<msup><mi>x</mi><mn>-1</mn></msup>
</math>
near 1 and approximate
1/1.02.  Estimate the error and find the smallest interval that you can be sure contains the 
value.
<br /><br /></li>
<li> Write a quadratic approximation for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo>
	<mo>=</mo>
	<msup><mi>e</mi><mi>x</mi></msup>
</math>
near 0 and approximate
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msup><mi>e</mi><mn>-0.5</mn></msup>
</math>.  Estimate the error and find the smallest interval that you can be sure contains the 
value.
<br /><br /></li>
<li> 
<dl>
<dt> (a) &nbsp;
From Taylor's theorem write down an expansion for the remainder
when the Taylor polynomial of degree 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi>
</math>
for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msup><mi>e</mi><mi>x</mi></msup>
</math>
(about
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>x</mi><mo>=</mo><mn>0</mn>
</math>)
is subtracted from 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msup><mi>e</mi><mi>x</mi></msup>
</math>.  In what interval does the unknown constant
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>c</mi>
</math> lie, if 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>x</mi><mo>&gt;</mo><mn>0</mn>
</math>?
</dt>
<dt> (b) &nbsp;
Show that the remainder has the bounds, if 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>x</mi><mo>&gt;</mo><mn>0</mn>
</math>,
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mfrac><mrow><msup><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup></mrow>
	<mrow><mo>(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo><mtext>!</mtext></mrow>
	</mfrac>
	<mo>&lt;</mo>
	<msub><mi>R</mi><mi>N</mi></msub>
	<mo>&lt;</mo>
	<msup><mi>e</mi><mi>x</mi></msup>
	<mfrac><mrow><msup><mi>x</mi><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup></mrow>
	<mrow><mo>(</mo><mi>n</mi><mo>+</mo><mn>1</mn><mo>)</mo><mtext>!</mtext></mrow>
	</mfrac>
</math>
and use the sandwich rule to show that 
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msub><mi>R</mi><mi>N</mi></msub>
	<mo>&rarr;</mo><mn>0</mn>
</math> as
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>N</mi>
	<mo>&rarr;</mo><mo>&infin;</mo>
</math>.  This proves that the Taylor series for
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msup><mi>e</mi><mi>x</mi></msup>
</math> does converge to
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<msup><mi>e</mi><mi>x</mi></msup>
</math>, for any
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>x</mi><mo>&gt;</mo><mn>0</mn>
</math>.
</dt>
</dl>
</li>






</ol>

<h2 class="section"> Fourier series</h2>

<ol>
<li> Find the Fourier series for the function 
<math xmlns="http://www.w3.org/1998/Math/MathML"><mrow>
	<mi>f</mi><mo>&colon;</mo><mo>[</mo><mn>0</mn><mo>,</mo><mn>2</mn><mi>&pi;</mi><mo>]</mo>
	<mo>&rarr;</mo><mi>&Ropf;</mi>
</mrow></math> given by
<math xmlns="http://www.w3.org/1998/Math/MathML">
	<mi>f</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><msup><mi>x</mi><mn>2</mn></msup>
</math>.
</li>

</ol>










</body>
</html>
