1.2 Number and algebra - AHL content

Syllabus
First assessment 2021
Topic
1.2
Level
HL

Count arrangements by deciding whether order matters

HL only

Count arrangements by deciding whether order matters.

Use the multiplication principle for sequential choices, permutations when order matters, and combinations when it does not.

Worked example
Choosing president and secretary from 5 uses 5P2=20; choosing a 2-person team uses 5C2=10.

Worked example
Does swapping two team members make a new team? no; use combinations.

Common boundary
Do not use permutations when the selected group has no roles.

Extended binomial form: for rational nn, (1+x)n=1+nx+n(n1)2!x2+n(n1)(n2)3!x3+(1+x)^n=1+nx+\frac{n(n-1)}{2!}x^2+\frac{n(n-1)(n-2)}{3!}x^3+\cdots. When nn is negative or fractional this is an infinite expansion valid for x<1|x|<1. For example, (1+x)1=1x+x2x3+(1+x)^{-1}=1-x+x^2-x^3+\cdots. This objective excludes circular arrangements, identical-object permutations and proof of the theorem.

Decompose a proper rational expression into partial fractions

HL only

Decompose a proper rational expression into partial fractions.

For distinct linear factors, write unknown numerators over each factor, clear denominators, then solve coefficients.

Worked example
(3x+5)/(x(x+2))=A/x+B/(x+2); substituting x=0 gives A=5/2.

Worked example
What condition must hold first? numerator degree is lower than denominator degree.

Common boundary
Partial fractions is not polynomial division unless the fraction is improper.

Complete the decomposition: 3x+5x(x+2)=Ax+Bx+2\frac{3x+5}{x(x+2)}=\frac{A}{x}+\frac{B}{x+2} gives 3x+5=A(x+2)+Bx3x+5=A(x+2)+Bx. Setting x=0x=0 gives A=5/2A=5/2; setting x=2x=-2 gives 1=2B-1=-2B, so B=1/2B=1/2. Therefore 3x+5x(x+2)=52x+12(x+2)\frac{3x+5}{x(x+2)}=\frac{5}{2x}+\frac{1}{2(x+2)}. Recombine the fractions to check the numerator.

Represent a complex number and read its geometry

HL only

Represent a complex number and read its geometry.

Write z=a+bi with i²=−1; Re(z)=a, Im(z)=b, modulus is distance from origin and conjugation reflects across the real axis.

Worked example
For z=3−4i, |z|=5 and its conjugate is 3+4i.

Worked example
What does conjugation change? the sign of the imaginary part only.

Common boundary
The modulus is not the imaginary part.

Argand and argument example: z=34iz=3-4i is the point (3,4)(3,-4) on the Argand diagram. Its modulus is z=32+(4)2=5|z|=\sqrt{3^2+(-4)^2}=5 and its principal argument is argz=tan1(4/3)53.13\arg z=\tan^{-1}(-4/3)\approx-53.13^\circ because the point lies in quadrant IV. Always use the quadrant, not inverse tangent alone, to select the argument.

Convert complex numbers between Cartesian and polar form

HL only

Convert complex numbers between Cartesian and polar form.

Polar form z=r(cosθ+i sinθ) separates magnitude r from direction θ; products multiply magnitudes and add arguments.

Worked example
(2 cis 30°)(3 cis 20°)=6 cis 50°.

Worked example
What happens to arguments when multiplying? add them, accounting for the chosen branch.

Common boundary
Do not add Cartesian coordinates when multiplying complex numbers.

Cartesian-to-polar/Euler example: for z=1+iz=1+i, r=12+12=2r=\sqrt{1^2+1^2}=\sqrt2 and θ=π/4\theta=\pi/4, so z=2cis(π/4)=2eiπ/4z=\sqrt2\,\mathrm{cis}(\pi/4)=\sqrt2e^{i\pi/4}. Products multiply moduli and add arguments; quotients divide moduli and subtract arguments. Vector addition is performed most directly in Cartesian form.

Use De Moivre to find powers and roots

HL only

Use De Moivre to find powers and roots.

De Moivre gives (r cisθ)ⁿ=rⁿ cis(nθ); roots share magnitude r^(1/n) and differ by 2π/n in argument.

Worked example
The cube roots of 8 include arguments 0, 120° and 240°, all with modulus 2.

Worked example
Why are there n roots? rotating by 2π/n gives distinct solutions.

Common boundary
Taking only the principal root misses the other roots.

Two required extensions: if a polynomial PP has real coefficients and P(c)=0P(c)=0, then P(c)=P(c)=0P(\overline c)=\overline{P(c)}=0, so non-real roots occur in conjugate pairs. For positive integers, prove De Moivre by induction: the n=1n=1 case is immediate; assuming (cisθ)k=cis(kθ)(\mathrm{cis}\,\theta)^k=\mathrm{cis}(k\theta), multiply by cisθ\mathrm{cis}\,\theta and use angle addition to obtain cis((k+1)θ)\mathrm{cis}((k+1)\theta). This completes the inductive step.

Choose induction or contradiction to prove a claim

HL only

Choose induction or contradiction to prove a claim.

Induction proves a statement for all integers by a base case plus an implication from k to k+1; contradiction assumes the claim is false and derives impossibility.

Worked example
For 1+2+…+n=n(n+1)/2, verify n=1, then assume k and prove k+1.

Worked example
What must induction include besides the algebra? a valid base case and the inductive link.

Common boundary
Checking several values is not induction.

Contradiction example: assume 2=p/q\sqrt2=p/q in lowest terms. Then p2=2q2p^2=2q^2, so pp is even; writing p=2kp=2k shows qq is also even, contradicting lowest terms. Counterexample example: the claim 'there are no positive integer solutions to x2+y2=10x^2+y^2=10' is false because (x,y)=(1,3)(x,y)=(1,3) gives 12+32=101^2+3^2=10. State exactly which universal claim the example violates.

Classify and solve a linear system

HL only

Classify and solve a linear system.

Row reduction or technology reveals whether equations meet at one point, share a line/plane, or conflict; classify before reporting a solution.

Worked example
x+y=2 and 2x+2y=4 have infinitely many solutions because the equations are dependent.

Worked example
What signals no solution? a contradictory row such as 0=1.

Common boundary
Three equations do not guarantee a unique solution.

Three-equation example: solve x+y+z=6x+y+z=6, 2xy+z=32x-y+z=3, and x+2yz=2x+2y-z=2. Subtracting the first equation from the second gives x2y=3x-2y=-3; subtracting it from the third gives y2z=4y-2z=-4. Hence x=2y3x=2y-3, y=2z4y=2z-4, and substitution into the first equation gives 7z=217z=21. Therefore (x,y,z)=(1,2,3)(x,y,z)=(1,2,3), a unique solution; substitution checks all three equations.

Objective notes

7 learning objectives
AHL 1.10 (HL)—Counting and extended binomial theorem• Use counting principles, permutations and combinations.• Extend binomial expansion to fractional and negative indices.• Exclude identical-object permutations, circular arrangements and proof of the theorem.ViewAHL 1.11 (HL)—Partial fractions• Decompose rational expressions into partial fractions.• Denominators have at most two distinct linear terms; numerator degree is lower than denominator degree.ViewAHL 1.12 (HL)—Complex numbers• Use i where i^2 = -1 and Cartesian form z=a+bi.• Know real/imaginary parts, conjugate, modulus, argument and the Argand diagram.ViewAHL 1.13 (HL)—Polar and Euler forms• Use polar form z=r(cos theta + i sin theta)=r cis theta and Euler form z=re^(i theta).• Convert between Cartesian, polar and Euler forms; interpret sums, products and quotients geometrically.ViewAHL 1.14 (HL)—Complex roots and De Moivre's theorem• Know complex conjugate roots of real-coefficient polynomial equations.• Use De Moivre's theorem for powers and roots of complex numbers.• Include induction proof for positive integer powers; be aware of rational exponent extension.ViewAHL 1.15 (HL)—Advanced proof• Use proof by mathematical induction and proof by contradiction.• Use counterexamples to disprove statements, with explanation of why the counterexample works.ViewAHL 1.16 (HL)—Systems of linear equations• Solve up to three linear equations in three unknowns algebraically and with technology.• Identify unique, infinite or no solutions; find general solutions where appropriate.View