6.3 Riemann Sums and the Definite Integral

Key Takeaways

  • 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), the xx-axis, and the vertical lines x=ax = a and x=bx = b, we divide the interval [a,b][a, b] into nn subintervals.

For a regular partition, all nn subintervals have equal width:

Δx=b−an\Delta x = \frac{b - a}{n}

The grid points partitioning the interval are defined by:

x0=a,x1=a+Δx,x2=a+2Δx,…,xi=a+iΔx,…,xn=bx_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
   a = x_0       x_1       x_2       x_3            x_n = b
      |---------|---------|---------|-- ... --------|
        Delta x   Delta x   Delta x         Delta x

On each subinterval [xi−1,xi][x_{i-1}, x_i], we choose an evaluation sample point xi∗x_i^* to determine the height of a approximating rectangle: Areai=f(xi∗)Δx\text{Area}_i = f(x_i^*) \Delta x.


2. The Four Primary Riemann Approximation Schemes

Depending on how the evaluation point xi∗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 (xi∗=xi−1x_i^* = x_{i-1}):

Ln=∑i=1nf(xi−1)Δx=Δx[f(x0)+f(x1)+f(x2)+⋯+f(xn−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]

2. Right Riemann Sum (RRAM)

Evaluates the function at the right endpoint of each subinterval (xi∗=xix_i^* = x_i):

Rn=∑i=1nf(xi)Δx=Δx[f(x1)+f(x2)+f(x3)+⋯+f(xn)]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]

3. Midpoint Riemann Sum (MRAM)

Evaluates the function at the exact center of each subinterval (xi∗=mi=xi−1+xi2x_i^* = m_i = \frac{x_{i-1} + x_i}{2}):

Mn=∑i=1nf(mi)Δx=Δx[f(m1)+f(m2)+⋯+f(mn)]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]

4. The Trapezoidal Rule (TnT_n)

Replaces rectangular tops with linear secant chords connecting (xi−1,f(xi−1))(x_{i-1}, f(x_{i-1})) and (xi,f(xi))(x_i, f(x_i)). The area of each trapezoid is f(xi−1)+f(xi)2Δx\frac{f(x_{i-1}) + f(x_i)}{2} \Delta x. Summing all nn trapezoids yields:

Tn=Δx2[f(x0)+2f(x1)+2f(x2)+⋯+2f(xn−1)+f(xn)]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]

Key Identity: The Trapezoidal approximation is precisely the arithmetic mean of the Left and Right Riemann sums:

Tn=Ln+Rn2T_n = \frac{L_n + R_n}{2}

3. Overestimate vs. Underestimate Analysis

The relationship between Riemann approximations and the exact value of the integral I=∫abf(x) dxI = \int_a^b f(x) \, dx depends strictly on the geometric shape of f(x)f(x):

Monotonicity Rules (First Derivative f′(x)f'(x))

Monotonicity controls Left versus Right sum behavior:

Function BehaviorConditionLeft Sum (LnL_n)Right Sum (RnR_n)Inequality Chain
Strictly Increasingf′(x)>0f'(x) > 0UnderestimateOverestimateLn<∫abf(x) dx<RnL_n < \int_a^b f(x) \, dx < R_n
Strictly Decreasingf′(x)<0f'(x) < 0OverestimateUnderestimateRn<∫abf(x) dx<LnR_n < \int_a^b f(x) \, dx < L_n

Concavity Rules (Second Derivative f′′(x)f''(x))

Concavity controls Midpoint versus Trapezoidal sum behavior:

Function ConcavityConditionTrapezoidal Rule (TnT_n)Midpoint Rule (MnM_n)Inequality Chain
Concave Upf′′(x)>0f''(x) > 0Overestimate (secant chords lie above curve)Underestimate (midpoint tangents lie below curve)Mn<∫abf(x) dx<TnM_n < \int_a^b f(x) \, dx < T_n
Concave Downf′′(x)<0f''(x) < 0Underestimate (secant chords lie below curve)Overestimate (midpoint tangents lie above curve)Tn<∫abf(x) dx<MnT_n < \int_a^b f(x) \, dx < M_n

Combined Classification Matrix

For a function that is strictly decreasing and concave up on [a,b][a, b]:

Rn<Mn<∫abf(x) dx<Tn<LnR_n < M_n < \int_a^b f(x) \, dx < 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 Δxi=xi−xi−1\Delta x_i = x_i - x_{i-1} varies between adjacent points. You cannot factor out a single Δx\Delta x; you must calculate each subregion independently.

Step-by-Step Worked Example: Tabular Data

Problem: The velocity v(t)v(t) of a vehicle is recorded at selected times tt (in seconds) in the table below:

tt (seconds)037812
v(t)v(t) (ft/sec)1218242030

Compute the approximate distance traveled ∫012v(t) dt\int_0^{12} v(t) \, dt using:

  1. A Left Riemann Sum with 4 subintervals.
  2. A Trapezoidal Sum with 4 subintervals.

Part 1: Left Riemann Sum (L4L_4)

  • Interval 1 [0,3][0, 3]: Δt1=3−0=3\Delta t_1 = 3 - 0 = 3. Left value v(0)=12v(0) = 12. Area1=3(12)=36\text{Area}_1 = 3(12) = 36.
  • Interval 2 [3,7][3, 7]: Δt2=7−3=4\Delta t_2 = 7 - 3 = 4. Left value v(3)=18v(3) = 18. Area2=4(18)=72\text{Area}_2 = 4(18) = 72.
  • Interval 3 [7,8][7, 8]: Δt3=8−7=1\Delta t_3 = 8 - 7 = 1. Left value v(7)=24v(7) = 24. Area3=1(24)=24\text{Area}_3 = 1(24) = 24.
  • Interval 4 [8,12][8, 12]: Δt4=12−8=4\Delta t_4 = 12 - 8 = 4. Left value v(8)=20v(8) = 20. Area4=4(20)=80\text{Area}_4 = 4(20) = 80.
L4=36+72+24+80=212 feetL_4 = 36 + 72 + 24 + 80 = 212 \text{ feet}

Part 2: Trapezoidal Sum (T4T_4)

  • Interval 1 [0,3][0, 3]: Area1=12+182⋅3=15⋅3=45\text{Area}_1 = \frac{12 + 18}{2} \cdot 3 = 15 \cdot 3 = 45.
  • Interval 2 [3,7][3, 7]: Area2=18+242⋅4=21⋅4=84\text{Area}_2 = \frac{18 + 24}{2} \cdot 4 = 21 \cdot 4 = 84.
  • Interval 3 [7,8][7, 8]: Area3=24+202⋅1=22⋅1=22\text{Area}_3 = \frac{24 + 20}{2} \cdot 1 = 22 \cdot 1 = 22.
  • Interval 4 [8,12][8, 12]: Area4=20+302⋅4=25⋅4=100\text{Area}_4 = \frac{20 + 30}{2} \cdot 4 = 25 \cdot 4 = 100.
T4=45+84+22+100=251 feetT_4 = 45 + 84 + 22 + 100 = 251 \text{ feet}

5. Formal Limit Definition of the Definite Integral

If ff is continuous on [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):

∫abf(x) dx=lim⁡n→∞∑i=1nf(xi∗)Δx=lim⁡n→∞∑i=1nf(a+ib−an)(b−an)\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)

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:

  1. Identify Δx\Delta x: The term of the form kn\frac{k}{n} factoring the sum is Δx=b−an\Delta x = \frac{b - a}{n}, establishing the interval length b−a=kb - a = k.
  2. Identify the base point aa and grid points xix_i: Look for a+kina + \frac{ki}{n}. If the term is simply kin\frac{ki}{n}, then a=0a = 0.
  3. Determine upper limit bb: b=a+kb = a + k.
  4. Extract the function f(x)f(x): Replace the expression (a+kin)\left(a + \frac{ki}{n}\right) with xx.

Step-by-Step Worked Example: Limit Translation

Problem: Express lim⁡n→∞∑i=1n(3+5in)4(5n)\lim_{n \to \infty} \sum_{i=1}^n \left( 3 + \frac{5i}{n} \right)^4 \left( \frac{5}{n} \right) as a definite integral.

  • Step 1: Δx=5n  ⟹  b−a=5\Delta x = \frac{5}{n} \implies b - a = 5.
  • Step 2: The argument is xi=3+5in  ⟹  a=3x_i = 3 + \frac{5i}{n} \implies a = 3.
  • Step 3: b=a+5=3+5=8b = a + 5 = 3 + 5 = 8.
  • Step 4: The expression is (xi)4  ⟹  f(x)=x4(x_i)^4 \implies f(x) = x^4.
  • Result: ∫38x4 dx\int_3^8 x^4 \, dx.

6. Common CLEP Pitfalls & Traps

  1. Blindly Using the Uniform Trapezoidal Formula on Tables: The formula Δx2[f(x0)+2f(x1)+⋯+f(xn)]\frac{\Delta x}{2}[f(x_0) + 2f(x_1) + \dots + f(x_n)] requires equal interval widths. If Δt\Delta t varies across table columns, you must compute each trapezoid independently.
  2. Confusing Concavity with Monotonicity: First derivatives (f′>0f' > 0 or f′<0f' < 0) govern Left vs. Right sum over/under-estimates. Second derivatives (f′′>0f'' > 0 or f′′<0f'' < 0) govern Midpoint vs. Trapezoid over/under-estimates.
  3. Off-by-One Endpoint Errors: In an n=4n = 4 Left Riemann Sum, use f(x0),f(x1),f(x2),f(x3)f(x_0), f(x_1), f(x_2), f(x_3) (do not include the rightmost endpoint f(x4)f(x_4)). In a Right sum, use f(x1),f(x2),f(x3),f(x4)f(x_1), f(x_2), f(x_3), f(x_4) (do not include f(x0)f(x_0)).
Loading diagram...
Riemann Sum Over/Under-Estimate Decision Flowchart
Test Your Knowledge

A vehicle's velocity v(t) in ft/sec is recorded at selected times t in seconds: (0, 10), (2, 14), (5, 20), (9, 16), (10, 22). Using a Trapezoidal Sum with the four subintervals indicated by the table, what is the approximate total distance traveled by the vehicle from t = 0 to t = 10?

A

162 ft

B

158 ft

C

166 ft

D

174 ft

Test Your Knowledge

Suppose f(x) is a strictly decreasing and concave-up function on the interval [2, 8]. Let L_n, R_n, M_n, and T_n represent the Left, Right, Midpoint, and Trapezoidal Riemann sums for int_2^8 f(x) dx with n equal subdivisions. Which of the following inequalities correctly ranks these approximations relative to the exact integral I = int_2^8 f(x) dx?

A

L_n < T_n < I < M_n < R_n

B

R_n < T_n < I < M_n < L_n

C

M_n < R_n < I < L_n < T_n

D

R_n < M_n < I < T_n < L_n

Test Your Knowledge

Which of the following definite integrals is equivalent to the limit of the Riemann sum: lim_{n -> inf} sum_{i=1}^n (3/n) * sqrt(4 + 3i/n)?

A

int_4^7 sqrt(x) dx

B

int_0^3 sqrt(x) dx

C

int_4^7 sqrt(4 + 3x) dx

D

int_1^4 sqrt(3x) dx

Test Your Knowledge

Evaluate the Midpoint Riemann Sum M_4 for the function f(x) = x^2 - 2x + 3 on the interval [0, 8] using n = 4 subintervals of equal width.

A

120

B

128

C

144

D

112

Sections you finish are checked off in the contents.