MATHEMATICS DIVISION

Fundamentals of Mathematics - *Same Sign

- Rule: Divide the absolute value of the
 BASIC OPERATIONS
factors and attach a positive sign to the
- Addition- Sum= addend + addend
product
- Subtraction-Difference= minuend –
- 50  5 = 10
subtrahend
- (-100)  (-20) = 5
- Multiplication- multiplicand x multiplier
- Division- Quotient= dividend / divisor
- *Unlike Sign
- Rule: Divide the absolute value of the
 OPERATIONS OF INTEGERS
factors and attach a negative sign to the
ADDITION result
- (16 ) (-4)= - 4
- *Same Sign
- (-20)  ( 5) = - 4
- Rule: Add the absolute value of the
addends and copy their common sign to the LAW ON SIGNS
sum
- 25 + 40= 65
- (-20) + (-18) = -38

- *Unlike Sign
- Rule: Subtract the absolute value of the
addends and copy the sign of the addend
with higher absolute value
- 25 + (-40) = -15
- (-18) + 50 = 32
ORDER OF OPERATIONS
SUBTRACTION

- Rule: Change the sign of the subtrahend

and perform the rule addition.
- 25 – 17 = 25+ (-17) = 8
- (-18) - 50 = (-18) + (-50) = -68
- 100 – (- 44) = 100 + 44 = 144

Operations on Integers

Addition and Subtraction

- Same or Like signs – ADD and retain the sign
- Different or Unlike signs – SUBTRACT and
KEEP the sign of the larger value  DIVISIBILITY RULES
- 2, 4, 8
MULTIPLICATION
- 2 – last digit is even
- *Same Sign - 4 – last two digits is a divisible of 4
- Rule: Multiply the absolute value of the - 8 – last three digits is a divisible of 8
factors and attach a positive sign to the
product - 3, 6, 9
- 5  50= 250 - 3 – sum of digits is divisible of 3
- (-20) (-10) = 200 - 6 – even and multiple of 3
- 9 – sum of digits is divisible of 9
- *Unlike Sign
- Rule: Multiply the absolute value of the - 7
factors and attach a negative sign to the - 7 – double the last digit, subtract the
result doubled last digit from the number without
- (4 )(-25)= - 100 the last digit
- (-10) ( 15) = - 150
- 5, 10
- 5 – last digit is 0 or 5
- 10 – last digit is 0
  FACTOR AND MULTIPLE - *DISSIMILAR FRACTIONS
- Factor- is the number than evenly divide - Rule: Get the LCD and change the fractions
the given number and do not leave a to similar. Then, follow the rule in
remainder. adding/subtracting similar fractions
- Multiple- is the number get after
multiplying the given number by an integer.

- GCF (Greatest Common Factor)

- The highest number that divides exactly

into two or more numbers. It is simply
the largest of the common factors.
MULTIPLICATION
- LCM (Least Common Multiple)
Rule:
- Multiple in this context is used for integers.
LCM refers to the smallest number that two Multiply it by numerator to numerator and
or more numbers will divide without denominator to denominator
remainder.

 PRIME AND COMPOSITE

- Prime- is a number whose only factors are 1
and itself.
- Composite- is a number that has more than
two factors.
- Prime Factorization- process of expressing
a number as a product of its prime factors

 FRACTIONS DIVISION
- Complex Fraction
- Proper Fraction Rule:
- Mixed Fraction Get the reciprocal of the divisor and proceed to the
- Improper Fraction rule in multiplication of fractions
Operations on Fractions

- ADDITION
𝒂 𝒄 𝒂𝒅+𝒃𝒄
- + =
𝒃 𝒅 𝒃𝒅
- SUBTRACTION
𝒂 𝒄 𝒂𝒅−𝒃𝒄
- − =
𝒃 𝒅 𝒃𝒅
- MULTIPLICATION
𝒂 𝒄 𝒂𝒄
- × =
𝒃 𝒅 𝒃𝒅
- DIVISION
-
𝒂 𝒄
÷ =
𝒂𝒅  RATIO AND PROPORTION
𝒃 𝒅 𝒃𝒄
- RATIO- A ratio is comparison between two
𝒂
ADDITION/SUBTRACTION quantities 𝒂 and 𝒃, expressed as 𝒂: 𝒃 or ,
𝒃
- *SIMILAR FRACTIONS read as "𝒂 𝒊𝒔 𝒕𝒐 𝒃“.
- Rule: Add/Subtract only the numerators of - A proportion is a statement of equality
the two fractions and copy the common between two ratios.
𝒂 𝒄
denominator - =
𝒃 𝒅
- 𝒂: 𝒃 = 𝒄: 𝒅
 - Direct Proportion
- If 8 kg of guavas cost as much as 12 kg of
mangoes, how many kg of guavas would
cost as much as 150 kg of mangoes?
- Joint Proportion/Variation
Y = 𝒌𝒙/𝒛
- If y varies as x and z, and y = 8 when x = 3
and z = 6, then find z when x=6 and y=4
- Partitive Proportion
- If P 100,000 is divided among Jay, Carl and
Rome the ratio 10:6:4, respectively,
- what amount will Rome receive?

 RATE, BASE & PERCENTAGE

-
LAW OF EXPONENTS

 SIMPLE INTEREST
-

BASIC ALGEBRA

- x + x= 2x
- 2x + x= 3x
- 2x – x= x
- x + y= x+y
- x + 2y + x + y= 2x+3y Product rule
- 2x + y + 5 – x + 2y -1= x+3y+4
(𝒙𝟑 ) (𝒙𝟓 )
Evaluating Algebraic Expressions
Quotient rule
- To evaluate, substitute the given values to
the expression. 𝒚𝟐𝟎
𝒚𝟏𝟎
*****(PLEASE SEE TABLE BELOW ON TRANSLATING
ALGEBRAIC EXPRESSIONS)***** Power law
 𝟒
(𝒙𝟓 )

Negative exponent  PLANE GEOMETRY

(𝑏)−4 BASIC TERMS
Power of different bases - POSTULATES- statements that are assumed
𝟐 to be true without proof.
(𝒂𝟑 𝒃𝟒 )
- DEFINITIONS- precise statements regarding
a certain term, which will make use of
several concepts
 FACTORING
- THEOREM- are statements that are
- Algebraic expressions can be factored using
required to be proved from postulates,
many methods. The most common
definitions, and previously proved theorems
methods used for factoring algebraic
- COROLLARY- is a theorem that is an
expressions are:
immediate consequence of another
- Factorization using common factors
theorem
- Factorization by regrouping terms
- Factorization using identities
 Factorization using Common Factors
- To factor an algebraic expression using
common factors, the highest common
factor of the terms is determined and
grouped accordingly. In simple terms, the
reverse process of expansion of an algebraic
expression is its factorization.
- 𝑎𝑥 + 𝑎𝑦 = 𝑎(𝑥 + 𝑦)
 Factorization using Standard Identities
- An equality relation which holds true for all
values of variables in mathematics is known DEFINITIONS
as an identity. The following are the most
common identities:
-

 PATTERNS AND SEQUENCE

- SERIES and SEQUENCES

ARITHMETIC SEQUENCE

- 𝒂𝒏 = 𝒂𝟏 + (𝒏 − 𝟏)𝒅

ARITHMETIC SERIES
𝒏
- 𝑺𝒏 = [𝟐𝒂𝟏 + (𝒏 − 𝟏)𝒅]
𝟐

GEOMETRIC SEQUENCE

- 𝒂𝒏 = 𝒂𝟏 ∙ 𝒓𝒏−𝟏

GEOMETRIC SERIES
𝟏−𝒓𝒏
- 𝑺𝒏 = 𝒂𝟏 ( )
𝟏−𝒓
𝒂𝟏
- 𝑺∞ =
𝟏−𝒓

 FIBONACCI SEQUENCE
- is a series of numbers where a number is
found by adding up the two consecutive
numbers before it.
 - An angle is the union of two non-collinear
 TYPES OF ANGLES
rays with a common endpoint called the
vertex.

 QUADRILATERALS
-
  PYTHAGOREAN THEOREM - Mean (also called as the average; the most
- reliable measure)
- Weighted Mean (each value in the
distribution is associated with a certain
weight or degree of importance)
- Median (middlemost value of the
distribution)
- Mode (value that has the highest
frequency)

Measures of Dispersion

This measures the degree of the spread of data. This

 CARTESIAN COORDINATE PLANE sometimes called the measures of variation or
measures of spread. This is used to determine how
scattered, how distant or close the data in the
distribution are – its heterogeneity or homogeneity. The
following are some of the most commonly used
measures for dispersion.

- Range
- Interquartile Range
- Variance
- Standard Deviation

 PROBABILITY
- DISTANCE BETWEEN TWO POINTS
Fundamental Principles of Counting
𝒅 = √(𝒙𝟐 − 𝒙𝟏 )𝟐 + (𝒚𝟐 − 𝒚𝟏 )𝟐 - The Fundamental Principles of Counting is
used to determine the total number of
- MIDPOINT FORMULA
possible outcomes for a given situation. For
M= (
𝒙𝟏 +𝒙𝟐 𝒚𝟏 +𝒚𝟐
, ) instance, if there are 𝑎 ways of doing
𝟐 𝟐 something and 𝑏 ways of doing another
- SLOPE OF THE LINE thing, there are a total of 𝑎 × 𝑏 ways of
doing both actions
𝒚𝟐 − 𝒚𝟏
𝒎=
𝒙𝟐 − 𝒙𝟏 Permutation

 STATISTICS - arrangement where the order is significant

- Measures of Central Tendency 𝒏!
- 𝒏 𝑷𝒓 = (𝒏−𝒓)!
Mean
Combination
Median
- arrangement of objects taken at a time in
Mode
which the order is not significant
- Measures of Variations 𝒏!
- 𝒏 𝑪𝒓 =
𝒏!(𝒏−𝒓)!
Standard Deviation
How to compute for the probability of an event, P
Variance
(event)?
- Measures of Positions

Percentiles

Quartiles

Deciles

Measures of Central Tendency Example:

- This determines a numerical value in the A die was rolled on the floor. What is the
central region of a distribution of scores. probability of getting a number divisible by 2?
Central tendency refers to the center of a
distribution. Answer:
 P(number divisible by 2)= 3/6 = 1/2 Answer: Sarah is sick and it is raining implies that
Matteo stayed up late last night.
*Even Chance*
 CONVERSE, INVERSE, & CONTRAPOSITIVE
STATEMENTS
 MATH LOGIC
 For every implication or conditional statement
 Logic Statement- A logic statement or
(𝑝 → 𝑞), we can construct its converse, inverse,
proposition is a declarative sentence that is true
and contrapositive.
or false but not both. A simple statement
contains a single idea. A compound statement  A conditional statement consists of two parts, a
contains several simple statements. The ideas in hypothesis in the “if” clause and a conclusion in
a compound statement are connected by the “then” clause.
connectives.
 Logical Connectives- Mathematical statements  To form the converse of the conditional
may be joined by logical connectives which are statement, interchange the hypothesis and the
used to combine simple propositions to form conclusion. (𝑞 → 𝑝)
compound statements. These connectives are  To form the inverse of the conditional
negation, conjunction, disjunction, implication, statement, take the negation of both the
and biconditional. hypothesis and the conclusion. (¬𝑝 → ¬𝑞)
 Statements can be represented by propositional
variables 𝑝, 𝑞, 𝑟, …  To form the contrapositive of the conditional
statement, interchange the hypothesis and the
conclusion of the inverse statement. (¬𝑞 →
¬𝑝)

 When two compound propositions always have

the same truth values, regardless of the truth
values of its propositional variables, we call
them equivalent. Hence, a conditional
statement and its contrapositive are equivalent.
The converse and the inverse of a conditional
statement are also equivalent, as the reader can
verify, but neither is equivalent to the original
Logical Connectives (Example) conditional statement.

Transform the English sentence into logical statement:  Example #1:

“You can access the internet from campus if only if 𝑝≡ It rains.

you are an Info Tech student or you are not a 𝑞 ≡ They can cancel school.
freshman.”
Conditional : If it rains, then they can cancel school.
Let:
Converse : If they can cancel school, then it rains.
𝒑 ≡ “You can access the internet from the
Inverse : If it does not rain, then they can’t
campus.”
cancel school.
𝒒 ≡ “You are an Info Tech student.”
Contrapositive : If they can’t cancel school, then it does
𝒓 ≡ “You are a freshman.” not rain.

Answer: 𝒑 ↔ (𝒒 ˅ ¬𝒓)  SET OPERATIONS

- A set is a collection of well-defined objects.
Logical Connectives (Example)
The objects in the set are called the
Transform the logical statement into English sentence: elements of the set. To describe a set, we
use braces { }, and use capital letters to
Given: represent it. To indicate membership we
𝒑 ≡ “Sarah is sick.” use the symbol ∈, when an element is not a
membership, we use ∈.
𝒒 ≡ “It is raining.” - SETS (Examples)
𝒓 ≡ “Matteo stayed up late last night .” - A = { all enrolled students of CBRC }
- B={a,e,i,o,u}
Find: ( 𝒑 ˄ 𝒒 ) → 𝒓 - C = { consonants of the English alphabet }
- D = { x ∈ N | x < 10 }
 - E = { Zoom, Google Meet, Messenger, Sets B and K are equal since the members of both of
Facebook } these sets are a, e, i, o, and u.
- F = { y ∈ 𝑍 − | y ≤ -6 }
• Equivalent Sets. Two sets are equivalent if they
SET REPRESENTATIONS contain the same number of elements.

• Recursive Rule. By defining a set of rules which Example: D = { x ∈ N | x < 10 }; and

generates or defines its members.
J={b,c,d,e,f,g,h,i,j}
Examples:
The set D has 9 elements: 1, 2, 3, 4, 5, 6, 7, 8, and 9,
A = { all enrolled students of CSPC } whereas set J contains also 9 elements making them
equivalent sets.
C = { consonants of the English alphabet }
• Universal Set. A set that contains all the
• Listing / Roster Method. Writing or listing down
elements considered in a particular situation
all the elements between braces.
and denoted by U.
Examples:
Example: U = { letters of the English alphabet}
B={a,e,i,o,u}
J={b,c,d,e,f,g,h,i,j}
E = { Zoom, Google Meet, Messenger, Facebook }
In this example, set U is considered the universal set
• Set-Builder Notation. Enumerating its elements since this is the set where the elements of set J can be
by stating the properties that its members must drawn.
satisfy.
• Subset. A set A is called a subset of B if every
Examples: element of A is also an element of B. “A is a
subset of B ” is written as A  B.
D = { x ∈ N | x < 10 }
• ∅ is a subset of every set.
F = { y ∈ 𝑍 − | y ≤ -6 }
• A set is always a subset of itself.
TERMS AND NOTATIONS
Example: L = { 1 , 2 , 3 , 4 }
• A finite set contains elements that can be
counted and terminates at certain natural Subsets:
number, otherwise, it is infinite set.
{ 1 }, { 2 }, { 3 }, { 4 }, { 1 , 2 }, { 1 , 3 },
The previous given sets A, B, C, D, E are examples of
{ 1 , 4 }, { 2 , 3 }, { 2 , 4 }, { 3 , 4 },
finite set, meanwhile set F is an infinite set.
{ 1 , 2 , 3 }, { 1 , 2 , 4 }, { 1 , 3 , 4 },
• Null Set or Empty Set. This is a set with no
elements, often symbolized by ∅ or { }. { 2 , 3 , 4 }, { 1 , 2 , 3 , 4 }, and ∅
Example: G = { vowel in the word “rhythms” } • Superset. If 𝐴 is a subset of 𝐵 then 𝐵 is a
superset of 𝐴 and is written as 𝐵 ⊇ 𝐴.
G=∅
• Proper Subset. This is a subset that is not
• Singleton set. A set with only one member.
equivalent to the original set, otherwise
Example: H = { p ∈ R | p is an even prime } improper subset, and is written as A  B.

H={2} Example: L = { 1 , 2 , 3 , 4 }

• Cardinality of the Set. The cardinality of a set is Proper Subsets: { 1 }, { 2 }, { 3 }, { 4 }, { 1 , 2 },

its size. For a finite set, the cardinality of a set is
{ 1 , 3 }, { 1 , 4 }, { 2 , 3 }, { 2 , 4 }, { 3 , 4 }, { 1 , 2 , 3 },
the number of members it contains. In symbolic
notation the size of a set S is written |S|. In the { 1 , 2 , 4 }, { 1 , 3 , 4 }, { 2 , 3 , 4 }, and ∅
given examples of finite sets: |A| = 250; |B| =
5; |C| = 21; |D| = 10; |E| = 4; |G| = 0; • Power Set. This is defined to be the set of all
and |H| = 1. subsets of a given set, written as P(A).

• Equal Sets. Two sets are equal if they contain Example: L = { 1 , 2 , 3 , 4 }

exactly the same elements. P (L) = { { 1 } , { 2 } , { 3 } , { 4 } , { 1 , 2 } , { 1 , 3 } , { 1 , 4 } ,
Example: B = { a , e , i , o , u }; and {2,3},{2,4},{3,4},{1,2,3},{1,2,4}
K = { vowels of English alphabet } ,

{ 1 , 3 , 4 } , { 2 , 3 , 4 }, { 1 , 2 , 3 , 4 }, ∅ }
| P (L) | = 2𝑛 = 24 = 16 elements / subsets in the P(L). J={b,c,d,e,f,g,h,i,j}

• Disjoint Sets. Two sets are disjoint if they have J′ = { a , k , l , m , n , o , p , q , r , s ,

no element in common.
t,u,v,w,x,y,z}
Example: K = { vowels of English alphabet }
The union of sets A and B, denoted by A∪B, is the set
C = { consonants of the English alphabet } consisting of all elements that belong to either A or B
or both.
Sets K and C are disjoint since they do not have
elements in common. A ∪ B = { 𝒙 | 𝒙 ∈ 𝑨 𝒐𝒓 𝒙 ∈ 𝑩 }

• Axiom of Extension. This states that a set is

completely determined by what its elements
are – not the order in which they might be
listed or the fact that some elements might be
listed more than once.

• Through the Axiom of Extension, sets can be

written not like this:

• ❎ J = { a , b , b , c , d , e , e , f , g , h , h , i , j}

• But can be written like any of these:

• ☑ J={a,b,c,d,e,f,g,h,i,j}
Example for union of sets:
• ☑ J={j,g,c,a,e,b,h,f,i,d}
M={a,e,i,o,u,x,y}

J={b,c,d,e,f,g,h,i,j}
 SET OPERATIONS
M∪J={a,b,c,d,e,f,g,h,i,j,o,u,x,y}
VENN DIAGRAMS
The intersection of sets A and B, denoted by A∩B, is
- The English logician John Venn (1834–1923) the set consisting of all elements that belong both A
developed diagrams, which we now refer to and B.
as Venn diagrams, that can be used to
A ∩ B = {𝒙 | 𝒙 ∈ 𝑨 𝒂𝒏𝒅 𝒙 ∈ 𝑩 }
illustrate sets and relationships between
sets. In a Venn diagram, the universal set is
represented by a rectangular region and
subsets of the universal set are generally
represented by oval or circular regions
drawn inside the rectangle. In a Venn
Diagram, the size of the rectangle or circle is
not a concern.
- The complement of set A is defined as the
set consisting of all elements in U that are
not in A.
- A= { 𝒙 ∈ 𝑼 | 𝒙  𝑨 }
- A= { 𝒙 ∈ 𝑼 | 𝒙  𝑨 } Example for intersection of sets:

M={a,e,i,o,u,x,y}

J={b,c,d,e,f,g,h,i,j}

M ∩J={e,i}

Example for set complement:

U = { letters of the English alphabet}

The difference or relative complement of two sets A M∆J={a,b,c,d,f,g,h,j,o,u,x,y}
and B, denoted by A–B, is the set consisting of all
The (Cartesian) product of two sets A and B, denoted
elements in A that are not in B.
by AxB, is defined by
A − B = {𝒙 | 𝒙 ∈ 𝑨 𝒂𝒏𝒅 𝒙  𝑩 }
AxB = {(𝒂, 𝒃)|𝒂 ∈ 𝑨 𝒂𝒏𝒅 𝒃 ∈ 𝑩}

Example for product of sets:

Y={a,e,i}

Z={a,c,d}

Y x Z = { (a , a) , (a , c) , (a , d) , (e , a) , (e , c) ,

( e , d) , (i , a) , (i , c) , (i , d) }

Example for product of sets:

Y={a,e,i}

Z={a,c,d}
B – A = {𝒙 | 𝒙 ∈ 𝑩 𝒂𝒏𝒅 𝒙  𝑨}
Z x Y = { (a , a) , (a , e) , (a , i) , (c , a) , (c , e) ,

( c , i) , (d , a) , (d , e) , (d , i) }

C - Complement

U - Union

P - Product

I - Intersection

D - Difference (Relative Complement)

S - Symmetric Difference
Example for difference of sets:

M={a,e,i,o,u,x,y}  MODULAR ARITHMETIC

J={b,c,d,e,f,g,h,i,j} - Modular arithmetic is a system of arithmetic for
M −J={a,o,u,x,y} integers where numbers “wrap around” upon reading
a certain value. This system was pioneered by Carl
J −M={b,c,d,f,g,h,j} Friedrich Gauss.
Symmetric Difference. Given two sets, their symmetric Arithmetic modulo 𝒏 requires us to evaluate a
difference is the set of elements that belong to either modular expression after using standard rules of
one or the other set but not both. arithmetic. Thus, we perform the arithmetic operation
and then divide by the modulus. The answer is the
A ∆ B = { x | (𝒙 ∈ 𝑨) ⊻ (𝒙 ∈ 𝑩) }
remainder, that is always a whole number less than 𝒏.

xample for symmetric difference of sets:

M={a,e,i,o,u,x,y}

J={b,c,d,e,f,g,h,i,j}
 Example of Inductive Reasoning:

1=1

1+3=4

1+3+5=9

1 + 3 + 5 + 7 = 16

1 + 3 + 5 + 7 + 9 = 25

Deductive Reasoning – is the process of showing that

certain statements follow logically from agreed upon
assumptions and proven facts.

 PROBLEM-SOLVING STRATEGY

Problem 1 (Pattern/Sequence):

Find the next term of the sequence:

𝟕 𝟏𝟗 𝟑𝟏 𝟒𝟑 𝟓𝟓
, , , ,
𝟐 𝟐 𝟐 𝟐 𝟐

Step 1. Understand the Problem.

𝟕 𝟏𝟗 𝟑𝟏 𝟒𝟑 𝟓𝟓
Given: , , , ,
𝟐 𝟐 𝟐 𝟐 𝟐

Required: The next term in the sequence.

Step 2. Devise a plan.

𝟕
1st term:
 PROBLEM SOLVING 𝟐

𝟏𝟗 𝟕
REASONING- This is the practice of stating ideas clearly 2nd term: = +6
𝟐 𝟐
and precisely to arrive at a conclusion. In our life, we
𝟑𝟏 𝟏𝟗
often make judgment and conclusion based on facts 3rd term: = +6
𝟐 𝟐
and observations. These are not always true. 𝟒𝟑 𝟑𝟏
4th term: = +6
𝟐 𝟐
Inductive Reasoning – is the process of gathering
specific information, usually through observation and 𝟓𝟓 𝟒𝟑
5th term: = +6
𝟐 𝟐
measurement and then making a conjecture based on
the gathered information.
Step 3. Carry out the plan.
𝟕 𝟏𝟗 𝟑𝟏 𝟒𝟑 𝟓𝟓
The sequence is: , , , , . There is a
𝟐 𝟐 𝟐 𝟐 𝟐
𝟏𝟐
common difference of 6. Therefore, 6 = , so,
𝟐
𝟓𝟓 𝟏𝟐 𝟔𝟕
the next number in the sequence is + = .
𝟐 𝟐 𝟐

Step 4. Look back.

𝟕 𝟏𝟗 𝟑𝟏 𝟒𝟑 𝟓𝟓 𝟔𝟕
, , , , ,
𝟐 𝟐 𝟐 𝟐 𝟐 𝟐

Problem 2 (Age Problem):

The ages of 3 sisters are 3 consecutive even integers.

If the sum of twice the 1st even integer, 3 times the
2nd even integer, and the 3rd even integer is 34, find
each age.

Step 1. Understand the Problem.

Make sure that you read the question carefully several

times. We are looking for 3 EVEN consecutive integers,
we will let

x = 1st consecutive even integer

x+2 = 2nd consecutive even integer

x+4 = 3rd consecutive even integer

Step 2. Devise a plan.

Step 3. Carry out the plan.

Step 4. Look back.

If we take the sum of two times 4, three times 6, and

8, we do get 34. Therefore, the ages of the three
sisters are 4, 6, and 8.

Other Problem-Solving Strategies:

1. Searching for Patterns

2. Working Backwards

3. Drawing Pictures and Diagrams

4. Making Lists and Tables

*****TRANSLATING ALGEBRAIC EXPRESSIONS*****