WJEC A-Level Mathematics
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.
ما المحتوى؟
الملاحظة الأولى
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 2n, an odd number is 2n+1, and consecutive integers are n and n+1, where n is an integer.
Claim: the sum of two consecutive odd numbers is a multiple of 4.
Since n+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+1. Then (2n+1)2=4n2+4n+1=4n(n+1)+1. One of n and n+1 is even, so n(n+1) is even and 4n(n+1) is a multiple of 8.
The laws of logarithms are also proved by deduction, from the definition that x=an means n=logax (for a>0, x>0). Let x=am and y=an, so that logax=m and logay=n.
- The product: xy=am×an=am+n, so loga(xy)=m+n=logax+logay.
- The quotient: yx=anam=am−n, so loga(yx)=m−n=logax−logay.
- The power: xk=(am)k=amk, so loga(xk)=mk=klogax, for any k, including k=−1 and k=−21.
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+11 is prime for n=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, 2n, with square 4n2, or odd, 2n+1, with square 4n2+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+11 is prime for every positive integer n" is false, because n=10 gives 100+10+11=121=112. The claim "if a2>b2 then a>b" is false, because a=−3, b=2 gives 9>4 but −3<2.
Showing that a statement holds for many values is not a proof. The statement above about n2+n+11 holds for n=1 to 9 and still fails.
Implication symbols
| Symbol | Meaning |
|---|---|
| p⇒q | p implies q (if p then q) |
| p⇐q | p is implied by q (if q then p) |
| p⇔q | p implies and is implied by q, so they are equivalent |
| ≡ | is identical to: true for every value of the variable |
| ∴ | therefore |
| ∵ | because |
An identity such as (x+1)2≡x2+2x+1 holds for all x, whereas an equation such as x2=4 holds only for particular values. In solving an equation, two lines are connected by ⇔ only if the step can be reversed. Squaring both sides of x=3 gives x2=9, which is an implication (⇒) and not an equivalence, because x2=9 also allows x=−3.
Sets and their notation
A set is a collection of distinct elements.
| Notation | Meaning |
|---|---|
| x∈A, x∈/A | x is, or is not, an element of A |
| {x1,x2,…} | the set with these elements |
| {x:…} | the set of all x such that … |
| A⊆B | A is a subset of B |
| A⊂B | A is a proper subset of B (not equal to B) |
| A∪B | union: elements in A or B or both |
| A∩B | intersection: elements in both A and B |
| A′ | the complement of A: the elements of the universal set not in A |
| ε | the universal set |
| ∅ | the empty set |
| n(A) | the number of elements in A |
The standard number sets are N={1,2,3,…}, Z for the integers, Z+ for the positive integers, Q for the rational numbers (those that can be written as a fraction qp of integers) and 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∈R:a≤x<b}, (a,b] likewise, and (a,b) with neither end point.
Example. With ε={1,2,…,10}, A={2,4,6,8,10} and B={3,6,9}:
- A∩B={6} and A∪B={2,3,4,6,8,9,10}, so n(A∪B)=7;
- A′={1,3,5,7,9};
- A′∩B={3,9}.
The same language describes solutions to inequalities. The solution of x2−x−6>0 is x<−2 or x>3, which is the union {x:x<−2}∪{x:x>3}. A solution that has to satisfy two conditions at once, such as x>2 and x<5, is an intersection, and is written 2<x<5. The words "and" and "or" correspond to intersection and union.
و52 أخرى: افتح أياً منها من القائمة أعلاه.
التقييمات
لا توجد مراجعات مكتوبة بعد. أضف هذه الملاحظات إلى مجموعتك، ويمكنك أن تكون أول من يكتب مراجعة.