MMW Pointers Midterm
MMW Pointers Midterm
Lesson 1.1
Starfish
MODULE 2
The ratio of successive Fibonacci numbers The language of mathematics makes it easy to
approach the number ϕ (Phi), also known as express the kinds of thoughts that
the Golden Ratio. This is approximately equal mathematicians like to express.
to 1.618. 1. precise (able to make very fine distinction)
2. concise (able to say things briefly); and
3. powerful (able to express complex thoughts
with relative cases).
MATHEMATICAL SENTENCE
B = { a, b, c, d }
C = { 2, 4, 6, 8, … }
d. A set of an integers.
ELEMENT OF A SET
1 ϵ A; 3 ϵ A; 5 ϵ A
Illustration:
LESSON 2.2 FOUR BASIC CONCEPTS
A = { 1 }; B = { c }; C = { banana }
SETS AND SUBSETS
Empty set or Null set; ∅
THE LANGUAGE OF SETS
Empty or null set is a set that has no element.
A set is a collection of well-defined objects.
Illustration:
A ={}
NOTE: A set is denoted with braces curly brackets { }
and label or the set by a capital letter such as A, B, A set of seven yellow carabaos.
C,…etc.
Finite set
A = { 1, 2, 3, 4, 5 } B = { a, b, c, d, e }
SUBSETS
Universal set
A subset, A ⊆ B, means that every element of
The universal set U is the set of all elements
under discussion. A is also an element of B.
If x ϵ A, then x ϵ B.
Illustration: In particular, every set is a subset of itself, A ⊆
A.
A set of an English alphabet
U = {a, b, c, d, …, z}
A subset is called a proper subset, A is a Example 2:
proper subset of B, if A ⊂ B and there is at
If A = {1, 2, 3} and B = {4, 5} , then A - B =
least one element of B that is not in A:
{1, 2, 3} .
If x ⊂ A, then x ⊂ B and there is an element b
such that b ϵ B and b ∉ A. Example 3:
NOTE: The empty set. Or {} has no elements and is a If A = {a, b, c, d } and B = {a, c, e } , then A - B
subset of every set for every set A, A ⊂ A. = {b, d } .
ORDERED PAIR
OPERATION ON SETS
1. Union of Sets
Example 1:
{(0, -5), (1, -4), (2, -3), (3, -2), (4, -1), (5, 0)}
RELATION
6. Proof by Contradiction
CAYLEY TABLE
PROPOSITION
A binary operation on a finite set (a set with a
limited number of elements) is often When we say proposition, it is a declarative
displayed in a table that demonstrates how statement that is true or false but not both.
the operation is performed.
Different propositions that can be also said as logical
EXAMPLE connectives are as follows:
Negation
Conjunction
Disjunction
Conditional
Biconditional
Corollary
LESSON 2.3 LOGIC AND FORMALITY Lemma
WHAT IS LOGIC? Conjecture
One of the major parts of formality in The conclusion formed by using inductive
mathematics is the definition itself. When we reasoning is often called a conjecture, since it
say definition, it is a formal statement of the may or may not be correct or in other words,
meaning of a word or group of words and it it is a concluding statement that is reached
could stand alone. using inductive reasoning.
Uses a set of specific observations to reach an
THEOREM overarching conclusion or it is the process of
A theorem is a statement that can be recognizing or observing patterns and drawing
demonstrated to be true by accepted a conclusion.
mathematical operations and arguments. Process of reaching a general conclusion by
examining specific examples.
PROOF
NOTE: Inductive reasoning does not guarantee a true
Proof is a rigorous mathematical argument result, it only provides a means of making a
which unequivocally demonstrates the truth conjecture.
of a given proposition.
The different methods on proof are as follows:
1. Deductive
reasoning to solve a problem)
Example 1.
SOLUTION:
MODULAR ARITHMETIC
Example:
13 ≡ 6 (mod 7)
20 ≡ 6 (mod 7) add 7 to 13
12 ≡ 7 (mod 5)
17 ≡ 7 (mod 5) add 5 to 12
Example:
D. Additive and Multiplicative
(3 + 5) ≡ 0 mod 8.
C. Multiplication Modulo n
345 = 11•31 + 4
Hence, (15•23)mod 11 = 4