Professional Documents
Culture Documents
Math01 Midterms
Math01 Midterms
FIBONNACI SEQUENCE – list of ordered natural number MATHEMATICAL MODELLING – represent real world situations for the understanding
of how a specific system works
Leonardo “Fibonnaci” Pisano MATH LANGUAGE – a language that uses words, technical terms, abstract codes
Book Liber Abaci (book of counting or calculation) and grammatical conventions peculiar to mathematical discourse
Rabbit breeding problem
MATH EXPRESSION – an analogue of an English noun that involves the correct
arrangement of mathematical object of interest
F16 = F15 x 1.618
SET - a mathematical expression that refers toa well-defined collection of distinct
objects
MATH01 MIDTERMS
CHARACTERISTICS OF MATH LANGUAGE
1. PRECISE – able to make very fine or very detailed distinctions
2. CONCISE – one can say things briefly but substantially
3. POWERFUL – combination of above characteristics
MATH01 MIDTERMS
LOGIC – “logos” means an idea, argument or reason. Study of correct reasoning. iv. CONTRAPOSITIVE – If I do not wash the car, then today is
Scientific method of judging the truth or falsity of statements not Sunday
5. BIOCONDITIONAL PROPOSITION – p q ((p if and only if q)
PROPOSITION
a. If both p&q are TRUE and FALSE = TRUE
a statement that is either true or false but not true and false under the
b. p -T/F and q- T/F = FALSE
same condition
A declarative sentence
Represented by p,q and r (sentential variables)
QUANTIFIERS – constructs that specify the quantity of specimens in the domain of
COMPOUND PREPOSITION discourse that satisfy a formula
formed by combining two or more simple statements
formed with the use of logical connectives like “and”, “or”, “if”, and “if… 2 KINDS
and only if” 1. UNIVERSAL QUANTIFIER – symbolized by means “for all, for every, for
any”
TYPES OF COMPOUND PREPOSITION 2. EXISTENTIAL QUANTIFIER – symbolized by means “for some, there
1. CONJUNCTION – p^q (p and q) called simple conjunction exists”
a. Both p & q are TRUE = TRUE
b. p -T/F and q- T/F = FALSE QUANTIFIED STATEMENT – statement involving a quantifier. Has a truth value
c. p & q are FALSE = FALSE
2. DISJUNCTION – p q (p or q)
a. p&q are both TRUE = TRUE
b. p -T/F and q- T/F = TRUE
c. p&q are both FALSE = FALSE
3. NEGATION – denial of a statement
a. If the statement is true, make it false
b. If the statement is false, make it true
4. CONDITIONAL PROPOSITION – p q (if p, then q)
a. p – antecedent
b. q – conclusion
c. implication follows the conclusion (q)
d. if both p&q are TRUE AND FALSE = TRUE
i. if today is Sunday, then I will wash the car
ii. CONVERSE – if I wash the car, then today is Sunday
iii. INVERSE – if today is not Sunday, then I will not wash the
car