AQA A-Level Mathematics
cookie 製作的考試準備筆記,共 44 篇,分為 3 個部分,依照課程主題編排。
Notes for AQA A-level Mathematics (7357), in folders for the three parts of the specification's content in its order: pure mathematics, statistics and mechanics. Pure mathematics is split into its topic areas, and each note has definitions, results, methods and worked examples for one topic. Delete any folder or note you don't need once the notes are yours.
內容
第一則筆記
Pure mathematics / Proof and algebra / Proof
Notation and language
A mathematical argument is built from precise statements joined by connecting words, so the symbols need to be used exactly. The symbol ⇒ means "implies": x=3⇒x2=9 is true, but the reverse is not, because x could be −3. The symbol ⇔ means "implies and is implied by", so that 2x=6⇔x=3. The symbol ≡ marks an identity, which is true for every value of the variable, while = in an equation is true only for particular values. The symbol ∴ means "therefore".
Set notation is used for solutions, inequalities and probability.
| Symbol | Meaning |
|---|---|
| x∈A | x is an element of the set A |
| A⊂B | A is a subset of B |
| A∪B | union: in A or in B or in both |
| A∩B | intersection: in both A and B |
| A′ | the complement of A: everything in the universal set not in A |
| ∅ | the empty set |
| {x:x>2} | the set of all x such that x>2 |
| N, Z, Q, R | natural numbers, integers, rational numbers, real numbers |
The solution of x2>4 can be written x<−2 or x>2, or as the set {x:x<−2}∪{x:x>2}. The solution of 2<x<5 is the intersection {x:x>2}∩{x:x<5}. "And" corresponds to an intersection and "or" to a union.
A rational number can be written as qp with p and q integers and q=0. An irrational number cannot. An even integer has the form 2k and an odd integer has the form 2k+1, where k is an integer.
Proof by deduction
A proof by deduction starts from known facts or definitions and moves by logical steps to the result, so the result is true for every case at once. Algebra is the usual tool, because a letter stands for any number of the right type.
Show that the sum of two consecutive odd numbers is a multiple of 4. Write the odd numbers as 2k+1 and 2k+3, where k is an integer. Their sum is
and since k+1 is an integer, the sum is a multiple of 4.
Show that n3−n is divisible by 6 for every integer n. Factorising gives n3−n=n(n−1)(n+1)=(n−1)n(n+1), which is the product of three consecutive integers. Among any three consecutive integers at least one is even and exactly one is a multiple of 3, so the product is divisible by 2 and by 3, and therefore by 6.
A proof needs a final statement that says what has been shown, and every step must follow from the one before. Checking a few numerical cases does not prove a general result.
Proof by exhaustion
Proof by exhaustion splits the possibilities into a finite number of cases and checks each one. It only works when the cases really do cover everything.
To show that the square of an integer is never one less than a multiple of 3, let n be any integer. Then n is of the form 3k, 3k+1 or 3k+2, and
So every square leaves remainder 0 or 1 when divided by 3, and never remainder 2, which is the remainder of a number one less than a multiple of 3.
Disproof by counter-example
To show a statement is false it is enough to find one case where it fails. This is a counter-example, and it should be checked and stated clearly.
The statement "n2+n+11 is prime for every positive integer n" is false, because for n=11 the value is 121+11+11=143=11×13. The statement "if a2>b2 then a>b" is false, because a=−5 and b=3 give 25>9 but −5<3.
Proof by contradiction
In a proof by contradiction, assume the statement is false, follow the consequences logically, and reach something impossible. The assumption must then be wrong, so the statement is true.
The square root of 2 is irrational
Assume 2 is rational, so 2=qp where p and q are integers with no common factor (the fraction is in its lowest terms). Squaring gives 2=q2p2, so p2=2q2. Then p2 is even, so p is even, because the square of an odd number is odd. Write p=2m. Then 4m2=2q2, so q2=2m2, and q2 is even, so q is even. Now p and q are both even, which contradicts the assumption that they have no common factor. So 2 is irrational.
There are infinitely many primes
Assume there are finitely many primes, and list them all as p1,p2,…,pn. Form the number N=p1p2⋯pn+1. When N is divided by any pi the remainder is 1, so no prime in the list divides N. But N is either prime or has a prime factor, and in both cases there is a prime that is not in the list. This contradicts the assumption, so there are infinitely many primes.
Unfamiliar proofs
The same pattern can be applied to a new statement. To show that there is no smallest positive rational number, assume r is the smallest. Then 2r is a smaller positive rational number, which contradicts the assumption.
To show that there are no integers a and b with a2−b2=2, assume there are. The left side factorises as (a−b)(a+b). The two factors a−b and a+b differ by 2b, which is even, so they are both even or both odd. If both are odd their product is odd, and if both are even their product is a multiple of 4. Neither can equal 2, so there are no such integers.
Choosing a method
Deduction is the default for a general result about all integers or all values of a variable. Exhaustion suits a statement that splits into a small number of cases, such as remainders or signs. A single counter-example settles a claim that something is always true. Contradiction suits a statement of the form "there is no…" or "this number is irrational", where assuming the opposite gives something concrete to work with.
還有 43 個:可以從上方清單開啟任何一個。
評分
還沒有文字評論。把這些筆記加到自己的筆記中,就能成為第一個留下評論的人。