Paper 3a

Jansen C. Capatayan MAEd Secondary Math

Relative Complement of a Set
The relative complementation, on the other hand, takes a given set in relation to another
set. For example, if A={a,b,c,,x,y,z} and B= {1,2,3,x,y,z}, then the relative complement of B,
written as A B, is the set {a,b,c}. It shows all the elements of A which are not elements of B.
Similarly B A = {1,2,3}.
In symbols,
A B ={x|x A and x B}
and
B A = {x|x B and x A}
The Venn diagrams of the relative complementation of A B are shown in Figure 1.6
A and B are joint.
A and B are disjoint.
A and B are comparable, where
A B, read as A is the superset of B.

Reference: SkillBookinMathematicsGrade7 by Modesto G. Villarin.

A B
A B
A
B

Number Theory: Fermats Little Theorem

If p is a prime, then for any integer a
a
p-1
1 (mod p)
Proof. If p a, then (a, p) = 1 and by Eulers Theorem,
a
(p)
1 (mod p), or
a
p-1
1 (mod p)
Corollary 10.3.2. If p is prime, then for any integer a,
a
p
a (mod p)
Proof. It suffices to consider p | a. But p | a, then
a 0 (mod p) and a
p
0 (mod p)
Then by transitivityproperty,
a
p
a (mod p)
Reference: ElementaryNumberTheory by Sergio E. Y mas.






Calculus : 1.10.3 Theorem
The sine function is continuous at 0.
Proof. We show that the three conditions necessary for continuity at a number are satisfied.
(i) sin 0 = 0
(ii) lim
0
sin = lim
0
sin

= lim
0
sin

lim
0

= 1 0
= 0
(iii) lim
0
sin = sin0
Therefore the sine function is continuous at 0.
Reference : TC7 by Leithold

Trigonometry: Trigonometric Function

Function Abbreviation Description Identities ( using radians)
sine sin opposite/hypotenuse sin = cos(

2
0) =
1
csc

cosine cos adjacent/hypotenuse cos = sine(

2
0) =
1
sec

tangent tan opposite/adjacent tan =
sin
cos
= cot (

2
0) =
1
cot

cotangent cot adjacent/opposite cot =
cos
sin
= tan(

2
0) =
1
tan

secant sec hypotenuse/adjacent sec = csc(

2
0) =
1
cos

cosecant csc hypotenuse/opposite csc = sec(

2
0) =
1
sin



Linear Algebra: Solutions of Linear Systems
Linear algebra provides the formal setting for the linear combination of equations used in
the Gaussian method. Suppose the goal is to find and describe the solution(s), if any, of the
following system of linear equations:
2x + y - z = 8 (L1)
-3x y+ 2z = -11 (L2)
-2x + y + 2z = -3 (L3)

The Gaussian-elimination algorithm is as follows: eliminate x from all equations below L1,
and then eliminate y from all equations below L2. This will put the system into triangular form.
Then, using back-substitution, each unknown can be solved for.
In the example, x is eliminated from L2 by adding (3/2) L1 to L2. x is then eliminated from
L3 by adding L1 to L3. Formally:
L2 +
3
2

1
L2
L3+ L1 L3
The result is:

Now y is eliminated from L3 by adding 4L2 to L3:
L3 + -4L2 L3
The result is:
2x + y z = 8

1
2
y +
1
2
z = 1
-z =
This result is a system of linear equations in triangular form, and so the first part of the
algorithm is complete.
The last part, back-substitution, consists of solving for the known in reverse order. It can
thus be seen that
z = - 1 (L3)
Then, z can be substituted into L2, which can then be solved to obtain
y = 3 (L2)
Next, z and y can be substituted into L1, which can be solved to obtain
x = 2 (L1)
x We can, in general, write any system of linear equations as a matrix equation:
A x = b
The solution of this system is characterized as follows: first, we find a particular solution
x0 of this equation using Gaussian elimination. Then, we compute the solutions of Ax = 0; that is,
we find the null space N of A. The solution set of this equation is given by x0 + N = {x0 + n : n N}
. If the number of variables equal the number of equations, then we can characterize when the
system has a unique solution: since N is trivial if and only if det A 0, the equation has a unique
solution if and only if det A 0.