Study guide
6.3 Riemann Sums and the Definite Integral
CLEP Calculus Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Introduction & Exam Overview
1.1 About the CLEP Calculus Exam
2 Chapter 2: Limits and Continuity
2.1 Limit Concepts and Limit Laws 2.2 Algebraic Evaluation of Limits & Indeterminate Forms 2.3 Limits Involving Infinity and Asymptotes 2.4 Continuity and the Intermediate Value Theorem
3 Chapter 3: Foundations of Derivatives
3.1 The Derivative Definition and Rates of Change 3.2 Basic Differentiation Rules & Rectilinear Motion 3.3 The Product and Quotient Rules 3.4 Derivatives of Trigonometric Functions
4 Chapter 4: Advanced Differentiation Techniques
4.1 The Chain Rule 4.2 Derivatives of Exponential & Logarithmic Functions 4.3 Derivatives of Inverse Trigonometric Functions 4.4 Derivatives of Inverse Functions 4.5 Implicit Differentiation 4.6 L'Hôpital's Rule and Indeterminate Forms
5 Chapter 5: Applications of Differential Calculus
5.1 Tangent Lines, Normal Lines & Linear Approximation 5.2 Rolle's Theorem & The Mean Value Theorem 5.3 Curve Analysis & The First Derivative Test 5.4 Concavity and the Second Derivative Test 5.5 Applied Optimization Problems 5.6 Related Rates of Change
6 Chapter 6: Foundations of Integral Calculus
6.1 Antiderivatives and Indefinite Integrals 6.2 Integration by Substitution (Indefinite) 6.3 Riemann Sums and the Definite Integral 6.4 Properties of the Definite Integral
7 Chapter 7: Fundamental Theorem of Calculus & Net Change
7.1 The Fundamental Theorem of Calculus 7.2 Definite Integrals via Substitution 7.3 The Net Change Theorem & Rectilinear Particle Motion
8 Chapter 8: Applications of Integrals & Differential Equations
8.1 Area Between Curves 8.2 Volumes of Solids of Revolution 8.3 Average Value of a Function & The Mean Value Theorem for Integrals 8.4 Separable Differential Equations & Growth/Decay Models
6.3 Riemann Sums and the Definite Integral
Key Takeaways Explain This Topic AI
A Riemann sum approximates the exact net area under a continuous curve on [a, b] by summing the areas of n approximating rectangles of width Delta x = (b - a)/n.
The four primary approximation schemes are Left Riemann Sum (LRAM), Right Riemann Sum (RRAM), Midpoint Riemann Sum (MRAM), and the Trapezoidal Rule T_n = (LRAM + RRAM)/2.
Under- and over-estimation behaviors depend strictly on function properties: monotonicity (f') dictates Left vs. Right sums, while concavity (f'') dictates Midpoint vs. Trapezoidal sums.
When approximating from discrete data tables with unequal subinterval widths, compute each rectangle or trapezoid width Delta x_i = x_i - x_(i-1) individually.
The definite integral is formally defined as the infinite limit of Riemann sums int_a^b f(x) dx = lim_{n -> inf} sum_{i=1}^n f(x_i*) Delta x, providing the bridge to convert limit summation expressions directly into definite integrals.
Last updated: August 2026
6.3 Riemann Sums and the Definite Integral
Core CLEP Concept: Before computing definite integrals symbolically, calculus defines the area under a curve through numerical approximations known as Riemann sums . On the CLEP Calculus exam, questions test your ability to construct Left, Right, Midpoint, and Trapezoidal sums from functions and tables, determine whether an approximation is an overestimate or underestimate based on derivative tests, and convert limit Riemann sum expressions into definite integrals.
1. The Area Problem and Regular Partitions
To find the area bounded by a continuous, non-negative function y = f ( x ) y = f(x) y = f ( x ) , the x x x -axis, and the vertical lines x = a x = a x = a and x = b x = b x = b , we divide the interval [ a , b ] [a, b] [ a , b ] into n n n subintervals.
For a regular partition , all n n n subintervals have equal width: Δ x = b − a n \Delta x = \frac{b - a}{n} Δ x = n b − a
The grid points partitioning the interval are defined by: x 0 = a , x 1 = a + Δ x , x 2 = a + 2 Δ x , … , x i = a + i Δ x , … , x n = b x_0 = a, \quad x_1 = a + \Delta x, \quad x_2 = a + 2\Delta x, \quad \dots, \quad x_i = a + i\Delta x, \quad \dots, \quad x_n = b x 0 = a , x 1 = a + Δ x , x 2 = a + 2Δ x , … , x i = a + i Δ x , … , x n = b a = x_0 x_1 x_2 x_3 x_n = b
- |---------|---------|---------|-- ... --------|
- Delta x Delta x Delta x Delta x
On each subinterval [ x i − 1 , x i ] [x_{i-1}, x_i] [ x i − 1 , x i ] , we choose an evaluation sample point x i ∗ x_i^* x i ∗ to determine the height of a approximating rectangle: Area i = f ( x i ∗ ) Δ x \text{Area}_i = f(x_i^*) \Delta x Area i = f ( x i ∗ ) Δ x .
2. The Four Primary Riemann Approximation Schemes
Depending on how the evaluation point x i ∗ x_i^* x i ∗ is chosen, four standard approximation formulas arise: Left Sum (LRAM) Right Sum (RRAM) Midpoint (MRAM) Trapezoid (T_n)
- x_i* = x_{i-1} x_i* = x_i x_i* = (x_{i-1}+x_i)/2 Average of L & R
- +---+ +---+ +---+ /|
- | | | | | | / |
- | | | | | | / |
- ---+---+---- ----+---+---- ----+---+---- ---+---+----
- x_0 x_1 x_0 x_1 x_0 x_1 x_0 x_1
- 1. Left Riemann Sum (LRAM)
Evaluates the function at the left endpoint of each subinterval ( x i ∗ = x i − 1 x_i^* = x_{i-1} x i ∗ = x i − 1 ): L n = ∑ i = 1 n f ( x i − 1 ) Δ x = Δ x [ f ( x 0 ) + f ( x 1 ) + f ( x 2 ) + ⋯ + f ( x n − 1 ) ] L_n = \sum_{i=1}^n f(x_{i-1}) \Delta x = \Delta x \left[ f(x_0) + f(x_1) + f(x_2) + \dots + f(x_{n-1}) \right] L n = i = 1 ∑ n f ( x i − 1 ) Δ x = Δ x [ f ( x 0 ) + f ( x 1 ) + f ( x 2 ) + ⋯ + f ( x n − 1 ) ]
2. Right Riemann Sum (RRAM)
Evaluates the function at the right endpoint of each subinterval ( x i ∗ = x i x_i^* = x_i x i ∗ = x i ): R n = ∑ i = 1 n f ( x i ) Δ x = Δ x [ f ( x 1 ) + f ( x 2 ) + f ( x 3 ) + ⋯ + f ( x n ) ] R_n = \sum_{i=1}^n f(x_i) \Delta x = \Delta x \left[ f(x_1) + f(x_2) + f(x_3) + \dots + f(x_n) \right] R n = i = 1 ∑ n f ( x i ) Δ x = Δ x [ f ( x 1 ) + f ( x 2 ) + f ( x 3 ) + ⋯ + f ( x n ) ]
3. Midpoint Riemann Sum (MRAM)
Evaluates the function at the exact center of each subinterval ( x i ∗ = m i = x i − 1 + x i 2 x_i^* = m_i = \frac{x_{i-1} + x_i}{2} x i ∗ = m i = 2 x i − 1 + x i ): M n = ∑ i = 1 n f ( m i ) Δ x = Δ x [ f ( m 1 ) + f ( m 2 ) + ⋯ + f ( m n ) ] M_n = \sum_{i=1}^n f(m_i) \Delta x = \Delta x \left[ f(m_1) + f(m_2) + \dots + f(m_n) \right] M n = i = 1 ∑ n f ( m i ) Δ x = Δ x [ f ( m 1 ) + f ( m 2 ) + ⋯ + f ( m n ) ]
4. The Trapezoidal Rule ( T n T_n T n )
Replaces rectangular tops with linear secant chords connecting ( x i − 1 , f ( x i − 1 ) ) (x_{i-1}, f(x_{i-1})) ( x i − 1 , f ( x i − 1 )) and ( x i , f ( x i ) ) (x_i, f(x_i)) ( x i , f ( x i )) . The area of each trapezoid is f ( x i − 1 ) + f ( x i ) 2 Δ x \frac{f(x_{i-1}) + f(x_i)}{2} \Delta x 2 f ( x i − 1 ) + f ( x i ) Δ x . Summing all n n n trapezoids yields: T n = Δ x 2 [ f ( x 0 ) + 2 f ( x 1 ) + 2 f ( x 2 ) + ⋯ + 2 f ( x n − 1 ) + f ( x n ) ] T_n = \frac{\Delta x}{2} \left[ f(x_0) + 2f(x_1) + 2f(x_2) + \dots + 2f(x_{n-1}) + f(x_n) \right] T n = 2 Δ x [ f ( x 0 ) + 2 f ( x 1 ) + 2 f ( x 2 ) + ⋯ + 2 f ( x n − 1 ) + f ( x n ) ]
Key Identity: The Trapezoidal approximation is precisely the arithmetic mean of the Left and Right Riemann sums: T n = L n + R n 2 T_n = \frac{L_n + R_n}{2} T n = 2 L n + R n
3. Overestimate vs. Underestimate Analysis
The relationship between Riemann approximations and the exact value of the integral I = ∫ a b f ( x ) d x I = \int_a^b f(x) \, dx I = ∫ a b f ( x ) d x depends strictly on the geometric shape of f ( x ) f(x) f ( x ) :
Monotonicity Rules (First Derivative f ′ ( x ) f'(x) f ′ ( x ) )
Monotonicity controls Left versus Right sum behavior:
Function Behavior Condition Left Sum ( L n L_n L n ) Right Sum ( R n R_n R n ) Inequality Chain
Strictly Increasing f ′ ( x ) > 0 f'(x) > 0 f ′ ( x ) > 0 Underestimate Overestimate L n < ∫ a b f ( x ) d x < R n L_n < \int_a^b f(x) \, dx < R_n L n < ∫ a b f ( x ) d x < R n
Strictly Decreasing f ′ ( x ) < 0 f'(x) < 0 f ′ ( x ) < 0 Overestimate Underestimate R n < ∫ a b f ( x ) d x < L n R_n < \int_a^b f(x) \, dx < L_n R n < ∫ a b f ( x ) d x < L n
Concavity Rules (Second Derivative f ′ ′ ( x ) f''(x) f ′′ ( x ) )
Concavity controls Midpoint versus Trapezoidal sum behavior:
Function Concavity Condition Trapezoidal Rule ( T n T_n T n ) Midpoint Rule ( M n M_n M n ) Inequality Chain
Concave Up f ′ ′ ( x ) > 0 f''(x) > 0 f ′′ ( x ) > 0 Overestimate (secant chords lie above curve) Underestimate (midpoint tangents lie below curve) M n < ∫ a b f ( x ) d x < T n M_n < \int_a^b f(x) \, dx < T_n M n < ∫ a b f ( x ) d x < T n
Concave Down f ′ ′ ( x ) < 0 f''(x) < 0 f ′′ ( x ) < 0 Underestimate (secant chords lie below curve) Overestimate (midpoint tangents lie above curve) T n < ∫ a b f ( x ) d x < M n T_n < \int_a^b f(x) \, dx < M_n T n < ∫ a b f ( x ) d x < M n
Combined Classification Matrix
For a function that is strictly decreasing and concave up on [ a , b ] [a, b] [ a , b ] : R n < M n < ∫ a b f ( x ) d x < T n < L n R_n < M_n < \int_a^b f(x) \, dx < T_n < L_n R n < M n < ∫ a b f ( x ) d x < T n < L n
4. Tabular Riemann Sums with Unequal Subintervals
On the CLEP exam, data is frequently given in a discrete table where the step size Δ x i = x i − x i − 1 \Delta x_i = x_i - x_{i-1} Δ x i = x i − x i − 1 varies between adjacent points. You cannot factor out a single Δ x \Delta x Δ x ; you must calculate each subregion independently.
Step-by-Step Worked Example: Tabular Data
Problem: The velocity v ( t ) v(t) v ( t ) of a vehicle is recorded at selected times t t t (in seconds) in the table below:
- t t t (seconds) 0 3 7 8 12
- v ( t ) v(t) v ( t ) (ft/sec) 12 18 24 20 30
Compute the approximate distance traveled ∫ 0 12 v ( t ) d t \int_0^{12} v(t) \, dt ∫ 0 12 v ( t ) d t using:
A Left Riemann Sum with 4 subintervals.
A Trapezoidal Sum with 4 subintervals.
Part 1: Left Riemann Sum ( L 4 L_4 L 4 )
Interval 1 [ 0 , 3 ] [0, 3] [ 0 , 3 ] : Δ t 1 = 3 − 0 = 3 \Delta t_1 = 3 - 0 = 3 Δ t 1 = 3 − 0 = 3 . Left value v ( 0 ) = 12 v(0) = 12 v ( 0 ) = 12 . Area 1 = 3 ( 12 ) = 36 \text{Area}_1 = 3(12) = 36 Area 1 = 3 ( 12 ) = 36 .
Interval 2 [ 3 , 7 ] [3, 7] [ 3 , 7 ] : Δ t 2 = 7 − 3 = 4 \Delta t_2 = 7 - 3 = 4 Δ t 2 = 7 − 3 = 4 . Left value v ( 3 ) = 18 v(3) = 18 v ( 3 ) = 18 . Area 2 = 4 ( 18 ) = 72 \text{Area}_2 = 4(18) = 72 Area 2 = 4 ( 18 ) = 72 .
Interval 3 [ 7 , 8 ] [7, 8] [ 7 , 8 ] : Δ t 3 = 8 − 7 = 1 \Delta t_3 = 8 - 7 = 1 Δ t 3 = 8 − 7 = 1 . Left value v ( 7 ) = 24 v(7) = 24 v ( 7 ) = 24 . Area 3 = 1 ( 24 ) = 24 \text{Area}_3 = 1(24) = 24 Area 3 = 1 ( 24 ) = 24 .
Interval 4 [ 8 , 12 ] [8, 12] [ 8 , 12 ] : Δ t 4 = 12 − 8 = 4 \Delta t_4 = 12 - 8 = 4 Δ t 4 = 12 − 8 = 4 . Left value v ( 8 ) = 20 v(8) = 20 v ( 8 ) = 20 . Area 4 = 4 ( 20 ) = 80 \text{Area}_4 = 4(20) = 80 Area 4 = 4 ( 20 ) = 80 . L 4 = 36 + 72 + 24 + 80 = 212 feet L_4 = 36 + 72 + 24 + 80 = 212 \text{ feet} L 4 = 36 + 72 + 24 + 80 = 212 feet
Part 2: Trapezoidal Sum ( T 4 T_4 T 4 )
Interval 1 [ 0 , 3 ] [0, 3] [ 0 , 3 ] : Area 1 = 12 + 18 2 ⋅ 3 = 15 ⋅ 3 = 45 \text{Area}_1 = \frac{12 + 18}{2} \cdot 3 = 15 \cdot 3 = 45 Area 1 = 2 12 + 18 ⋅ 3 = 15 ⋅ 3 = 45 .
Interval 2 [ 3 , 7 ] [3, 7] [ 3 , 7 ] : Area 2 = 18 + 24 2 ⋅ 4 = 21 ⋅ 4 = 84 \text{Area}_2 = \frac{18 + 24}{2} \cdot 4 = 21 \cdot 4 = 84 Area 2 = 2 18 + 24 ⋅ 4 = 21 ⋅ 4 = 84 .
Interval 3 [ 7 , 8 ] [7, 8] [ 7 , 8 ] : Area 3 = 24 + 20 2 ⋅ 1 = 22 ⋅ 1 = 22 \text{Area}_3 = \frac{24 + 20}{2} \cdot 1 = 22 \cdot 1 = 22 Area 3 = 2 24 + 20 ⋅ 1 = 22 ⋅ 1 = 22 .
Interval 4 [ 8 , 12 ] [8, 12] [ 8 , 12 ] : Area 4 = 20 + 30 2 ⋅ 4 = 25 ⋅ 4 = 100 \text{Area}_4 = \frac{20 + 30}{2} \cdot 4 = 25 \cdot 4 = 100 Area 4 = 2 20 + 30 ⋅ 4 = 25 ⋅ 4 = 100 . T 4 = 45 + 84 + 22 + 100 = 251 feet T_4 = 45 + 84 + 22 + 100 = 251 \text{ feet} T 4 = 45 + 84 + 22 + 100 = 251 feet
5. Formal Limit Definition of the Definite Integral
If f f f is continuous on [ a , b ] [a, b] [ a , b ] , the exact definite integral is defined as the limit of Riemann sums as the number of subintervals approaches infinity ( n → ∞ n \to \infty n → ∞ ): ∫ a b f ( x ) d x = lim n → ∞ ∑ i = 1 n f ( x i ∗ ) Δ x = lim n → ∞ ∑ i = 1 n f ( a + i b − a n ) ( b − a n ) \int_a^b f(x) \, dx = \lim_{n \to \infty} \sum_{i=1}^n f(x_i^*) \Delta x = \lim_{n \to \infty} \sum_{i=1}^n f\left( a + i \frac{b-a}{n} \right) \left( \frac{b-a}{n} \right) ∫ a b f ( x ) d x = n → ∞ lim i = 1 ∑ n f ( x i ∗ ) Δ x = n → ∞ lim i = 1 ∑ n f ( a + i n b − a ) ( n b − a )
Reverse-Engineering Limits into Definite Integrals
CLEP questions often present a complex limit of a summation and ask you to identify the equivalent definite integral. Follow this 4-step decoding process:
Identify Δ x \Delta x Δ x : The term of the form k n \frac{k}{n} n k factoring the sum is Δ x = b − a n \Delta x = \frac{b - a}{n} Δ x = n b − a , establishing the interval length b − a = k b - a = k b − a = k .
Identify the base point a a a and grid points x i x_i x i : Look for a + k i n a + \frac{ki}{n} a + n ki . If the term is simply k i n \frac{ki}{n} n ki , then a = 0 a = 0 a = 0 .
Determine upper limit b b b : b = a + k b = a + k b = a + k .
Extract the function f ( x ) f(x) f ( x ) : Replace the expression ( a + k i n ) \left(a + \frac{ki}{n}\right) ( a + n ki ) with x x x .
Step-by-Step Worked Example: Limit Translation
Problem: Express lim n → ∞ ∑ i = 1 n ( 3 + 5 i n ) 4 ( 5 n ) \lim_{n \to \infty} \sum_{i=1}^n \left( 3 + \frac{5i}{n} \right)^4 \left( \frac{5}{n} \right) lim n → ∞ ∑ i = 1 n ( 3 + n 5 i ) 4 ( n 5 ) as a definite integral.
Step 1: Δ x = 5 n ⟹ b − a = 5 \Delta x = \frac{5}{n} \implies b - a = 5 Δ x = n 5 ⟹ b − a = 5 .
Step 2: The argument is x i = 3 + 5 i n ⟹ a = 3 x_i = 3 + \frac{5i}{n} \implies a = 3 x i = 3 + n 5 i ⟹ a = 3 .
Step 3: b = a + 5 = 3 + 5 = 8 b = a + 5 = 3 + 5 = 8 b = a + 5 = 3 + 5 = 8 .
Step 4: The expression is ( x i ) 4 ⟹ f ( x ) = x 4 (x_i)^4 \implies f(x) = x^4 ( x i ) 4 ⟹ f ( x ) = x 4 .
Result: ∫ 3 8 x 4 d x \int_3^8 x^4 \, dx ∫ 3 8 x 4 d x .
6. Common CLEP Pitfalls & Traps
Blindly Using the Uniform Trapezoidal Formula on Tables: The formula Δ x 2 [ f ( x 0 ) + 2 f ( x 1 ) + ⋯ + f ( x n ) ] \frac{\Delta x}{2}[f(x_0) + 2f(x_1) + \dots + f(x_n)] 2 Δ x [ f ( x 0 ) + 2 f ( x 1 ) + ⋯ + f ( x n )] requires equal interval widths. If Δ t \Delta t Δ t varies across table columns, you must compute each trapezoid independently.
Confusing Concavity with Monotonicity: First derivatives ( f ′ > 0 f' > 0 f ′ > 0 or f ′ < 0 f' < 0 f ′ < 0 ) govern Left vs. Right sum over/under-estimates. Second derivatives ( f ′ ′ > 0 f'' > 0 f ′′ > 0 or f ′ ′ < 0 f'' < 0 f ′′ < 0 ) govern Midpoint vs. Trapezoid over/under-estimates.
Off-by-One Endpoint Errors: In an n = 4 n = 4 n = 4 Left Riemann Sum, use f ( x 0 ) , f ( x 1 ) , f ( x 2 ) , f ( x 3 ) f(x_0), f(x_1), f(x_2), f(x_3) f ( x 0 ) , f ( x 1 ) , f ( x 2 ) , f ( x 3 ) (do not include the rightmost endpoint f ( x 4 ) f(x_4) f ( x 4 ) ). In a Right sum, use f ( x 1 ) , f ( x 2 ) , f ( x 3 ) , f ( x 4 ) f(x_1), f(x_2), f(x_3), f(x_4) f ( x 1 ) , f ( x 2 ) , f ( x 3 ) , f ( x 4 ) (do not include f ( x 0 ) f(x_0) f ( x 0 ) ).