0% found this document useful (0 votes)
27 views31 pages

Mathematical Language & Symbols (Prelim Coverage)

mathematics in the modern world

Uploaded by

Allan T. Babad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views31 pages

Mathematical Language & Symbols (Prelim Coverage)

mathematics in the modern world

Uploaded by

Allan T. Babad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 31

MATHEMATICAL

LANGUAGE & SYMBOLS


2.1 CHARACTERISTICS OF MATHEMATICAL LANGUAGE
MATHEMATICAL LANGUAGE:
 IS THE SYSTEM USED TO COMMUNICATE MATHEMATICAL IDEAS.
 THIS LANGUAGE CONSISTS OF SOME NATURAL LANGUAGE USING
TECHNICAL TERMS(MATHEMATICAL TERMS) AND GRAMMATICAL
CONVENTIONS. THAT ARE UNCOMMON TO MATHEMATICAL DISCOURSE,
SUPPLEMENTED BY A HIGHLY SPECIALIZED SYMBOLIC NOTATION FOR
MATHEMATICAL FORMULAS.
2.2 EXPRESSION VS SENTENCES
An Expression or mathematical expression is a finite
combination of symbols that is well defined according to
rules that depend on the context.
Examples: 3x , x + 2y
A Sentence or mathematical sentence makes a statement
about two expressions , either using numbers, variables or a
combination of both.
Examples: 2 x 3 = 6 , 24 / 8 = 3
2.3 CONVENTIONS IN THE MATHEMATICAL
LANGUAGE
 A Mathematical convention is a fact, name, notation, or
usage which generally agreed upon by mathematicians.
 Examples:
 Principles of MDAS ( multiplication, division, addition &
subtraction).
 Principles of PEMDAS ( parenthesis, exponent,
multiplication, division, addition and subtraction.
Perform Operations on Mathematical Expressions

P Parentheses first
E Exponents (ie Powers and Square Roots, etc.)
MD Multiplication and Division (left-to-right)
AS Addition and Subtraction (left-to-right)

Examples:
= 4×8 = 32
1. 4 × (5 + 3)

2. 5 × 22 = 5×4 = 20

3. 2 + 5 × 3 = 2 + 15 = 17

4. 30 ÷ 5 × 3 = 6×3 = 18
THE LANGUAGE OF SETS
Set:
Is a collection or a group of well defined distinct objects. Word
set as a formal mathematical term was introduced in 1879 by
Georg Cantor ( 1845 – 1918).
Examples of sets:
1. The set of counting numbers less than 20.
2. The set of whole numbers less than 10.
3. The set of vowels in the English alphabet.
4. The set of prime numbers less than 19.
TWO WAYS OF DESCRIBING A SET
1. Roster Method which is done by listing or tabulating the
elements of a set.
Example;
2. A = 1,2,3,4,5,6,7
3. B = -5,-4,-3,-2,-1
4. C = 1,2,3,4,5…
2. Set – Builder Method which is done by stating or
describing the common characteristics of the elements of
the set.
1. A = X / X is an integer greater than 0 but less than 8
2. B = X / X is an integer less than 0 but greater than -6
3. C = x /x is a counting number
1. Read as A equals the set of all x’s, such that x is an
integer greater than 0 but less than 8.
 Three dots ( …) called ellipsis indicates that there are elements
in the set that are not written down.
 Note that braces are used, not parentheses ( ) or
brackets to enclose the elements of a set.

Kinds of Sets:
1. Finite sets – have a definite limited number of elements.
Example: A= 1,2,3,4,5

2. Infinite sets - Have unlimited number of elements.


Example : B = 1,2, 3,5,7,11,…
3. Null set = a set with no element. Also called empty set.
symbol Ǿ or .
4. Equivalent sets – the number of elements in both sets are equal.
Example: A = a,b,c and B= 1, 2 ,3
5. Equal sets – Two sets are equal if both sets have the same
elements. A = 5,6,7 and B = 5,6,7
6. Disjoint sets = Two sets do not have a common elements .
Example: A = 1,2,3 and B= 4,5 ,6
7. Intersecting sets = Two sets have a common elements.
Example: A = 1,2,3,4 and B = 4,5,6,7
8. Universal sets = is a totality of elements.
9. Subsets = every element of A is an element of another set.
If A = a,b,c and B = c . Set B is a subset of A.
CARTESIAN PRODUCT : is product of two sets.
“ set A cross set B “.
A= 1,2 B= 4,5,6
AXB= ( 1,4) , (1,5) , ( 1,6), (2,4) , ( 2,5) , (2,6)
Basic Operations on sets:
1. The Union: U
The union of A and B: A U B
Given: Set A = { 1,2,3,4,5}, Set B = { 2,3,4,5,6,7}
A U B = { 1,2,3,4,5,6,7}
2. The intersection:
The intersection of A Ռ B
Given: Set A = { 1,2,3,4,5}, Set B = { 2,3,4,5,6,7}
A Ռ B = { 2,3,4,5 }
3. The difference:
The difference of A and B : A – B
Set A = { 1,2,3,4,5,6,7} Set B = { 2,4,6,8,10}

1. A – B = { 1,3 ,5 ,7}

2. B – A = { 8, 10 }
4. Universal set:
Set A = { 1, 2, 4,6,8}
Set B = { 2,3,,4,9}
Set C = { 2, 6, 8}
Find:
1. Set U
5. The complement of a set:
is the set of elements found in the universal set, but
not found in the given set. ( A’ or A prime).
Set U = { 1,2,3,4,5,6,7,8,9,10}
Set A = { 2,4,6,8}
A’ = { 1,3,5,7,9,10}
Enumerate the ff. relationships among the given sets:
Given:
Set U = { 3,4,5,6,7,8,9,10,11,12,13,14,15}
Set A = { 3,5,7,9} , set B = { 4,6,8,10} , set C = { 5,10,15}

1. A U B 8. B’ 15. ( B U C )’
2. A U C 9. C’ 16. (A Ռ B)’
3. B U C 10. A – B 17. ( A U B U C)’
4. A Ռ B 11. A –C 18. A’ UB’
5. A Ռ C 12. B – C 19. ( B Ռ C)’
6. B Ռ C 13. ( A U B)’ 20. A Ռ B Ռ C
7. A’ 14. ( A U C )’
Given the elements of the sets.
Set X = { 5,6,7,8,9}
SET Y = { 7, 8,11,12}
SET Z = { 8,9,10,11}
Give the operations involved.
1. { 5,6,7,8,9} 6. { 7,8}
2. {7,8,11,12} 7. { 8}
3. { 8,9,10,11} 8. { 5,6,9}
4. { 8,11} 9. { 11,12}
5. { 8,9} 10. { 9,10}
THE LANGUAGE OF RELATIONS AND FUNCTIONS
FUNCTIONS:
 A variable Y is said a function of X, if each value
of X, there is corresponds exactly one value of Y.
 A function may be written as “ y is function of x or
y” = f(x).
Read as y equals f of x.
Evaluation of a function:
To evaluate a function means to substitute a given
value to the variable , then solve for y.
1. Evaluate f(x) = -2x +2 when x = 5
2. Evaluate f(x) = 1 + x 1 + x when
x=¾
3. when x = 4
RELATION:
A relation from X to Y is a set of ordered pairs ( X,Y) such that to each
x.
In general , a relation is any set of ordered pairs.
Example 1. Given: R = ( 1,4) , ( 2,5 ) , (3, 6) , ( 4, 7 )
 Domain: 1,2,3,4
 Range: 4,5,6,7
LANGUAGE OF BINARY OPERATIONS
 The study of algebraic structures focuses on
investigating sets associated by single
operations that satisfy certain reasonable
axioms.
 Four properties:
 Closure property if any two elements are
combined using the operation , the result must
be an element of the set.
 1. a x b = c for all a,b,c ε R.
2. 3 x 2 = 6
3. 6 + 8 = 14
 Associative property
1. ( a . b ) . c = a . ( b . c)
2. ( 2 . 3 ) . 4 = 2 . ( 3 . 4)
3. 3 + (2 + 4 ) = 3 + 6 = 9
 Identity property
1. 3 + 0 = 3 2. 6 + 0 = 6
 Inverse property
 1. 4 + ( -4) = 0
 2. 10 + ( -10 ) = 0
THREE OF THE MOST IMPORTANT KINDS OF
SENTENCES IN MATHEMATICS
UNIVERSAL STATEMENT
CONDITIONAL STATEMENT
EXISTENTIAL STATEMENT
The Universal Statement- says that a certain property is true for
all elements in a set.

Example:
1. All positive numbers are greater than zero.
2. All negative numbers are lesser than zero.
Conditional Statement:
Says that if one thing is true then something also has to be true.
Example:
1. If 378 is divisible by 18, then 378 is divisible by 6.
2. If 4 times 5 are factors of 20 , then 10 times 2 are factors of
20.
Existential Statement:
Says that there is at least one thing for which the property is
true.
Example:
1. Either 3 times 2 equals 6 or equals 8.
2. Either 8 plus 10 equals 16 or equals 18.
Universal Conditional Statements:
Universal statements contain some variation of
the words “ for all” .
Conditional statements contain versions of the
words “ if – then”.
Universal Conditional Statements:
> is a statement that both universal and
conditional.
Example:
1. Every dog is an animal, if browny is a dog, then
browny is an animal.

For all real numbers x, if x is greater than 2, then is


greater than 4.
a. If a real number is greater than 2, then its square
is _____.
b. If x ______, then_______.
Universal Existential Statements:
Is a statement that is universal because its first part
says that a certain property is true for all objects of a
given type and it is existential because its second part
asserts the existence of something.
Example:
1. Every real number has an additive Inverse.
2. Every pot has a lid.
a. All pots _____.
b. For all pots P, there is ______.
c. For all pots P, there is a Lid L such that _____.
Solution : a, b, c.
a. have lids
b. a lid for P
c. L is a lid for P.

Evaluation:
Fill in the blanks to rewrite the following statement:
All bottles have cap.
d. Every bottle _____.
e. For all bottles B, there_______.
f. For all bottles B. there is a cap C such that_______.
Existential Universal Statements:
> is a statement that is existential because its part asserts
that certain object exists and is universal because its
second part says that the object satisfies a certain property
for all things of a certain kind.
Example:
1. Some positive integer is less than or equal to every
positive integer.
Or : There is a positive integer m that is less than or equal
to every positive integer.
Or : There is a positive integer m such that every positive
integer is greater than or equal to m.
Or: There is a positive integer m with the property that for
all positive integers n, m < n.
Fill in the blanks to rewrite the following statement in
three different ways:
There is a person in my class who is at least as old as
every person in my class.
a. Some_____ is at least as old as_______.

b. There is a person p in my class such that p is


______.

c. There is a person p in my class with the property


that for every person q in my class, p is ______.
Solution;
a. Person in my class, every person in my class.
b. at least as old as every person in my class.
c. at least as old as q.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy