REVIEWER IN MMW
REVIEWER IN MMW
REVIEWER IN MMW
MATHEMATICS IS….
-A language
PATTERNS
-Is an arrangement which helps observers anticipate what they might or what
may happen next.
Examples of Pattern
Logic Pattern
Number Pattern
Geometric Pattern
Word Pattern
NUMBER PATTERN
1. 1, 3,5,7,9,___, ____, _
4. 448,224,112,56,28,____,____
if you divide 448 by 2, you’ll get 224; divide 224 by 2, you’ll have 112;
112 divide by 2 is 56 and so on. This is also saying that you multiply the
1st number by ½ or the common ratio is ½.
ARITHMETIC SERIES
If the terms of a sequence differ by a constant, we say the sequence
is arithmetic. If the initial term of the sequence is a and the common
difference is d, then we have,
Formula: an = a + d (n-1).
GEOMETRIC SERIES
The sum of an arithmetic series is found by
multiplying the number of terms times the average of the first and last terms.
OPERATIONS ON SETS
UNION - The union of A and B, denoted A∪B, is the set of all elements x
(A∪B) ̴ (A⋂B).
Disjoint Sets. Two sets are called disjoint (or non-intersecting) if and only
Ordered Pair. In ordered pair (a,b), a is called the first component and b is
called the second component. In general, (a, b) ≠ (b, a).
a. AxB
AxB = {(2, 7), (2, 8), (3, 7), (3, 8), (5, 7), (5, 8)}
b. BxA
BxA = {(7, 2), (7, 3), (7, 5), (8, 2), (8, 3), (8, 5)}
c. AxA
AxA = {(2, 2), (2, 3), (2, 5), (3, 2), (3, 3), (3, 5), (5, 2), (5, 3),
(5,5)}
Solution:
Let n(U) be the set of all members,
n(A∪B) be the set of all members, 45
n(A) be the set of all members owning a desktop,28
n(B) be the set of all members owning a laptop, 37
n(A⋂B) be the set of all members owning a desktop and a laptop.
n(A∪B)= n(A)+ n(B)- n(A⋂B)
45=28+37 - n(A⋂B)
45=65 - n(A⋂B)
n(A⋂B)=65 – 45 = 20
n(I) = 19, n(F) = 14, n(G) = 10, n(I ⋂ F) = 6, n(F ⋂ G) = 5, n(I ⋂ G) = 3, and
2 of the boutiques import their garments from Italy, France, and Germanv
n(I ⋂ F ⋂ G)=2 y.
a. Determine the number of boutiques which does not purchase any garments
from the three countries?
n(I U F U G)= n(I)+ n(F)+ n(G) - n(I ⋂ F) - n(F ⋂ G) - n(I ⋂ G) + n(I ⋂ F ⋂
G)
Here, n(I) = 19, n(F) = 14, n(G) = 10, n(I ⋂ F) = 6, n(F ⋂ G) = 5, n(I ⋂ G) =
3, and n(I ⋂ F ⋂ G)=2.
Thus, since
n(I U F U G)= 19 + 14 + 10 - 6 - 5 - 3 + 2 = 31
There are 31 boutiques that purchase their garments from at least one of
the three countries.