跳到主要内容

Riemann Sums — Mark Scheme Patterns

Mark Allocation Overview​

Question TypeTotal MarksM marksA marksB marks
Upper bound (rectangles)4220
Lower bound (rectangles)4220
Both bounds (combined)8440
Stirling approximation8440

Pattern: Upper/Lower Bound Using Rectangles (4 marks each)​

  • M1: Δx=b−an\Delta x = \frac{b-a}{n} and correct endpoint identification
  • M1: Form sum ∑f(xi)Δx\sum f(x_i)\Delta x with correct xix_i
  • A1: Correct sigma expression (unsimplified)
  • A1: Correct simplified expression in terms of nn

评分细节​

步骤标记示例
Δx=1n\Delta x = \frac{1}{n} + 判断递增/递减M1Δx=1n\Delta x = \frac{1}{n}, 递增用右端点
∑i=1nf(xi)Δx\sum_{i=1}^n f(x_i)\Delta xM1∑i=1n(in)2⋅1n\sum_{i=1}^n \left(\frac{i}{n}\right)^2 \cdot \frac{1}{n}
1n3∑i2=1n3⋅n(n+1)(2n+1)6\frac{1}{n^3}\sum i^2 = \frac{1}{n^3}\cdot\frac{n(n+1)(2n+1)}{6}A1代入求和公式
(n+1)(2n+1)6n2\frac{(n+1)(2n+1)}{6n^2}A1化简完成

Pattern: Stirling Approximation (8 marks)​

  • M1: Express ln⁡N!=∑r=1Nln⁡r\ln N! = \sum_{r=1}^N \ln r
  • M1: Set f(x)=ln⁡xf(x) = \ln x, identify increasing function
  • M1: Left endpoint inequality (lower bound for increasing function)
  • M1: Right endpoint inequality (upper bound for increasing function)
  • A1: Evaluate ∫1Nln⁡x dx=Nln⁡N−N+1\int_1^N \ln x\,dx = N\ln N - N + 1
  • A1: Correct lower bound inequality (may be for ln⁡(N−1)!\ln(N-1)!)
  • A1: Correct upper bound inequality
  • A1: Final inequality for ln⁡N!\ln N!

不等式的方向​

对递增函数 f(x)=ln⁡xf(x) = \ln x:

左端点:∑r=1N−1ln⁡r≤∫1Nln⁡x dx≤∑r=2Nln⁡r\text{左端点:} \sum_{r=1}^{N-1} \ln r \le \int_1^N \ln x\,dx \le \sum_{r=2}^N \ln r

即 ln⁡(N−1)!≤Nln⁡N−N+1≤ln⁡N!\text{即 } \ln(N-1)! \le N\ln N - N + 1 \le \ln N!

关键扣分点
  • 将左右端点弄反 → 扣 M1
  • 求和下标范围错误(如从 r=1r=1 到 NN 而非 N−1N-1)→ 扣 A1
  • 最终不等式方向错误 → 扣 A1

Follow-Through Rules​

  • 如果求和公式用错(如 ∑r2\sum r^2 公式写错),后续使用可 ft
  • 上下界判断错误但计算正确,最多扣 M1
  • Stirling 近似中,积分计算错可 ft 后续不等式