Vai al contenuto

OCR A level Further Maths B (MEI)

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

581 flashcard per OCR A-Level Further Maths B (MEI), creata da cookie, in 67 sottomazzi che seguono gli argomenti del corso.

Studia queste carte

Selezionati per lo stesso corso in base a ciò che viene usato più spesso; puoi consultarli tutti senza un account.

Tutto per Further Maths

Cerchi aiuto per Further Maths?

Cookie Tutoring, il nostro servizio di lezioni private, potrebbe avere tutor per Further Maths. Le lezioni sono in diretta e individuali; i primi 15 minuti con qualsiasi tutor sono gratuiti.

Trova 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.

Aggiungendolo avrai una tua copia, con tutti i sottomazzi. Ogni flashcard tornerà poco prima che tu la dimentichi e ogni risposta giusta o sbagliata contribuirà alla tua padronanza dell'argomento. Una volta aggiunto, potrai eliminare o sospendere le parti che non stai studiando.

Cosa contiene (67 sottomazzi)

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

Alcune delle sue flashcard

  • 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

E altre 571 dopo aver aggiunto il mazzo.