Math in Modern World Notes
Math in Modern World Notes
Sequence
- ordered list of numbers called terms, that
may have repeated values.
- Arrangment of sets: definite rule
- List is ordered and follows a certain kind of
pattern
Kinds of Sequence
• Golden Rectangle
• Arithmetic Sequence
- Squares whose sizes surprisingly is also
- every term after the first term is obtained by
behaving similar to the Fibonacci sequence.
adding a constant.
- Checking the common difference between
two consecutive terms.
• Geometric Sequence
- each term after the first term is obtained by
multiplying the preceding term by a nonzero
constant called the common ratio.
• Harmonic Sequence
- Reciprocals form an arithmetic sequence.
• Fibonacci Sequence
- sequence organized in a way a number can be
obtained by adding the two previous
numbers.
Language
- Leonardo Pisano Bigollo – discovered the
sequence while studying rabbits. - systematic way of communication with other
people using sounds or convention symbols.
Mathematical Language
Fibonacci Sequence
- system used to communicate mathematical
- Computation for the nth term
ideas, concepts, and theories among others. It
is distinct and unique from the usual language
that people are used to, and is used to
communicate abstract, logical ideas.
Characteristics of Mathematical Language
• precise
• concise
• powerful
Expressions
- mathematical analogue for “noun”
- correct arrangement of mathematical
symbols to represent a mathematical object
- does not state a complete thought
Sentence
- mathematical analogue for “sentence”
- correct arrangement of mathematical
symbols that states a complete thought
- truth of a sentence
- usually equations denoted with equal sign
Connectives
- “+” and “-”
- Connect objects of a given type to get a
compound object of the same type
Conventions
Sets - Has 1-1 correspondence
- Georg Cantor (1879)
- Collectin of elements
- Well-defined collection of objects, called
elements that share a common characteristic
- denoted with braces [] or curly brackets {}
and label or name the set by a capital letter Equivalent Sets
- Two sets are said to be equivalent if and only
Element of a Set if they have the exact number of element
- Has 1-1 correspondence
- each member of the set
- The notation ∈ means that an item belongs to
a set
Unit Set
- Set that only contains one element
Universal Set
Empty Set
- Set of all elements under discussion
- Set that has no element - Denoted by U
- A={}
- B=∅
- A set of yellow carabaos.
Finite Set
- Elements are countable
Infinite Set
- Elements are not countable and has no end
Joint Sets
- Usually denoted by ellipses
- They have common elements
Cardinality of Set
- Used to measure the number of elements in
the given set
- Similar in countin the total number of
element in a set
Disjoint Sets
Equal Sets
- If they are mutually exclusive or they don’t
- Two sets are said to be equal if and only if have common elements
they have equal number of cardinality and the
element/s are identical
-
Ways of describing a set
Proper Subset
- If and only if every element in A is also in B,
and there exist at least one element in B that
is not in A
-
- -
Number of Subset
- Denoted by 2n
- - Where n is the number of elements of the
given set
- Note that empty set is included
Subset
- All the elements are contained in another set
- Denoted by the symbol ⊆
-
-
Operations on Sets - Elements that are in the universal set but
does not belong to Set A
• Union of Sets
- Set of elements that belong to A or B (or
both)
- A∪B
-
-
-
• Difference of Sets
- A–B
- Elements that are in A but not in B
-
• Complement of Sets
- A’ (A complement or A prime)
Relations and Function - If a R b and b R c then a R c
Relation
- Rule that relates values from a set of values
(domain) to another set of vlues (co-domain) -
- Set of ordered pairs of real numbers (x, y)
such that to each element x of the set X, there Equivalence Relation
corresponds at least one element of the set Y. - Relation that is reflexive, symmetric, and
transitive
-
Function
- Relation is a relation in which every element
is paired with exactly one output.
- Set of ordered pairs of real numbers in which
- no two distinct ordered pairs have the same
Properties of a Relation first component
- x cannot be repeated
• Reflexive
- Every element of A is related to itself
- a R a, for all a ∈ A How function can be represented
- Samples include
o Is equal to (equality) • table of values
o A subset of (set inclusion) • ordered pairs
o Is less than/greater than or equal to • graph
(inequality) • an equation
o Divides (divisibility) •
• Symmetric
- If a R b then b R a
- Is married to
-
• Transitive