انتقل إلى المحتوى
cookie

AQA A-Level Mathematics

A-Level · AQAMathematics44 ملاحظة في 10 مجلدات، 217 KB

44 ملاحظات للمذاكرة، أعدّها cookie، في 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 ⇒\Rightarrow means "implies": x=3⇒x2=9x = 3 \Rightarrow x^2 = 9 is true, but the reverse is not, because xx could be −3-3. The symbol ⇔\Leftrightarrow means "implies and is implied by", so that 2x=6⇔x=32x = 6 \Leftrightarrow x = 3. The symbol ≡\equiv marks an identity, which is true for every value of the variable, while == in an equation is true only for particular values. The symbol ∴\therefore means "therefore".

Set notation is used for solutions, inequalities and probability.

SymbolMeaning
x∈Ax \in Axx is an element of the set AA
A⊂BA \subset BAA is a subset of BB
A∪BA \cup Bunion: in AA or in BB or in both
A∩BA \cap Bintersection: in both AA and BB
A′A'the complement of AA: everything in the universal set not in AA
∅\varnothingthe empty set
{x:x>2}\{x : x > 2\}the set of all xx such that x>2x > 2
N\mathbb{N}, Z\mathbb{Z}, Q\mathbb{Q}, R\mathbb{R}natural numbers, integers, rational numbers, real numbers

The solution of x2>4x^2 > 4 can be written x<−2x < -2 or x>2x > 2, or as the set {x:x<−2}∪{x:x>2}\{x : x < -2\} \cup \{x : x > 2\}. The solution of 2<x<52 < x < 5 is the intersection {x:x>2}∩{x:x<5}\{x : x > 2\} \cap \{x : x < 5\}. "And" corresponds to an intersection and "or" to a union.

A rational number can be written as pq\frac{p}{q} with pp and qq integers and q≠0q \neq 0. An irrational number cannot. An even integer has the form 2k2k and an odd integer has the form 2k+12k + 1, where kk 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+12k + 1 and 2k+32k + 3, where kk is an integer. Their sum is

(2k+1)+(2k+3)=4k+4=4(k+1), (2k + 1) + (2k + 3) = 4k + 4 = 4(k + 1),

and since k+1k + 1 is an integer, the sum is a multiple of 4.

Show that n3−nn^3 - n is divisible by 6 for every integer nn. Factorising gives n3−n=n(n−1)(n+1)=(n−1) n (n+1)n^3 - 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 nn be any integer. Then nn is of the form 3k3k, 3k+13k + 1 or 3k+23k + 2, and

(3k)2=9k2=3(3k2),(3k+1)2=9k2+6k+1=3(3k2+2k)+1,(3k+2)2=9k2+12k+4=3(3k2+4k+1)+1. (3k)^2 = 9k^2 = 3(3k^2), \qquad (3k+1)^2 = 9k^2 + 6k + 1 = 3(3k^2 + 2k) + 1, \qquad (3k+2)^2 = 9k^2 + 12k + 4 = 3(3k^2 + 4k + 1) + 1.

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+11n^2 + n + 11 is prime for every positive integer nn" is false, because for n=11n = 11 the value is 121+11+11=143=11×13121 + 11 + 11 = 143 = 11 \times 13. The statement "if a2>b2a^2 > b^2 then a>ba > b" is false, because a=−5a = -5 and b=3b = 3 give 25>925 > 9 but −5<3-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\sqrt{2} is rational, so 2=pq\sqrt{2} = \frac{p}{q} where pp and qq are integers with no common factor (the fraction is in its lowest terms). Squaring gives 2=p2q22 = \frac{p^2}{q^2}, so p2=2q2p^2 = 2q^2. Then p2p^2 is even, so pp is even, because the square of an odd number is odd. Write p=2mp = 2m. Then 4m2=2q24m^2 = 2q^2, so q2=2m2q^2 = 2m^2, and q2q^2 is even, so qq is even. Now pp and qq are both even, which contradicts the assumption that they have no common factor. So 2\sqrt{2} is irrational.

There are infinitely many primes

Assume there are finitely many primes, and list them all as p1,p2,…,pnp_1, p_2, \ldots, p_n. Form the number N=p1p2⋯pn+1N = p_1 p_2 \cdots p_n + 1. When NN is divided by any pip_i the remainder is 1, so no prime in the list divides NN. But NN 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 rr is the smallest. Then r2\frac{r}{2} is a smaller positive rational number, which contradicts the assumption.

To show that there are no integers aa and bb with a2−b2=2a^2 - b^2 = 2, assume there are. The left side factorises as (a−b)(a+b)(a - b)(a + b). The two factors a−ba - b and a+ba + b differ by 2b2b, 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 أخرى: افتح أياً منها من القائمة أعلاه.

التقييمات

لا توجد مراجعات مكتوبة بعد. أضف هذه الملاحظات إلى مجموعتك، ويمكنك أن تكون أول من يكتب مراجعة.