 on the interval
 on the interval ![$ [a, b] $](img2.gif) .  Let
.  Let 
 ...
 ... 
 
 
be an arbitrary (randomly selected) partition of the interval  ![$ [a, b] $](img2.gif) , which divides the interval into
 , which divides the interval into  subintervals (subdivisions).  Let
 subintervals (subdivisions).  Let
 ...
 ... 
 
 
be the sampling numbers (or sampling points) selected from the subintervals. That is,
	 is in
 is in 
![$ [x_{0}, x_{1}] $](img9.gif) ,
, 
	 is in
 is in 
![$ [x_{1}, x_{2}] $](img11.gif) ,
,
	 is in
 is in 
![$ [x_{2}, x_{3}] $](img13.gif) , ... ,
, ... , 
	 is in
 is in 
![$ [x_{n-3}, x_{n-2}] $](img15.gif) ,
,
	 is in
 is in 
![$ [x_{n-2}, x_{n-1}] $](img17.gif) ,
, 
and
	 is in
 is in 
![$ [x_{n-1}, x_{n}] $](img19.gif) .
 .
Define the mesh of the partition to be the length of the largest subinterval. That is, let
	
 
 
for 
 and define
 and define
	
 .
 .
The definite integral of  on the interval
 on the interval ![$ [a, b] $](img2.gif) is most generally defined to be
 is most generally defined to be
	
 .
 .
For convenience of computation, a special case of the above definition uses  subintervals of equal length and sampling points chosen to be the right-hand endpoints of the subintervals.  Thus, each subinterval has length
 subintervals of equal length and sampling points chosen to be the right-hand endpoints of the subintervals.  Thus, each subinterval has length
equation (*)	
 
for 
 and the right-hand endpoint formula is
 and the right-hand endpoint formula is
equation (**)	
 
 
for 
 .  The definite integral of
 .  The definite integral of  on the interval
 on the interval ![$ [a, b] $](img2.gif) can now be alternatively defined by
 can now be alternatively defined by
	
 .
 .
We will need the following well-known summation rules.
 (n times)
 (n times)   , where
 , where  is a constant
 is a constant
     
 
    
 
     
     , where
 , where  is a constant
 is a constant
     
		
Most of the following problems are average.  A few are somewhat challenging. If you are going to try these problems before looking at the solutions, you can avoid common 
mistakes by using the formulas given above in exactly the form that they are given.  Solutions to the first eight problems will use equal-sized subintervals and right-hand endpoints as sampling points as shown in equations (*) and (**) above. 
 .
 .
Click   HERE  to see a detailed solution to problem 1.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 2.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 3.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 4.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 5.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 6.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 7.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 8.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 9.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 10.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 11.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 12.   
   
 .
 .
Click   HERE  to see a detailed solution to problem 13.   
   
 , where
 , where  is a constant.  Use an arbitrary partition
 is a constant.  Use an arbitrary partition 
 and arbitrary sampling numbers
 and arbitrary sampling numbers  for
 for 
 .
 .
Click   HERE  to see a detailed solution to problem 14.   
   
 .  Use an arbitrary partition
 .  Use an arbitrary partition 
 and the sampling number
 and the sampling number 
 for
 for 
 .  Begin by showing that
 .  Begin by showing that 
 
 for
 for 
 .  Assume that
 .  Assume that  .
 .
Click HERE to see a detailed solution to problem 15.
Your comments and suggestions are welcome. Please e-mail any correspondence to Duane Kouba by clicking on the following address :