MAT 111: Algebra Comprehensive University Study Guide
MAT 111: ALGEBRA - COURSE OVERVIEW AND NUMBER SYSTEMS
Instructor: Dr. Taiwo. O. SANGODAPO Affiliation: Department of Mathematics, University of Ibadan Session: 2021/2022 Session
Course Outline
Polynomials and Rational Functions
Principle of Mathematical Induction
Permutation, Combination and the Binomial Theorem
Sequences and Series
Complex Numbers
Matrices and Determinants
An Excursion to Number Systems
There are many types of number systems essential for algebraic study:
The Natural Numbers (N): The set of counting numbers: N={1,2,3,…}. This set represents positive whole numbers. The operations of addition (+) and multiplication (×) are well-defined on N.
The Set of Integers (Z): Includes positive and negative whole numbers along with zero: Z={…,−3,−2,−1,0,1,2,3,…}. The operations of addition (+), multiplication (×), and subtraction (−) are well-defined. Note that N⊂Z.
The Set of Rational Numbers (Q): Defined as Q={ba:a,b∈Z,b=0}. This is the set of all fractions. The relationship between sets is N⊂Z⊂Q. Addition, subtraction, multiplication, and division are well-defined on Q.
Irrational Numbers: Numbers that cannot be expressed as fractions, such as 2, π, or 5. The union of rational and irrational numbers forms the Real Number System (R).
The Complex Number System (C): Consider the equation x2+1=0⟹x=±−1. Because the square root of a negative number has no solution in R, the complex system is defined as C={a+ib:a,b∈R}, where i=−1.
POLYNOMIALS AND RATIONAL FUNCTIONS
Introduction to Polynomials
A real polynomial f(x) in variable x of degree n is represented by: f(x)=anxn+an−1xn−1+⋯+a1x+a0 where:
an=0
an is the leading coefficient.
a0 is the constant term.
Classification by Degree
Degree 1 (n=1): Linear function.
Degree 2 (n=2): Quadratic function.
Degree 3 (n=3): Cubic function.
Degree 4 (n=4): Quartic function.
Degree 5 (n=5): Quintic function.
Basic Arithmetic Operations
Operations of addition, subtraction, multiplication, and division apply to polynomials.
A polynomial f(x) can be divided by g(x) provided the degree of g(x)≤ degree of f(x). Here, g(x) is the divisor (g(x)=0).
General Form:f(x)=d(x)×q(x)+r(x) Where d(x) is the divisor, q(x) is the quotient, and r(x) is the remainder.
Long Division Examples:
Divide x3+3x2−x+1 by x−2: - Quotient: x2+5x+9 - Remainder: 19
Divide 5x3+14x2−6x−8 by 2x2+x−3: - Quotient: 25x+423 - Remainder: −417x+437
Divide x3−2x2+3x−6 by x+2: - Quotient: x2−4x+11 - Remainder: −28
Remainder and Factor Theorems
Remainder Theorem
If a polynomial f(x) of degree ≥1 is divided by ax+b, the remainder is f(−ab).
Example 1: Find the remainder when f(x)=x3−3x2+x−5 is divided by 2x−1.
Set 2x−1=0⟹x=21.
f(21)=(21)3−3(21)2+21−5=81−43+21−5=−841.
Remainder is −5.125.
Example 2: Find the remainder when f(x)=6x3+2x2−1 is divided by x+1.
Set x+1=0⟹x=−1.
f(−1)=6(−1)3+2(−1)2−1=−6+2−1=−5.
Factor Theorem
If ax+b is a factor of f(x), then f(−ab)=0, and conversely.
Example: Show x−2 is a factor of x4−15x2+10x+24.
f(2)=24−15(2)2+10(2)+24=16−60+20+24=0.
Therefore, x−2 is a factor.
LINEAR, QUADRATIC AND CUBIC EQUATIONS
Linear Equations
General form: y=ax+b (Degree 1). Geometrically, this is a straight line.
Slope:a
y-intercept:b
x-intercept (root):−ab Every linear equation has exactly one root.
Simultaneous Linear Equations in Two Variables
General form: ax+by=e1cx+dy=e2
Methods for solution: Substitution, Elimination, Cramer’s Rule, and Graphical methods.
Types of Solutions
Unique Solution (Type I): Lines intersect at one point (e.g., 3x+y=6 and x−y=10⟹x=4,y=−6).
Infinite Solutions (Type II): Both equations represent the same line (e.g., 4x+2y=8 and 12x+6y=24).
No Solution (Type III): Lines are parallel and never intersect (e.g., x+3y=7 and 3x+9y=5).
Quadratic Equations
General form: y=ax2+bx+c (Degree 2). Geometrically, this is a parabola (convex or concave).
The Quadratic Formula
By completing the square on ax2+bx+c=0: x=2a−b±b2−4ac
Nature of Roots (Discriminant)
The discriminant is D=b2−4ac.
D>0: Two distinct real roots.
D=0: Two equal real roots (one repeated root).
D<0: Imaginary or complex roots (no real roots).
Sum and Product of Roots
If α and β are roots of ax2+bx+c=0:
Sum:α+β=−ab
Product:αβ=ac The equation can be written as: x2−(α+β)x+αβ=0.
Useful Identities:
α2+β2=(α+β)2−2αβ
α3+β3=(α+β)3−3αβ(α+β)
(α−β)2=(α+β)2−4αβ
Cubic Equations
General form: ax3+bx2+cx+d=0. If α, β, and γ are roots:
α+β+γ=−ab
αβ+αγ+βγ=ac
αβγ=−ad
INEQUALITIES AND ABSOLUTE VALUES
Representation of Inequalities
Inequalities (e.g., "x is greater than or equal to 5") can be shown in three ways:
Symbolic Notation:x≥5
Interval Notation:[5,∞)
Number Line: A solid circle at 5 with an arrow pointing right.
Interval Types
Open Interval (a,b):a<x<b (endpoints not included).
Closed Interval [a,b]:a≤x≤b (endpoints included).
Half-Open/Half-Closed [a,b) or (a,b]: One endpoint excluded. Note: Infinity (∞) is not a number and is always represented with an open bracket.
Properties of Inequalities
Let a,b,c,d∈R:
If a<b and b<c, then a<c.
If a<b, then a+c<b+c.
Multiplication/Division by c>0 preserves the inequality sign.
Multiplication/Division by c<0 reverses the inequality sign (e.g., if a<b, then ac>bc).
Quadratic Inequalities
Methods for solving x2+2x−3>0:
Analytical Method: Factor to (x−1)(x+3)>0. Solve for Cases: (+ and +) or (− and −). Results: x>1 or x<−3.
Sign Table Method: Identify critical values (−3,1). Test values in segments (−∞,−3), (−3,1), and (1,∞).
Graphical Method: Plot the parabola and find regions where y>0.
Absolute Values (Modulus)
Definition: ∣x∣ represents the distance from the origin. ∣x∣=⎩⎨⎧x−x0if x>0if x<0if x=0
Properties:
∣−x∣=∣x∣
∣xy∣=∣x∣∣y∣
∣x∣<a⟺−a<x<a
∣x∣>a⟺x>a or x<−a
Example: Solve ∣2x−1∣<7−7<2x−1<7⟹−6<2x<8⟹−3<x<4.
RATIONAL FUNCTIONS AND PARTIAL FRACTIONS
Rational Functions
A rational function is defined as f(x)=q(x)p(x) where p,q are polynomials and q(x)=0.
Domain: Entire real set except values where the denominator q(x)=0.
Range: Set of possible y values; found by expressing x in terms of y.
Zeros: Found by setting the numerator p(x)=0.
Partial Fractions
Resolution into partial fractions decomposes a compound rational function.
Proper vs. Improper Fractions
Proper: Degree of numerator < Degree of denominator.
Improper: Degree of numerator ≥ Degree of denominator. Must use long division first.
Rules for Partial Fractions
Type I (Linear Non-Repeated):(x−a)(x−b)px+q=x−aA+x−bB
Type II (Linear Repeated):(x−a)kf(x)=x−aA1+(x−a)2A2+⋯+(x−a)kAk
Type III (Non-Factorizable Quadratic):(x−a)(x2+bx+c)f(x)=x−aA+x2+bx+cBx+C
PRINCIPLE OF MATHEMATICAL INDUCTION
The Principle
To prove a statement P(n) is true for all positive integers n:
Basis Step: Show P(1) is true.
Inductive Hypothesis: Assume P(k) is true for some arbitrary integer k.
Inductive Step: Prove that P(k)⟹P(k+1).
Example: Sum of Series Prove 1⋅2+2⋅3+⋯+n(n+1)=3n(n+1)(n+2).
For n=1: 1(2)=2. RHS: 31(2)(3)=2. True.
Assume for n=k: ∑i=1ki(i+1)=3k(k+1)(k+2).
For n=k+1: 3k(k+1)(k+2)+(k+1)(k+2)=(k+1)(k+2)[3k+1]=3(k+1)(k+2)(k+3). True.
Example: Divisibility Prove 9 is a factor of 52n+3n−1.
For n=1: 52+3(1)−1=25+2=27. 27=9×3. True.
Step: Show 52(k+1)+3(k+1)−1 is a multiple of 9 using hypothesis 52k=9N−3k+1.
PERMUTATIONS AND COMBINATIONS
Permutations (nPr)
An arrangement of objects in a definite order.
Arrangement of n distinct objects: n!=n×(n−1)×⋯×1.
Arrangement of r objects from n different objects: nPr=(n−r)!n!.
Special Cases
Permutations with Repetitions: If r1,r2…rk are counts of identical objects, total arrangements = r1!r2!…rk!n!. - e.g., MATHEMATICS (11 letters: 2M, 2A, 2T): 2!2!2!11!.
Circular Arrangements: Number of ways to arrange n objects in a circle is (n−1)!.
Combinations (nCr)
A selection of objects where order does not matter. nCr=(rn)=r!(n−r)!n!
Properties:
nCr=nCn−r
nCr+nCr+1=n+1Cr+1
n!=0 if n<0.
THE BINOMIAL THEOREM
Positive Integral Index
(a+b)n=∑r=0nnCran−rbr
The term Tr+1=nCran−rbr is the general term.
The expansion has n+1 terms.
Coefficients are found using Pascal's Triangle.
Negative and Fractional Indices
If ∣x∣<1 and q is any real number: (1+x)q=1+qx+2!q(q−1)x2+3!q(q−1)(q−2)x3+…
The expansion is infinite if q is not a positive integer.
Range of Validity: The series converges only if ∣x∣<1.
SEQUENCES AND SERIES
Arithmetical Progression (A.P.)
Sequence: a,a+d,a+2d,…
n-th term (an):a+(n−1)d
Sum of first n terms (sn):sn=2n[2a+(n−1)d]
Arithmetic Mean of a and c:21(a+c).
Geometrical Progression (G.P.)
Sequence: a,ar,ar2,…
n-th term (an):arn−1
Sum (sn):sn=1−ra(1−rn) for r<1; sn=r−1a(rn−1) for r>1.
Geometric Mean of a and c:±ac.
Harmonic Progression (H.P.)
A sequence where terms are the reciprocals of an A.P.
Division: Multiply numerator and denominator by the conjugate of the denominator.
Argand Diagram and Polar Form
Modulus (r):∣z∣=x2+y2.
Argument (θ):arg(z)=tan−1(xy).
Polar Form:z=r(cos(θ)+isin(θ)).
De Moivre’s Theorem
For any integer n: [r(cos(θ)+isin(θ))]n=rn(cos(nθ)+isin(nθ))
Roots of Complex Numbers:nz=nr[cos(nθ+2kπ)+isin(nθ+2kπ)] for k=0,1,…,n−1.
MATRICES AND DETERMINANTS
Matrix Algebra
Equality: Two matrices are equal if they have the same size and identical corresponding entries.
Multiplication (AB): Defined if columns of A= rows of B. In general, AB=BA.
Transpose (AT): Rows become columns and columns become rows.
Special Matrices
Identity Matrix (In): Diagonal entries are 1, others are 0.
Invertible Matrix:A is invertible if there exists a unique A−1 such that AA−1=I.
Symmetric:A=AT.
Skew-Symmetric:AT=−A.
Rank and Systems of Equations
Row Reduced Echelon Form (RREF): Standard form for solving linear systems via elementary row operations.
Rank (RA): Number of non-zero rows in RREF.
AX=B: 1. If rank(A)<rank([A∣B]): Inconsistent (No solution). 2. If rank(A)=rank([A∣B])=n: Unique solution. 3. If rank(A)=rank([A∣B])<n: Infinite solutions.
Determinants and Cramer’s Rule
Determinant (∣A∣): A scalar value. For a 2×2 matrix A=(acbd), ∣A∣=ad−bc.
Adjoint Method:A−1=∣A∣1adj(A), where adj(A) is the transpose of the cofactor matrix.
Cramer’s Rule: For a system AX=B, xi=∣A∣∣Bi∣, where Bi is A with the i-th column replaced by B.