Skip to content

Course home

1.10 Numerical Methods (A-level only)

1.10 Numerical Methods (A-level only)

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
Question 51

The rate of accumulation of a specific pollutant in a coastal reservoir, RRR, measured in kg/hour, is modeled by the function R(t)=3t3t2+9R(t) = \frac{3t^3}{t^2+9}R(t)=t2+93t3​ for 0≤t≤80 \le t \le 80≤t≤8, where ttt represents the time in hours after a filtration system failure.

a.

A researcher approximates the total mass of pollutant accumulated during this 8-hour period, MMM, using the trapezium rule with n=4n = 4n=4 equal intervals. (i) State the number of ordinates that the researcher uses. (ii) Calculate the approximation for MMM that the researcher should obtain. Give your answer correct to two decimal places.

[5]
b.

Show that the exact mass of pollutant accumulated, given by M=∫08R(t) dtM = \int_{0}^{8} R(t) \, dtM=∫08​R(t)dt, is exactly 96−272ln⁡(739)96 - \frac{27}{2}\ln\left(\frac{73}{9}\right)96−227​ln(973​). Fully justify your answer.

[4]
c.

Explain what would happen to the researcher's approximation in part (a)(ii) as n→∞n \to \inftyn→∞.

[1]
Markscheme

1.10 Numerical Methods (A-level only) Questions

  1. A Level
  2. /Maths
  3. /1.10 Numerical Methods (A-level only)

137 exam-style questions on OCR (MEI) A Level Maths 1.10 Numerical Methods (A-level only), covering 1.10.1 Locate roots by change of sign (A-level only), 1.10.2 When change of sign methods fail (A-level only), 1.10.3 Fixed point iteration (A-level only), 1.10.4 Newton-Raphson method (A-level only), 1.10.5 Convergence of iterations (A-level only), 1.10.6 Trapezium rule (A-level only), 1.10.7 Upper and lower bounds using rectangles (A-level only), and 1.10.8 Numerical methods to solve problems (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.

Question bank