コンテンツへ移動

WJEC A-Level Mathematics

A-Level · WJECMathematics4個のフォルダーに53件のノート、240 KB

試験勉強用ノート53件。cookieが作成。コースのトピックに沿った4個のセクションに分かれています。

Notes for WJEC A-level Mathematics (1300), in folders for the four units in the specification's order: AS pure, AS applied, A2 pure and A2 applied. Each note covers one topic with definitions, results, methods and worked examples, and the AS folders can be kept alone by anyone not taking the A2 units. Delete any folder or note you don't need once the notes are yours.

追加すると、そのコピーがノートに保存されます。専用のフォルダに下のフォルダ構成ごと入り、編集してフラッシュカードや問題デッキにできます。ダウンロードすると、どのノートアプリでも開けるマークダウンファイルのzipが取得できます。

内容

  • AS Pure mathematics
    • Proof and set notation5 KB
    • Indices and surds3 KB
    • Quadratic functions and equations4 KB
    • Simultaneous equations and inequalities4 KB
    • Polynomials and the factor theorem3 KB
    • Functions, graphs and transformations5 KB
    • Straight lines and circles5 KB
    • The binomial expansion for positive integers3 KB
    • Trigonometry of triangles, functions and graphs5 KB
    • Trigonometric identities and equations4 KB
    • Exponentials and logarithms6 KB
    • Differentiation4 KB
    • Stationary points and optimisation4 KB
    • Integration3 KB
    • Vectors in two dimensions4 KB
  • AS Applied mathematics
    • Sampling4 KB
    • Data presentation and summary measures6 KB
    • Bivariate data, correlation and cleaning data5 KB
    • Probability4 KB
    • Discrete distributions: binomial, Poisson and discrete uniform4 KB
    • Hypothesis testing with the binomial distribution5 KB
    • Kinematics in a straight line6 KB
    • Kinematics with calculus4 KB
    • Forces and Newton's laws5 KB
    • Connected particles and pulleys4 KB
  • A2 Pure mathematics
    • Proof by contradiction4 KB
    • Rational expressions and partial fractions4 KB
    • The modulus function3 KB
    • Composite and inverse functions5 KB
    • Parametric equations4 KB
    • Binomial expansion for any rational power4 KB
    • Sequences and series5 KB
    • Radians, arcs, sectors and small angles4 KB
    • Reciprocal and inverse trigonometric functions5 KB
    • Double and compound angle formulae4 KB
    • The R form and trigonometric proofs5 KB
    • Differentiation of standard functions and rules4 KB
    • Second derivatives, inflexion and connected rates4 KB
    • Integration of standard functions4 KB
    • Integration by substitution and by parts4 KB
    • Integration with partial fractions and separable differential equations4 KB
    • Numerical methods6 KB
  • A2 Applied mathematics
    • Conditional probability5 KB
    • The Normal and continuous uniform distributions6 KB
    • Hypothesis testing for correlation and for a Normal mean6 KB
    • Trigonometry in context5 KB
    • Differential equations in context4 KB
    • Moments4 KB
    • Kinematics in two dimensions5 KB
    • Projectiles5 KB
    • Forces in two dimensions5 KB
    • Friction, inclined planes and pulleys5 KB
    • Vectors in three dimensions5 KB

最初のノート

AS Pure mathematics / Proof and set notation

What a proof is

A proof is a chain of logical steps that starts from given assumptions, or from results already established, and ends at the statement to be shown. Each step must follow from the one before, and the conclusion has to hold in every case covered, not just in the cases tried. A few examples that work prove nothing on their own; a single example that fails is enough to disprove a general claim.

Three methods are used at this level.

Proof by deduction

Start from known facts and use algebra to reach the result. To prove something about a family of integers, represent them algebraically: an even number is 2n2n, an odd number is 2n+12n+1, and consecutive integers are nn and n+1n+1, where nn is an integer.

Claim: the sum of two consecutive odd numbers is a multiple of 4.

(2n+1)+(2n+3)=4n+4=4(n+1) \begin{aligned} (2n+1) + (2n+3) &= 4n + 4 \\ &= 4(n+1) \end{aligned}

Since n+1n+1 is an integer, the sum is a multiple of 4.

Claim: the square of any odd number is one more than a multiple of 8. Write the odd number as 2n+12n+1. Then (2n+1)2=4n2+4n+1=4n(n+1)+1(2n+1)^2 = 4n^2 + 4n + 1 = 4n(n+1) + 1. One of nn and n+1n+1 is even, so n(n+1)n(n+1) is even and 4n(n+1)4n(n+1) is a multiple of 8.

The laws of logarithms are also proved by deduction, from the definition that x=anx = a^n means n=log⁡axn = \log_a x (for a>0a > 0, x>0x > 0). Let x=amx = a^m and y=any = a^n, so that log⁡ax=m\log_a x = m and log⁡ay=n\log_a y = n.

  • The product: xy=am×an=am+nxy = a^m \times a^n = a^{m+n}, so log⁡a(xy)=m+n=log⁡ax+log⁡ay\log_a(xy) = m + n = \log_a x + \log_a y.
  • The quotient: xy=aman=am−n\dfrac{x}{y} = \dfrac{a^m}{a^n} = a^{m-n}, so log⁡a ⁣(xy)=m−n=log⁡ax−log⁡ay\log_a\!\left(\dfrac{x}{y}\right) = m - n = \log_a x - \log_a y.
  • The power: xk=(am)k=amkx^k = (a^m)^k = a^{mk}, so log⁡a(xk)=mk=klog⁡ax\log_a(x^k) = mk = k\log_a x, for any kk, including k=−1k=-1 and k=−12k = -\tfrac12.
Proof by exhaustion

Split the claim into a finite number of cases and check every one. It works only when the cases can genuinely be listed.

Claim: n2+n+11n^2 + n + 11 is prime for n=1,2,3,4,5n = 1, 2, 3, 4, 5. The values are 13, 17, 23, 31 and 41, and each is prime, so the claim is proved for those five values. The same technique proves that the square of an integer leaves remainder 0 or 1 when divided by 4: an integer is either even, 2n2n, with square 4n24n^2, or odd, 2n+12n+1, with square 4n2+4n+14n^2+4n+1, and these two cases cover every integer.

Disproof by counter-example

One case that breaks a general statement disproves it. The claim "n2+n+11n^2 + n + 11 is prime for every positive integer nn" is false, because n=10n = 10 gives 100+10+11=121=112100 + 10 + 11 = 121 = 11^2. The claim "if a2>b2a^2 > b^2 then a>ba > b" is false, because a=−3a = -3, b=2b = 2 gives 9>49 > 4 but −3<2-3 < 2.

Showing that a statement holds for many values is not a proof. The statement above about n2+n+11n^2+n+11 holds for n=1n = 1 to 99 and still fails.

Implication symbols

SymbolMeaning
p⇒qp \Rightarrow qpp implies qq (if pp then qq)
p⇐qp \Leftarrow qpp is implied by qq (if qq then pp)
p⇔qp \Leftrightarrow qpp implies and is implied by qq, so they are equivalent
≡\equivis identical to: true for every value of the variable
∴\thereforetherefore
∵\becausebecause

An identity such as (x+1)2≡x2+2x+1(x+1)^2 \equiv x^2 + 2x + 1 holds for all xx, whereas an equation such as x2=4x^2 = 4 holds only for particular values. In solving an equation, two lines are connected by ⇔\Leftrightarrow only if the step can be reversed. Squaring both sides of x=3x = 3 gives x2=9x^2 = 9, which is an implication (⇒\Rightarrow) and not an equivalence, because x2=9x^2 = 9 also allows x=−3x = -3.

Sets and their notation

A set is a collection of distinct elements.

NotationMeaning
x∈Ax \in A, x∉Ax \notin Axx is, or is not, an element of AA
{x1,x2,… }\{x_1, x_2, \dots\}the set with these elements
{x:… }\{x : \dots\}the set of all xx such that …\dots
A⊆BA \subseteq BAA is a subset of BB
A⊂BA \subset BAA is a proper subset of BB (not equal to BB)
A∪BA \cup Bunion: elements in AA or BB or both
A∩BA \cap Bintersection: elements in both AA and BB
A′A'the complement of AA: the elements of the universal set not in AA
ε\varepsilonthe universal set
∅\varnothingthe empty set
n(A)n(A)the number of elements in AA

The standard number sets are N={1,2,3,… }\mathbb{N} = \{1, 2, 3, \dots\}, Z\mathbb{Z} for the integers, Z+\mathbb{Z}^+ for the positive integers, Q\mathbb{Q} for the rational numbers (those that can be written as a fraction pq\frac{p}{q} of integers) and R\mathbb{R} for the real numbers.

Intervals of real numbers are written with brackets, where a square bracket includes the end point and a round one excludes it: [a,b]={x∈R:a≤x≤b}[a,b] = \{x \in \mathbb{R} : a \le x \le b\}, [a,b)={x∈R:a≤x<b}[a,b) = \{x \in \mathbb{R} : a \le x < b\}, (a,b](a,b] likewise, and (a,b)(a,b) with neither end point.

Example. With ε={1,2,…,10}\varepsilon = \{1, 2, \dots, 10\}, A={2,4,6,8,10}A = \{2, 4, 6, 8, 10\} and B={3,6,9}B = \{3, 6, 9\}:

  • A∩B={6}A \cap B = \{6\} and A∪B={2,3,4,6,8,9,10}A \cup B = \{2, 3, 4, 6, 8, 9, 10\}, so n(A∪B)=7n(A \cup B) = 7;
  • A′={1,3,5,7,9}A' = \{1, 3, 5, 7, 9\};
  • A′∩B={3,9}A' \cap B = \{3, 9\}.

The same language describes solutions to inequalities. The solution of x2−x−6>0x^2 - x - 6 > 0 is x<−2x < -2 or x>3x > 3, which is the union {x:x<−2}∪{x:x>3}\{x : x < -2\} \cup \{x : x > 3\}. A solution that has to satisfy two conditions at once, such as x>2x > 2 and x<5x < 5, is an intersection, and is written 2<x<52 < x < 5. The words "and" and "or" correspond to intersection and union.

追加またはダウンロードすると、さらに52件あります。

レビュー

文章でのレビューはまだありません。このノートを自分のノートに追加して、最初のレビューを投稿できます。