ANGUAGIOIMAaut-HIKAH.

tt
language of m

CHARACTERISTICS OF THE LANGUAGE OF MATHEMATICS sample activity

precise ( able to make distinctions ) 3×+5=8
very fine
•
translate into words

( able thrice her age increased by five is eight

concise things briefly)
•
to say .

5 8
aki
✗ t =

powerful ( able to express complex thoughts with relative ease ) ,

noun adi
yerb predicate

subject

MATHEMATICAL EXPRESSION does not state a complete thought examples .

of this are numbers , functions ,

sets ,
variables , points . like :X ,
9 , f- ( x ) ,
A ,
{ a. i. 0 } .
( 5,7 )

no complete thought .

"

English
"

connectives
"

used like in
"

are symbols that are and and or .

}
:
CX plus five
>
3 + 5 three

4 ÷ 1.2 >
tour divided by 1.2
does not have a complete thought
A V B >
A union B

synonyms in math is how you write an expression that will result to the same thing
ex :
different ways to express the number 5

°
5 > five
•
21-3 > 2 and three

•
10 ÷ 2 > half of 10

•
(6-2)+1 s six less 2 ,
increased by 1
•
It 1+1+1+1 → combine five 1s

MATHEMATICAL SENTENCES a correct arrangement of mathematical symbols that states a complete thought .

Can be asked if true or false

verbs i in mathematical sentences ,
the verbs are : =
,
≠ ,
<
,
>
,
≤ ,
≥ ,
C- , ¢ ,
& C

CX : 5 + 3
=
8 →
5 plus 3 is 8

#
gf-gs
SETS a set is a well -

defined collection of objects .

ELEMENTS
_

the objects inside a set

METHODS TO DESCRIBE SETS ( AND ITS ELEMENTS )

roster method
-

list of the names of all elements in a set example : A

=
{ coat ,
hat , scarf , gloves ,
boots }
rule method describing set using properties satisfied by its elements example
:
set of winter clothes
_

SET NOTATIONS :

note : A =
{ at a is an even number between 0 & 10 }

Ég
EÉtf/
" " "
read as such that

)
"

( can also be
"

expressed in :

¢ is not an element of

A universal set is the set of all elements under consideration or everything that is relevant to the problem ,

denoted by capital V. All other sets are subset of the universal set .
•
An empty set or null set is a set that contains no elements .

It is represented by the symbol ∅ or {} example :

the set of months with 32 days → E =
∅
•
A set with only one element is called a singleton .

A finite set is ( the number of elements is countable )

•
a set whose number of elements in the set is a whole number .

An infinite set is number of elements are uncountable

•
a set whose .

RELATIONS ON SETS
•
subset / superset
-

denoted by ≤ ( ex .
A ≤ B ,
A is a subset of B)
only when element of set A is in set B ( considered proper subset )
-

an as

if not ,
then it is denoted as A ¢ B

equal if they have exactly elements

•

we say that two sets are the same .

ex .
A =
{ a. e. i. O ,
V } :B
) if they
"

equivalent ( denoted .by

"

equivalence of sets say that two sets

≈ have
• -

we are

exactly the same number of elements

ex : w {1 =
,
2 , 3, 4,5 } ,
V =
{ die i. 0 , ,
U }
then :
W≈V since n (v ) =
n ( w) =
5

OPERATIONS ON SETS

intersection of sets is denoted by A , defined to be the set of elements common to two sets

ex . An B =
{ × : × c- A and X E B }
Union of sets is denoted defined to be the set of elements either in two sets
by V.

ex . A V13 =
{ × :
× c- A or × E B }
VENN DIAGRAM
consider the sets A =
{ 11317,9 } B =
{1 , 7,10 } C =
{ 3,4 ,
5 }
union
,

intersection
,

then we have the following :

An B { 1,7 } A U B { 1,3 7,9 10 }

☆☆ffgg
= • =
• , ,

by •
Bnc
=
{} •
B V C =
{ 1 , 3,4 ,

disjoint
5 ,
7,10 }

remark : if AAB =
∅ , then they are

complement of a set ( say set A) is denoted set difference denoted as BIA B A -

or
,

defined to be the set of elements contains the elements in B Which are not
'
'
as A or A ,

in the universal set V which are not in set A in A. ex B) A :{ × :X c- B and ✗ ¢ A }

.

ex . Ac = {× E V :
× ¢ A } A \ B B \ A

✓
15

z§
A B A

g@
,
A
A

symmetric difference denoted by AAB , defined to be the set whose elements are in
either A or B ,
but not both .

A AB

✓
ex A AB =
( AIB ) V (B \ A)

••
.

A B
or
=
( AUB ) \ ( ANB )
 CARDINALITY FORMULAS
let A and B be subsets of some finite universal set V. Then we have the following
formulations V13 ) (A) (B) ( AAB ) n ( AIB ) n (A) m / An B)
:
MIA
• =
+
-
•

y
=
y y
-

n ( ( V ) y (A)
) ( A ✗ B)
=p (A) y (B)
'
A
M
•
-
• •
:
y
sample problem 01 :
In a community of 200 residents ,
135 persons have been exposed to chemical X ,

85 to chemical Y ,
and 40 to both chemicals X and Y . Find the number

of persons exposed to :

a.) chemical ✗ but not chemical Y c.) chemical ✗ or chemical Y

b.) chemical but not chemical ✗ d.) neither of the chemicals
solution :

1- LET Method ( using representations )

•
let U be the set of all residents in the community •
let Y be the set of residents exposed
•
let ✗ be the set of residents exposed to chemical × to chemical Y

then :
y (V)
=
200 , y (4)
=
85 ,
y (X)
=
135
, y /✗ A Y ) :
40 2

2. applying the formula

a.) chemical ✗ but not chemical Y 1×14 ) nlx) y (✗ A Y )
• → = -

n
b.) chemical Y but not chemical × 1×1×1 =p (Y ) y ( ✗ AY )
• → -

y
c.) chemical chemical Y
→

y (✗
VY ) MIX ) + y (4) 71×19 )
-
• =
✗ or

y ( ( V41 ) =p Lv )
'

d.) neither of chemicals ✗

n / ✗ VY )
→
you're
-

the
•

doin?!!
3. substitute area
y ( ✗ 141=41×1-111×14 )
a. 135 40 95 = -
=

b.
M (Y IX ) y / Y ) ( ✗ A 4) = 85 40
=
45 =
- -

y
( substitution
MIX 4) =p (x ) + MIY ) n / ✗ 19 ) 135 + 85 40 180
= =
V
-

c.
-

d. 711 ✗ V91 ) =p Iu ) y ( ✗ V9 ) 200-180=20

'
-
= guide thru LET )
alternative way of solving
:

U
✗
2°

y
add each according to what is needed to find .

zoo ex .

a.) chemical ✗ but not Y =

95
45
b.) chemical 4 but not ✗ 95
=
95 40

c.) chemical chemical Y 180

=
✗ or

135
85 d.) neither of the chemicals =
20

sample problem 02 :
In an idol fan club of 500 members , 350 like idol member A ,
270 like idol member
13 , and 180 like both A and B . How many fan club members . . .

d.) likes A or
"
a.) like idol member A but not idol member B B but not
"

difference
e.) do not like A nor B ¥7,1
-

b.) do not like idol member B

c.) like either A only or B only ↳ union minus

intersection
solution :

1. LET Method ( using representations )

•
let U be the number of fan club members then :
let A be the fan club members who likes idol member A Mtv ) M (B) 270
=
=
•
500

be the fan club members who likes idol member 13 y (A) MIAA B) 180
=
•
let B =
350

2. applying the formula

Ah B)
d.) like idol member A but not idol member MIA \ B) y (A) y(
B → =
-

b.) do not like idol member B

y (B) =p Iu ) MLB )
→ -

c.) like either A only B only

→
y ( AAB) MIA )
V13 =
M ( AAB )
-

or
 d.) likes either MIA V13 ) 41 A) MLB ) MIAAB )
+ =
B >
-

A or

e. / do not like A or B >

M ( ( AUB ) ) Mtv ) y / AUB )
' = -

3. substitute take note of the

y ( AIB ) if (A) Y/A NB ) 350 180 170

→ - =
d.
-
=
formulas of the ff
:

(B (V) 230
y B)
'
) / 500 270 =
-

b.
y
: →
y
-

y (A) B) n / BIA )
•
•

if / AAB ) M ( AUB ) y ( AAB ) → (350+270-180) 180=260

-

= -

c.
n ( AUB ) A ( AAB )
• •

y ( AUB ) y (A) + y (B) NCAA B) 350 t 270 180 440

= = =
d.
-
-

4 ( ADB ) 4 (IAVB ) )
'
•
•

y ( ( AV B) c) M ( U ) y ( AUB )
→ 500=
440 60 - -
=
e.

alternative way of solving

:

50 440
add each according to what is needed to find .

g. U
d.) like idol member A but not idol member B =
170
500
b.) do
=
not like idol member B 230

170 180 90 C.) like either A only or B only =

260

d.) likes A or B =
440

e.) do not like A nor B =

270 20

①G [
Ugcc
'
MATHEMATICAL
are either true or
STATEMENTS

false ,
but not both
statements are

. It must be
declarative sentences that
verifiable .

example of statements :
example of NOT statements

✓
p
:
1 + I = 2 ( TRUE ) ✓ × +
y
✓
q
: 2 + 3 =
6 ( FALSE ) ✓ tweet me . ( command )
✓ r :
Today is Thursday .

✓ can we be friends ? ( attest ion )

✓
January has 31 days .
✓ Juan is intelligent ( opinion ) .

simple statement is a statement that single idea a compound statement is

•

a conveys a . a

statement that conveys two or more ideas .

LOGIC CONNECTIVES AND SYMBOLS

statement connective symbolic form type of statement

not p not
~
P negation

p and q and P 19 conjunction

p or q or P V9 disjunction

if p ,
then 9
if . . . then p →
q conditional

pit and only if 9 if and only if p< >

9 bi conditional

is Friday I going to a movie

example : p
:
today .
r : am .

q
: It is raining .
s : I am not going to the basketball game .

write in symbolic form

:

a.) Today isnt Friday and I am going to a movie . ~p A r

b.) I am going to the basketball game and I am not going to a movie .

vs Avr
c.) I am going to a movie if and only if it is raining .
r
q
d.) If today is Friday then I am not going to a movie ,
.

p sur
 COMPOUND STATEMENTS AND GROUPING SYMBOLS
•
parentheses are used to indicate which simple statements are grouped together .

ex.ph ( q v -
r ) →
q and grouped together
ur are
•
statements on the same side of a comma are grouped
together conjunction
.

CX .

p ,
and q or not r
'
g and nr are grouped together must be true and true to

be true .

example pi you get promotion you will receive bonus

: :
a
a r
disjunction
9
:
you complete the training either
then
of the two is true
true .
,

a.) write ( png )

→
r as an English statement .

if you get promotion and complete then you will receive bonus
↳ a
a , .

b.) and you will not

"

write if you do not complete the training then you will not get a promotion ,

in symbolic form C- pnnr )

"
receive a bonus >
nq
→
. .

TRUTH VALUE of . . .

•
a simple statement is either true or false .

>
negation up if p is ,
true ,
~p is false .
if ~p is true , p is false .

• a compound statement depends on the truth values of its simple statements and connectives .

>
conjunction PA 9 is true if both P and q are true otherwise it's false
,
-

.
,
.

is true if at least one statement is true ( either or both )

disjunction pvq ,

example
1-
_

if p 9 . are true and r is false . determine the truth value of :

PV ( 9 r )

:|::::÷::::::::::::::
"
1 p V19 Ar ) is converted to TV ( TA F)
other
.

, examples :

( TNF ) is
u 2 .
the conjunction F
by definition '

y . 1- → F is false 3 .
T it is true

1- thus we 'll
3 .
,
be left with TVF .
2 . 1- F is false 4 .
FVF is false

ntherefore.thetruthvalueofpvlqnrlistrf.SI
ATEMENTS WITH UNIVERSAL QUANTIFIERS : ALL SOME . ,
NONE

existential quantifiers used prefixes to assert the existence of something example of this
•
are as .

are : some , there exists ,

at least one
•
universal quantifiers like none and no deny the existence of something while universal quantifiers
like all and every assert that every element of a given set satisfies some condition
TRUTH TABLES
> a truth table is a table that shows the truth value of a compound statement for all

possible truth value of its simple statements .

conjunction
.
disjunction negation / /

"
" " " " " " " "
"

"Ñ¥
" -

t " " t T T T F F "

T F T T T F T
f
F F F

F T F F T T F T T F for
/ F F F F F F F F T T

sample task 01 :
construct a truth table for ~
( ~ PV 9) V9
pÉppqq
T T F T F T

T F F F T T
J
F T T T F T /
ÉF
?⃝
EQUIVALENT STATEMENTS
↳
two statements equivalent if they both have the same truth value for
are all possible truth
values of their simple statements equivalent statements have identical truth . values in the final
the notion
of their truth tables indicates that statements equivalent
-

columns .
two are .

according to Morgan 's laws of statements

↳
De ,

p g ~ ( p v9 ) ~pn~9 P q ~ ( png ) up ✓ ~
9

for any statements p and q

F
T T F T T F F
,

( p V9 ) I
~
p ~ A~ 9 T F F F T F T T

~
( png ) =
up V~9 F T F F F T T T

F F T T F F T T

TAUTOLOGIES AND SELF CONTRADICTIONS -

>
→
a
tautology is a statement that is a
self
-

contradiction is a statement
always true .
its final column in a truth that is always false . its final column in a

table only consists of TRUE truth values .

truth table
only consists of FALSE truth values .

ex.sn#tPP9isataut.oqy . ex .

showthat-ppqiaf-ntra.li ction

CONDITIONAL
PY
FF
F T T

STATEMENTS
F

can
T

be written in if P
you
do this
can

,
PÉy
FF=
then q
F T T

or if p , 9 form
F

example :
if we order pizza , then we can have it delivered .

premise conclusion
" " " "

in any conditional statement represented If If the p statement is

•

by p . then 9 or p, 9
called the anecdote / premise and the a statement is called the consequence / conclusion .

"

q can be written using the arrow notation p→q

"
if then
•

p ,
P 9 p → a
truth table
q is FALSE only when the premise is true and
T T T
→
p
•

for the i e F
conditional
conclusion is false
F T T
the
I
.

F F T

equivalent form of the conditional

•
the conditional p →
q is equivalent to the disjunction npvq
•
example of npvq a.) If I could play the guitar ,
I would join the band .

> I cannot play the guitar or I would join the band .

disjunction
" "
if
"
statement is converted to
"
the equivalent
>
of , then is or when a a .

every conditional statement pig can be written in the following equivalent forms :
•

that
if q provided
then d. not por 9 p
•
p ,
• . • .

•
p only if q .
• every p is a 9 . •
q is a
necessary condition for p .

•
p implies 9 .
•
9 , if p . •
p is a
sufficient condition for 9 .

negation of the conditional

g) ( nasunod yung premise hindi nangyari yung conclusion)
' '
• ~ ( p → = PA ~
9 ,

•
a.) if they pay me the money I will sign the contract
example of pnnq , .

>
They paid me the money and I did not sign the contract .

"

p if and only if q
"
131 CONDITIONAL STATEMENTS are denoted by pq which are read as
•

p < > q is true if P and q have the same truth value .

p a pa
truth table T T T

example ✗ +4 if only if ✗ =3
:
• =
7 and for the T F e

bi conditional
both equations are true when × =3 F T F

F F F T
and both are false when ✗ ≠ 3
CONVERSE INVERSE . ,
AND THE CONTRAPOSITIVE

statements related to the conditional statement note :

the conditional p
→
9 = ~q →
up ( contrapositive )
•
the converse of P →
q is q
→
p
the converse 9 >
up nq ( inverse )
-

>
p
the inverse q is →
→
•

of p up ~q
is
the contrapositive of p ~q →
→
q np
•

MATHEMATICAL REASONING
mathematical reasoning AND protean
PROBLEM SOLVING
solving and

ARGUMENTS AND EULER DIAGRAM

an argument consists of a set of statements called premises and conclusions . an

argument is
valid if the conclusion is true whenever all the premises are assumed to be true .

an invalid argument
>
it is customary to place a horizontal line between the premises and the conclusion . is an
argument that

can be disproven by

symbolic
>
Arguments can be written in form .
cases explored thru

enter diagrams :))

cuter
diagram :
( diagrams are cases that will prove / disprove the argument )
•
all cars have wheels
•
some car have wheels •
no car has wheels

cars vehicles vehicles

cars
vehicles cars wheels
w/ wheels w/
w/ wheels

VALID ARGUMENT INVALID ARGUMENT

all FEV students Alt FEU students have canvas access

pi canvas access pi
have access to canvas .
access to canvas . Greta

:
Greta is an FEU FEU students 9
: Greta has access to students
q FEV

student .
Greta canvas .

Greta is
'

"
Greta has an FEV
access to
- .

Canvas .
student .

INDUCTIVE REASONING is the process of reaching a general conclusion by examining specific

examples .
the conclusion formed by using inductive reasoning is often called a conjecture ,

since it may or may not be correct ( needs at least three examples ) ; .

> conclusion based on

specific examples
example : using inductive reasoning predict ,
the next number in each of the following list .

d.) 3,6 ,
9 ,
12 ,
15 , . . .
? > ans . 18 ( addition by 3)

b.) 1, 3,6 10,15 , , . . . ? > ans .

21 ( addition by increasing value : 2,3 , 4,5 , 6)
DEDUCTIVE REASONING is the process of reaching a conclusion by applying general
assumptions procedures , ,
or principles ( conclusion based on facts )
.

>
conclusion is a specific case of a general assumption
COUNTEREXAMPLE is one case for which a statement is not true .
thus making a statement false .

example :
all cats are furry .

→
this is false because a sphynx cat has little to no fur .

>
one counterexample is enough to prove that a statement is false .
POLYA 'S PROBLEM SOLVING STRATEGIES
four step problem solving strategy
•

1. Understand the problem .

have a clear understanding of the problem

-

•
can you restate the problem in your own words ?

can you determine what is known about these type problems ?

•

of
is there missing information that if known would allow you to solve the problem ?
•

a , ,

•
is there an extraneous information that is not needed to solve the problem ?

what is the goal ?

•

2. devise a plan .

use a
variety of techniques when you attempt to solve a problem .

•
make an organized list that shows all the possibilities .
•
work backwards .

•
make a list of information that is needed .
•
look for a pattern .
YOU are

capable .

Make list of the known information Make chart

•
table
•
a . a or .

solution and then check your result

•

guess at experiment
•
a .
perform an .

similar but simpler draw diagram

• •

try to solve a problem .

a .

write equation if define what each variable

•
an .
necessary , represent .

3. Carry out the plan .

once you have devised a plan you , must carry it out .

you may have to devise another plan or

carefully >
•
work

{
.

keep an accurate and neat record of all your attempts . modify your existing plan .

realize that some of your initial plans will not work and that
•

4. verification .

once solution is found ,

check your answer if it's applicable to the solution .

ensure that the solution is consistent with the facts

•

of the problem .

interpret the solution in the context of the problem

•

yourself whether there generalizations of the solution that could

•
ask are apply to other problems .

example
•
find a number such that twice its difference with 2 is 5 more than that number .

1. understand the problem since . we are looking for a number ,

we let × be the number .

2. devise a plan . We now translate the word problem into a mathematical one , that is : 2 ( × -

2) ✗ t 5

3. carry out the plan . we use properties of equalities to solve for the problem and get ✗ =
9
↳ 2 ( x -

2) =
× + 5 2x -
× =
4 + 5

2✗ -
4 = ✗ + 5 × = 9
,

verification get 219 2) 14=9+5

=
4. substitute the solution and
-

.
we

example
•
a television set can be bought at # 14,000 inclusive of the tax If the tax rate is at 12% .
, find the

price of the television prior to taxation .

1. understand the problem . let p be the price of the television prior to taxation .

2. devise a plan .
we now translate the word problem into a mathematical one ,
that is pt 0.12 p =
14,000
3. out the plan properties of equalities to solve for the problem and get p
=
carry . We use 12,500

↳ p t 0<12 p = 14,000 1 . 12 p =
14,000 p
=
12,500

(1) Pt 0.12 p =
14,000 1. 12 1. 12

4. Verification substituting . this to our problem yields 12,500 t 0.121121500 ) = 14,000

 NUMERATION SYSTEM
numeration
system
a numeral is the representation or visualization of the abstract idea of a number .
ancient
numeration systems are mostly based from what our ancestors observed during their times
METHODS OF NUMERATION
a simple grouping numeration is where we evaluate each of the symbol used and add their

corresponding values .

1. egyptian hieroglyphs -

a simple grouping numeration system .

t.ooo.ro#
/ / / / / /
stick heel bone rope lotus flower bent finger morphing tadpole the astonished man / god
,

÷ A •s8 % .

10 100 1000 . 100,000

.D§D§
100,000 + 10001-1000+100 + 100+100+10+10
example : •§②•§@•f@j ; ; ; ;
>

1- I + 1 + I + I =
102,324

2. roman numerals observes rules such as : a symbol cannot be used more than thrice consecutively
and if a numeral has a value less than that of the next symbol ,
we subtract its value from that

of the next symbol . it is also a simple grouping system .

i
I V
Ei ✗

I 5 10 50 100 500 1,000 5,000 10,000 50,000 100,000 500,000 1,000,000

example :
MCDLXXIV →
1,000 ,
1100<500 ) ,
50 ,
10 ,
10 ,
( 1<5 )
→ 1,000+400+50 1- 101-101-4 = 1,4741

a multiplicative numeration system is a numeration system that introduces multipliers before adding
the values of the symbols .

3. Chinese numeration is a multiplicative numeration syndrome ; uses the following symbols :

L
i, T 11 I , t ±
F b Tu

0 2 3 4 5 6 7 8 9 10 100 1,000 10,000 100.000,000

a positional numeration system considers each position of the numeral to carry a particular place value .

the value of each position serves as the multiplier .

changing the positions of the symbols changes
the numbers being represented .

4. babylonian cuneiform uses only two symbols to represent their numbers it is base 60 wherein each .
,

position is a power of 60 .
 BASE NUMERALS
solving numerals ( base 10 other bases )
•
•
solving for base numerals for base
'

( other base → base 10 ) divide by base and use the remainders ex . 46 > base 3

expand ✗ place values divide 9 r

^ write the answer

CX . 1201 } '
base 10 46 ÷ 3 15 I

15 ÷ 3 5 0
I 2 0 I from bottom to top
21 9 3 13 5 ÷ 3 I 2
remainder thus ,
y ÷ 3 0
I I
I 27 2×9 0×3 461 1201
✗ + + + ✗ =
}

MODULAR SYSTEMS
modular
systems
CONGRUENCE MODULO n

let a and b be integers ,

and n be a positive integer . then we say that a is congruent to b
modulo n if and only if a
-
b is divisible by n .
In this case , we write a ≤n b or a = b ( Mod n )
we also say that is congruent to b modulo if and only if and b have the
alternatively ,
a n a same

remainders when divided by n .

examples : consider the integers 5 and 8. Note that when we divide both of them by 3. we get
remainders of 2 when divided by hence
5 ÷ 3=1 r . 2 and 8 ÷ 3=2 r . 2. they have the same 3.
, by
definition , we say that 5=38 or 5=8 ( mod 37 similarly . , we can use the other definition
and get the difference of 5 and 8 ,
that is 8-5=3 Note that 3 is . divisible by 3 and thus ,

5=>8 or 5=-8 ( Mod 3) .

SOLVING MODULAR EQUATIONS

example : 12 3 65 24 12 63 5 24 135 ÷ 6 =
22 r 3

I
. .

6 • • • .

1. solve first by PEMDAS 15 + 120 (r =

22×6 =
132
2. solve the equation .
=
135 ( Mod 6) 135-132=3 )
3. write the answer and the mod .

APPLICATION ENCODING AND DECODING :