Question: The cubic f(x)=x3−3x2+4x−2 has roots α,β,γ where α=1 is a root. (a) Verify that α=1 is a root and factorise f(x). (b) Find β and γ. (c) Calculate α2+β2+γ2 without finding β and γ individually. (d) Find a cubic with roots 2α,2β,2γ.
Question: (a) Express (x+1)(x−2)22x+3 in partial fractions. (b) Find ∑r=1nr(r+1)1. (c) Find ∑r=1nr2. (d) Use the method of differences to find ∑r=1nr(r+2)1.
Question: If α,β,γ are the roots of x3+px+q=0: (a) express α3+β3+γ3 in terms of p and q. (b) express α2β+αβ2+α2γ+αγ2+β2γ+βγ2 in terms of p and q. (c) If q=−8 and α3+β3+γ3=0Find p. (d) Explain the relationship between these identities and symmetric functions.
(c) If q=−8: α3+β3+γ3=−3(−8)=24. If this equals 0, then 24=0Which is impossible. So no such p exists. The conditions are inconsistent.
(d) These are Newton’s identities connecting power sums sk=∑αik with elementary symmetric polynomials ek. For a cubic with zero x2 term: s_1 = e_1 = 0$$s_2 = e_1^2 - 2e_2 = -2p$$s_3 = e_1^3 - 3e_1e_2 + 3e_3 = -3q. These identities generalize to polynomials of any degree.
IT-2: Series and Induction Combined (with Calculus)
Question: (a) Prove by induction that ∑r=1nr(r+1)(r+2)1=4(n+1)(n+2)n(n+3). (b) Hence find ∑r=1∞r(r+1)(r+2)1. (c) Use the standard expansion of 1−x1 to find the Maclaurin series of (1−x)31. (d) Verify the result by differentiating the series for (1−x)21.
Solution:
(a) Base case (n=1): LHS =1⋅2⋅31=61. RHS =4⋅2⋅31⋅4=61. ✓.
Hypothesis: Assume true for n=k.
Step: For n=k+1: ∑r=1k+1r(r+1)(r+2)1=4(k+1)(k+2)k(k+3)+(k+1)(k+2)(k+3)1=4(k+1)(k+2)(k+3)k(k+3)2+4=4(k+1)(k+2)(k+3)k3+6k2+9k+4=4(k+1)(k+2)(k+3)(k+1)2(k+4)=4(k+2)(k+3)(k+1)(k+4).
This equals 4((k+1)+1)((k+1)+2)(k+1)((k+1)+3)Which is the formula with n=k+1. Proven.
(b) limn→∞4(n+1)(n+2)n(n+3)=41. So ∑r=1∞r(r+1)(r+2)1=41.
Question: (a) If M=(acbd) satisfies M2=IShow that a2+bc=1. (b) Find all 2×2 matrices with integer entries satisfying M2=I. (c) The trace of M is tr(M)=a+d. What relationship must the trace satisfy for M2=I? (d) How many such matrices exist with entries in {0,1,−1}?
Solution:
(a) M2=(a2+bcac+cdab+bdbc+d2)=(1001). So a^2 + bc = 1$$b(a+d) = 0$$c(a+d) = 0$$bc + d^2 = 1.
(b) From a2+bc=1 and d2+bc=1: a2=d2So d=±a.
Case 1: d=a. Then b(a+a)=2ab=0 and c(a+a)=2ac=0. So either a=0 or b=c=0.
If a=0: bc=1So (b,c)=(1,1) or (−1,−1). Matrices: \begin{pmatrix}0&1\\1&0\end{pmatrix}$$\begin{pmatrix}0&-1\\-1&0\end{pmatrix}.
If a=0: b = c = 0$$a^2 = 1$$a = \pm 1. Matrices: ±I.
Case 2: d=−a. Then b(a−a)=0 and c(a−a)=0 (always satisfied). Need a2+bc=1. With integer entries and ∣a∣,∣b∣,∣c∣≤1: if a=0: bc=1Same as above. If a=1: bc=0. If a=−1: bc=0.
a=1,d=−1,bc=0: (b,c)=(0,0),(1,0),(−1,0),(0,1),(0,−1). But b and c must be in {−1,0,1}. Matrices: \begin{pmatrix}1&0\\0&-1\end{pmatrix}$$\begin{pmatrix}1&1\\0&-1\end{pmatrix}$$\begin{pmatrix}1&-1\\0&-1\end{pmatrix}$$\begin{pmatrix}1&0\\1&-1\end{pmatrix}$$\begin{pmatrix}1&0\\-1&-1\end{pmatrix}.
a=−1,d=1: similarly, 5 matrices with (−1,1) diagonal.
(c) From M2=I: det(M)2=1So det(M)=±1. Also tr(M)=a+d. From d=±a: tr=2a or tr=0. If d=a: tr=2a∈{−2,0,2}. If d=−a: tr=0. So tr(M)∈{−2,0,2}.
(d) From case 1 (d = a): 2\mathbf{I}$$-2\mathbf{I}$$\begin{pmatrix}0&1\\1&0\end{pmatrix}$$\begin{pmatrix}0&-1\\-1&0\end{pmatrix}. That is 4 matrices. From case 2 (d = -a): For a=1: 5 matrices. For a=−1: 5 matrices. For a=0: same 2 matrices (already counted). Total: 4+5+5=14 matrices with entries in {0,1,−1}.
Confusing matrix multiplication order: Matrix multiplication is not commutative: AB=BA as a rule. When computing M2 or MN, always multiply in the correct order. For M2=M×M, the rows of the first M multiply the columns of the second M — getting the order wrong gives a completely different result.
Forgetting that det(AB)=det(A)det(B) but det(A+B)=det(A)+det(B): The determinant of a product is the product of determinants, but the determinant of a sum has no simple relationship. Students often try to distribute the determinant over addition, which is incorrect. Always compute A+B first, then take the determinant.
Assuming invertibility from a non-zero determinant alone: A matrix is invertible if and only if det(A)=0. But when working over restricted domains (e.g., integer entries), having det(A)=±1 does not guarantee that A−1 also has integer entries. Check whether the adjugate matrix divided by the determinant produces integer entries.