Unit P2: Pure Mathematics AS 2
- Syllabus
- 2019
- Section
- —
- Level
- AS
A mathematical proof starts from stated assumptions and uses valid logical steps to show that the conclusion must follow for every object in the stated domain.
| Stage | What it must establish |
|---|---|
| assumptions | domain, definitions and given conditions |
| representation | a general form such as 2k for an even integer or 2k+1 for an odd integer |
| logical steps | equalities or implications justified without assuming the result |
| conclusion | the exact claim, with its domain or condition retained |
To prove 2x2+8≥8x for every real x, move everything to one side: 2x2−8x+8=2(x−2)2. Because a real square is non-negative, 2(x−2)2≥0, so the stated inequality follows for every real x.
When multiplying, dividing, taking roots or cancelling factors, state the condition that makes the step valid. For example, dividing an inequality by a positive quantity preserves its direction; dividing by a quantity of unknown sign does not.
Checking several values can suggest a universal statement but cannot prove it. Avoid circular reasoning: the required conclusion may appear only after it has been derived from the assumptions.
Proof by exhaustion works when the allowed possibilities can be divided into a finite, complete set of cases. Each case must be checked, and the cases must leave no allowed value uncovered.
| Situation | Exhaustive cases |
|---|---|
| parity of an integer | n=2k or n=2k+1 |
| remainder after division by 3 | n=3k, 3k+1 or 3k+2 |
| single-digit primes | 2,3,5,7 |
To prove n2+n is even for every integer n, exhaust the two parity cases. If n=2k, then n2+n=2k(2k+1), which has a factor 2. If n=2k+1, then n2+n=(2k+1)(2k+2)=2(2k+1)(k+1), also even. Every integer is even or odd, so the proof is complete.
For a literal finite set, the single-digit primes are exactly 2,3,5,7. The values of p2+p are respectively 6,12,30,56, all even. Naming the complete allowed set is what turns these checks into a proof.
Trying a few convenient examples is not exhaustion. State why the cases are mutually sufficient, evaluate every case under the same claim, and finish with a conclusion covering the original domain.
A universal claim says a conclusion holds for every allowed input. To disprove it, one counterexample is enough: choose an input that satisfies the claim's conditions but makes its conclusion false.
| Counterexample requirement | Evidence to show |
|---|---|
| allowed input | the chosen value belongs to the stated domain |
| failed conclusion | substitution gives a result that contradicts the claim |
| explicit verdict | identify the value as a counterexample and state that the universal claim is false |
Consider the claim ‘n2−n+1 is prime for every positive integer n’. Take n=5, which is in the stated domain. Then 52−5+1=21=3×7, so the result is composite. Therefore n=5 is a counterexample and the universal claim is false.
A useful search targets values likely to expose the weakness, but the final disproof must show the calculation and the failed property. A valid counterexample need not be the smallest one.
One successful example cannot prove a statement about all inputs, while one genuine failure can disprove it. An input outside the stated domain or a value that still satisfies the conclusion is not a counterexample.
Dividing a polynomial f(x) by a linear expression gives a quotient Q(x) and constant remainder R. One identity connects the calculation to both the Remainder and Factor Theorems.
f(x)=(ax+b)Q(x)+R
| Divisor | Input that makes it zero | Remainder / factor test |
|---|---|---|
| x−c | c | remainder f(c); factor iff f(c)=0 |
| ax−b | b/a | remainder f(b/a); factor iff f(b/a)=0 |
| ax+b | −b/a | remainder f(−b/a); factor iff f(−b/a)=0 |
For long division, order descending powers and insert zero coefficients for missing terms. Divide the leading terms, multiply the whole divisor by the new quotient term, subtract, and repeat until the remainder is constant. Verify with dividend = divisor × quotient + remainder.
For f(x)=2x3+x2−7x+2, division by x−2 gives f(x)=(x−2)(2x2+5x+3)+8. The theorem check agrees: f(2)=16+4−14+2=8, so x−2 is not a factor.
For g(x)=2x3−3x2−8x+12, g(2)=0, so x−2 is a factor. Division gives 2x2+x−6=(2x−3)(x+2); hence g(x)=(x−2)(2x−3)(x+2).
Use the zero of the entire divisor: for ax−b it is b/a, not b. A zero remainder proves a factor; a non-zero remainder does not. This P2 scope requires division only by linear expressions ax±b.
A circle is the set of points a fixed distance r from its centre (a,b). Its coordinate equation records that distance using Pythagoras:
(x−a)2+(y−b)2=r2
Read the centre as (a,b) and the radius as the positive square root of the right-hand side. The signs inside the brackets are reversed. To build an equation, substitute the known centre and radius; if a diameter's endpoints are known, its midpoint is the centre and half its length is the radius.
For x2+y2−6x+4y−12=0, move the constant and add 9 and 4 to both sides: x2−6x+9+y2+4y+4=12+9+4, so (x−3)2+(y+2)2=25. Thus the centre is (3,−2) and the radius is 5.
| Circle property | Coordinate-geometry use |
|---|---|
| If AB is a diameter and C is on the circle, ∠ACB=90∘ | prove or use a right angle |
| A perpendicular from the centre to a chord bisects the chord | locate a chord midpoint or centre |
| The radius OP is perpendicular to the tangent at P | find a tangent or normal gradient |
In the example, P=(7,1) lies on the circle because 42+32=25. The radius CP has gradient 3/4, so the tangent gradient is −4/3 and its equation is y−1=−34(x−7).
Do not read r directly from r2, or copy the bracket signs into the centre. The radius-tangent rule applies at the point of contact; perpendicular non-vertical gradients satisfy m1m2=−1.
A sequence is an ordered list whose position matters. A rule can give a term directly from its position, or generate each term from the previous one.
| Rule type | What must be given | How a term is found |
|---|---|---|
| Explicit: un=f(n) | the formula and term number n | substitute n directly |
| Recursive: xn+1=f(xn) | the recurrence and a starting value | calculate earlier terms in order |
For un=3n−1, the sequence begins 2,5,8,11,… and u7=3(7)−1=20 without finding terms 5 or 6.
For x1=2 and xn+1=xn2−1, x2=3,x3=8,x4=63. Each input is the preceding term, so the starting value is part of the definition.
Keep the indices aligned: xn+1 is the next term produced from xn. Do not replace xn by n, or apply a recurrence without its required starting value.
An arithmetic sequence has a constant difference d. Starting from first term a, moving to term n adds d exactly n−1 times.
un=a+(n−1)d,Sn=2n(2a+(n−1)d)=2n(a+l)
The sum formula follows by writing the same finite sum forwards and backwards: Sn=a+(a+d)+⋯+[a+(n−1)d], Sn=[a+(n−1)d]+⋯+(a+d)+a. Each of the n paired columns totals 2a+(n−1)d, so doubling and then halving gives the formula.
Sigma notation compresses an addition: ∑r=1nur means u1+u2+⋯+un. Setting a=1,d=1 gives 1+2+⋯+n=2n(n+1).
For 7,11,15,…, a=7 and d=4. Thus u20=83 and S20=220(7+83)=900.
Term n uses n−1 differences. In a finite sum, identify the number of terms before substituting; it is not automatically the value of the final term.
Classify a sequence by comparing consecutive terms or by identifying an exact repeating cycle.
| Type | Test |
|---|---|
| Strictly increasing | un+1>un for every relevant n |
| Strictly decreasing | un+1<un for every relevant n |
| Periodic with period p | un+p=un; the order is the smallest positive such p |
For an explicit sequence, inspect un+1−un: a value always positive proves increasing, while one always negative proves decreasing. For un=n2+1, un+1−un=2n+1>0 for positive integer n, so the sequence is increasing.
The sequence 4,43,−31,4,43,−31,… repeats every three terms, so it is periodic of order 3. With a one-step deterministic recurrence, returning to an earlier value makes the same following cycle repeat.
A few rising or falling terms do not prove the pattern continues. Equality also fails the strict tests; and a stated period is not the order if a smaller positive period works.
A geometric sequence multiplies by the same common ratio r each time. With first term a, its terms and finite sum are
un=arn−1,Sn=1−ra(1−rn)(r=1)
Write Sn=a+ar+⋯+arn−1 and multiply by r. Subtracting rSn from Sn cancels the middle terms, leaving (1−r)Sn=a−arn, which gives the finite-sum formula.
Only when ∣r∣<1 does rn→0, so only then does the geometric sum converge to S∞=1−ra. A negative ratio may converge while the terms alternate signs.
For a=5,r=0.8, requiring Sn>24 gives 25(1−0.8n)>24, hence 0.8n<0.04. Therefore n>log(0.8)log(0.04)≈14.43, so the smallest integer is 15.
Use arn−1 for term n, not arn. Never use S∞ unless ∣r∣<1; when solving an inequality with 0<r<1, dividing by logr<0 reverses its direction.
For a positive integer n, the binomial theorem gives every term of (a+bx)n without repeated multiplication.
(a+bx)n=r=0∑n(rn)an−r(bx)r,(rn)=r!(n−r)!n!
Here n!=n(n−1)⋯2⋅1 and 0!=1. The index r is the power of x, so choosing r=0,1,2,… produces terms in ascending powers.
For (2−3x)4, (2−3x)4==24+(14)23(−3x)+(24)22(−3x)2+(34)2(−3x)3+(−3x)416−96x+216x2−216x3+81x4.
The sign belongs inside (bx)r: odd powers keep a negative sign and even powers become positive. This formula here is restricted to positive integer n and terminates after n+1 terms.
In y=ax, the variable is in the exponent. The restrictions a>0 and a=1 give a real exponential curve rather than a sign-changing or constant rule.
y=ax,a>0, a=1
| Base | Left-to-right behaviour | End behaviour |
|---|---|---|
| a>1 | increasing | y→0 as x→−∞; y→∞ as x→∞ |
| 0<a<1 | decreasing | y→∞ as x→−∞; y→0 as x→∞ |
Every permitted base gives a0=1, so the graph crosses the y-axis at (0,1). Its domain is all real x, its range is y>0, and y=0 is a horizontal asymptote: the curve approaches but never meets the x-axis.
Known graph transformations preserve this structure. For y=3⋅2x+4, the y-intercept is (0,7), the horizontal asymptote is y=4, and the curve is increasing above that line.
Do not draw an x-intercept for y=ax. A vertical shift changes the horizontal asymptote, while a=1 would give the excluded constant graph y=1.
A logarithm is an exponent: logax=y means ay=x. Therefore a>0, a=1, and every logarithm argument must be positive.
loga(xy)loga(x/y)loga(xk)loga(1/x)logaa=logax+logay,=logax−logay,=klogax,=−logax,=1.
These laws are the index laws read through the inverse operation: multiplying powers adds exponents, dividing subtracts them, and raising a power multiplies its exponent.
Solve log2(x−1)+log2(x−3)=3. The domain requires x>3. Combining gives log2[(x−1)(x−3)]=log28, so (x−1)(x−3)=8 and (x−5)(x+1)=0. Only x=5 satisfies the domain.
The arguments x, y, xy, or x/y must be positive wherever their logarithms appear. Algebra can create candidate roots outside that domain, so check every final value in the original expression.
To solve ax=b, apply a logarithm to both sides. The power law moves the unknown exponent in front, where ordinary algebra can isolate it.
ax=b⟹xlogca=logcb⟹x=logcalogcb=logab
This requires a>0, a=1, and b>0. The change-of-base formula allows any convenient valid base c, commonly 10 or e.
For 52x−1=17, take natural logarithms: (2x−1)ln5=ln17. Hence x=21(1+ln5ln17)≈1.380. Substitution restores 52x−1=17, providing a check.
First isolate the exponential expression, then take logs of both complete sides. Do not write log(ax)=logax ambiguously, and keep full calculator precision until the final rounding.
A trigonometric identity is true for every angle where both sides are defined. These two identities let you replace one function by another without changing the relationship.
tanθ=cosθsinθ(cosθ=0),sin2θ+cos2θ=1
Useful rearrangements are sin2θ=1−cos2θ and cos2θ=1−sin2θ. Choose the version that leaves only one trigonometric function.
If cosθ=−53 and 2π<θ<π, then sin2θ=1−259=2516. Sine is positive in this interval, so sinθ=54 and tanθ=−34. The identity gives the magnitude; the interval determines the sign.
For example, 8tanθ=3cosθ becomes 8sinθ=3cos2θ=3(1−sin2θ), hence 3sin2θ+8sinθ−3=0.
Do not take a square root without choosing its sign from the angle interval. Also retain cosθ=0 whenever the tangent identity is used.
A trigonometric equation is complete only when every valid branch in the stated interval has been found. Keep the angle unit and interval visible throughout.
Use this sequence: rewrite in one trigonometric function; factor or solve the resulting algebraic equation; reject values outside the function's range; generate every periodic angle; undo any shift or multiple; then apply the original endpoints.
| Equation for u | Degree solutions | Radian solutions |
|---|---|---|
| sinu=k | u=α+360∘n or 180∘−α+360∘n | u=α+2πn or π−α+2πn |
| cosu=k | u=±α+360∘n | u=±α+2πn |
| tanu=k | u=α+180∘n | u=α+πn |
Here n∈Z and α is the appropriate inverse-trigonometric value. If u=2x or u=x+2π, solve over the corresponding u-interval before converting back to x.
Solve 6cos2x+sinx−5=0 for 0≤x<360∘. Let s=sinx: 6(1−s2)+s−5=0⟹(3s+1)(2s−1)=0. Thus sinx=21 or sinx=−31, giving x=30∘, 150∘, 199.5∘, 340.5∘ to one decimal place where needed.
Do not divide by a trigonometric factor before preserving its zero branch. Match calculator mode to degrees or radians, and include an endpoint only when the stated inequality includes it.
The derivative f′(x) is the gradient of a curve. Its sign tells whether the function rises or falls, while a stationary point is a point where f′(x)=0.
f′(x)>0⇒f increasing,f′(x)<0⇒f decreasing
| Sign of f′ around x=c | Stationary-point type |
|---|---|
| positive then negative | local maximum |
| negative then positive | local minimum |
| no sign change | stationary point of inflection |
When f′(c)=0, the second derivative gives a quick local test: f′′(c)<0 indicates a maximum and f′′(c)>0 a minimum. If f′′(c)=0, this test is inconclusive, so use the sign of f′.
For f(x)=x3−3x2−9x+5, f′(x)=3(x+1)(x−3). Thus the stationary points are (−1,10) and (3,−22). The derivative is positive for x<−1, negative for −1<x<3, and positive for x>3; therefore the first point is a local maximum and the second a local minimum.
For a curve sketch, combine stationary coordinates and increasing/decreasing intervals with intercepts and end behaviour. In a practical optimisation on a restricted domain, compare the objective value at every feasible stationary point and included endpoint, then state the maximum or minimum with its units and context.
The equation f′(x)=0 finds candidates, not automatically extrema. A stationary inflection is possible, and an endpoint can give the global optimum even though its derivative is not zero.
A definite integral gives the accumulated signed value of a function between two bounds. First find an antiderivative F with F′(x)=f(x), then evaluate upper bound minus lower bound.
∫abf(x)dx=[F(x)]ab=F(b)−F(a)
For example, ∫13(2x2−4x+5)dx=[32x3−2x2+5x]13=15−311=334. Write the substitution line before simplifying; this makes the order of subtraction visible.
Reversing the bounds changes the sign: ∫baf(x)dx=−∫abf(x)dx. Adjacent intervals add, so ∫acf=∫abf+∫bcf; this can reveal a missing integral without integrating again.
Do not subtract lower minus upper, and do not leave +C in a definite answer. Any constants of integration would cancel in F(b)−F(a).
A definite integral is signed, but geometric area is non-negative. Sketch or compare the boundaries first, find their intersections, and integrate the vertical height of the region with respect to x.
A=∫ab(upper y− lower y)dx
The curves y=6x−x2 and y=2x meet where 6x−x2=2x, so x=0 or x=4. Between these values the quadratic is above the line. Hence A=∫04[(6x−x2)−2x]dx=[2x2−3x3]04=332.
| Region | Integrand |
|---|---|
| curve above the x-axis | y |
| curve below the x-axis | −y |
| between y=f(x) and y=g(x) | upper function − lower function |
If the upper boundary changes, or a curve crosses the x-axis inside the region, split the integral at that x-value and make each piece positive. Straight-line boundaries are handled by the same upper-minus-lower rule.
Solving for intersections supplies the limits; it does not supply the area. Do not integrate lower minus upper and then report a negative geometric area. This objective uses vertical strips and dx; ∫xdy is outside the required scope.
The trapezium rule replaces a curve by straight chords over equal-width strips. With n strips from a to b, calculate the width and list all n+1 ordinates before applying the endpoint weights.
h=nb−a,Tn=2h[y0+yn+2(y1+⋯+yn−1)]
For ∫012x+1dx with four strips:
| x | 0 | 0.25 | 0.50 | 0.75 | 1.00 |
|---|---|---|---|---|---|
| y | 1.0000 | 1.2247 | 1.4142 | 1.5811 | 1.7321 |
Here h=0.25, so T4=20.25{1.0000+1.7321+2(1.2247+1.4142+1.5811)}≈1.3965. Keep extra calculator digits until the final rounding.
More strips make h smaller and usually improve the approximation. If a trusted exact or more accurate value is available, the estimated absolute error is the absolute difference from the trapezium estimate. The chord picture also explains direction: chords below the curve give an underestimate; chords above it give an overestimate.
There are n+1 ordinates for n strips. Count each endpoint once and each interior ordinate twice; do not use unequal x-spacing in this formula, and do not round table values too early.