Chapter 1 - Standard Form

Positive Number
Single numbers
Example: 12 100
0.003 023

Standard form,
A 10
n
with 1 A 10
and n an integer.
Example: 1.21 10
4

3.023 10
-3

Level of accuracy required
Significant figures (sig. fig)
Example: 1000 (1 sig. fig)
200.0 (4 sig. fig)
0.0023 (2 sig. fig)
0.0310 (3 sig. fig)
Round off to a given number of significant figures.
Example:
2.7 10
4
540 (correct to 3 sig. fig)
= 1.458 10
7

= 1.46 10
7
(correct to 3 sig. fig)
Chapter 2 Quadratic Expressions
and Equations






















Two linear expressions
(mx + p)(nx + q)
Example:
(x - 1)(x + 4)
(3x + 2)(5x + 1)
Quadratic expressions
ax
2
+ bx + x, a 0
Highest power of unknown is 2
Example: x
2
+ 3x - 4

Factorisation
ax
2
+ bx + c = 0
(mx + p)(nx + q) = 0
mx + p = 0 or nx + q = 0
x = -

x = -

Trial and improvement method
Substitute values of x into
ax
2
+ bx + c = 0.
Check whether they satisfy the
equation.
Quadratic equations
ax
2
+ bx + c = 0, a 0
Example:
3x
2
- 16x + 5 = 0

Solution for quadratic equations
Trial and improvement method
Factorization
Roots of a quadratic equation are values
that satisfy the equation.

Chapter 3 Sets























Element ()
An object in a
set
n(A): number of
elements in set
A
Union (AB)
Consists of all the
elements in set A
or set B or both

Equal sets (A = B)
All the elements of set A are
elements of set B and vice
versa.
Venn diagram
Representation
of sets using
geometrical
diagrams
Sets
A group or
collection of
objects
Defined by
using
descriptions or
set notations
Intersection (AB)
Consists of all the
elements which
belong to both set
A and set B
Operations on sets
Complement of set A (A)
Consists of all the elements in
universal set than are not
found in A.
Universal set ()
Consists of all the elements
under discussion
Subset (A B)
All the elements of set A are
found in set B
Empty set ( or {})
A set which does not have any
elements.

Chapter 4 Mathematical Reasoning





Statement
A statement is a sentence that is either true or false but not both simultaneously.
Example:
8 2 = 16 4 2 = 3 4x + 5
Statement is true Statement is false Not a statement
Quantifiers [All or Some]
Quantifiers are used to indicate the number of
cases there are in a statement.
All indicates each and every one.
Some indicates at least one or several.
Implication
If p, then q. (p q)
p is the antecedent. q is the consequent.
Converse of p q is q p.
p if and only if q (p q) means
p q and q p
Deduction is the process of making specific
conclusion based on a given general
statement.
Induction is the process of making a general
conclusion based on given specific cases.
Argument
An argument is made up of premises and a
conclusion.
Make a conclusion based on two premises for
argument:
Form I
All A are B.
C is A.
C is B.
Form II
If p, then q.
p is true.
q is true
Form III
If p, then q.
Not q is true.
Not p is true.

Operations
Negate a statement by placing Not or
No. Trust table for statement p and ~p
p ~p
True False
False True

Combine two statements with the word
and.
Combine two statements with the word
or. Truth table for statements p and q
and p or q.
p q p and q p or q
True True True True
True False False True
False True False True
False False False False


May not
be true
Not p