Saltar al contenido

OCR A level Further Maths B (MEI)

A-Level · OCRFurther Maths B (MEI)581 tarjetas

581 tarjetas para OCR A-Level Further Maths B (MEI), creada por cookie, en 67 submazos que siguen los temas del curso.

Estudiar estas tarjetas

Seleccionado para el mismo curso según lo que más usa la gente. Todo se puede consultar sin una cuenta.

Todo sobre Further Maths

¿Buscas ayuda con Further Maths?

Cookie Tutoring, nuestro servicio de clases particulares, puede tener tutores para Further Maths. Las clases son en directo e individuales, y los primeros 15 minutos con cualquier tutor son gratis.

Buscar un tutor

Flashcards for OCR A Level Further Mathematics B (MEI), H645, split into Core Pure and then each major and minor option, and by topic in the specification's order. Delete or suspend any option you do not take once the deck is yours.

Al añadirlo, tendrás tu propia copia con todos sus submazos. Cada tarjeta volverá a aparecer justo antes de que la olvides, y cada respuesta correcta o incorrecta contará para tu dominio del tema. Cuando sea tuyo, podrás borrar o suspender las partes que no estés estudiando.

Qué contiene (67 submazos)

  • Core Pure (Y420)150 tarjetas
    • 1. Proof by induction9 tarjetas
    • 2. Complex numbers24 tarjetas
    • 3. Matrices and transformations19 tarjetas
    • 4. Vectors and 3-D space21 tarjetas
    • 5. Algebra and roots of polynomials10 tarjetas
    • 6. Series14 tarjetas
    • 7. Calculus14 tarjetas
    • 8. Polar coordinates7 tarjetas
    • 9. Hyperbolic functions15 tarjetas
    • 10. Differential equations17 tarjetas
  • Extra Pure (Y435)57 tarjetas
    • 1. Recurrence relations11 tarjetas
    • 2. Sets and number notation10 tarjetas
    • 3. Groups13 tarjetas
    • 4. Matrices: eigenvalues and diagonalisation12 tarjetas
    • 5. Multivariable calculus11 tarjetas
  • Further Pure with Technology (Y436)52 tarjetas
    • 1. Exploring curves11 tarjetas
    • 2. Euler and Runge-Kutta methods11 tarjetas
    • 3. Prime factorisation10 tarjetas
    • 4. Congruences and modular arithmetic13 tarjetas
    • 5. Diophantine equations7 tarjetas
  • Mechanics Major (Y421)82 tarjetas
    • 1. Dimensional analysis9 tarjetas
    • 2. Forces and friction10 tarjetas
    • 3. Work, energy and power10 tarjetas
    • 4. Momentum and impulse14 tarjetas
    • 5. Circular motion9 tarjetas
    • 6. Hooke's law and elastic strings5 tarjetas
    • 7. Centre of mass8 tarjetas
    • 8. Equilibrium of rigid bodies4 tarjetas
    • 9. Kinematics and calculus in mechanics9 tarjetas
    • 10. Direct impact and oblique impact4 tarjetas
  • Mechanics Minor (Y431)27 tarjetas
    • 1. Dimensional analysis7 tarjetas
    • 2. Forces7 tarjetas
    • 3. Work, energy and power5 tarjetas
    • 4. Momentum, impulse and direct impact4 tarjetas
    • 5. Centre of mass4 tarjetas
  • Modelling with Algorithms (Y433)59 tarjetas
    • 1. Algorithms and complexity15 tarjetas
    • 2. Packing5 tarjetas
    • 3. Networks and graphs11 tarjetas
    • 4. Critical path analysis7 tarjetas
    • 5. Network flows6 tarjetas
    • 6. Linear programming10 tarjetas
    • 7. Matching, allocation and transportation problems5 tarjetas
  • Numerical Methods (Y434)43 tarjetas
    • 1. Errors8 tarjetas
    • 2. Solving equations numerically11 tarjetas
    • 3. Numerical differentiation5 tarjetas
    • 4. Numerical integration11 tarjetas
    • 5. Interpolation8 tarjetas
  • Statistics Major (Y422)89 tarjetas
    • 1. Sampling14 tarjetas
    • 2. Probability distributions21 tarjetas
    • 3. Continuous random variables18 tarjetas
    • 4. Bivariate data13 tarjetas
    • 5. Chi-squared tests8 tarjetas
    • 6. Inference: confidence intervals and hypothesis tests11 tarjetas
    • 7. Simulation4 tarjetas
  • Statistics Minor (Y432)22 tarjetas
    • 1. Sampling4 tarjetas
    • 2. Discrete distributions9 tarjetas
    • 3. Bivariate data5 tarjetas
    • 4. Chi-squared tests4 tarjetas

Algunas de sus tarjetas

  • What two steps does a proof by induction need?
    A base case, and an inductive step that assumes the result for n = k and proves it for n = k + 1
  • What is the general solution form of a first order linear recurrence un+1=aun+bu_{n+1} = au_n + b with a≠1a \ne 1?
    un=Aan+b1−au_n = A a^n + \frac{b}{1 - a}
  • What is a vertical asymptote of y=f(x)y = f(x)?
    A line x=ax = a where f(x)f(x) tends to infinity as xx approaches aa
  • What are the dimensions of velocity?
    LT−1LT^{-1}
  • Which dimensions does the moment of a force have?
    ML2T−2ML^2T^{-2}, the same as energy
  • What is an algorithm?
    A finite, precisely specified sequence of steps that solves a problem
  • What is the absolute error in an approximation aa to a true value tt?
    ∣a−t∣\lvert a - t \rvert
  • What is a simple random sample?
    A sample in which every member of the population has an equal chance of selection, and every possible sample of that size is equally likely
  • What is cluster sampling?
    Dividing the population into clusters, randomly selecting some clusters, and sampling everyone in them
  • In a proof by induction, what does the base case establish?
    That the result is true for the first value of n in the statement, usually n = 1

Y 571 más cuando añadas el mazo.