Professional Documents
Culture Documents
Genmath MT 2Q
Genmath MT 2Q
elements of each ordered pair If they yield the same answer, they are
- inverse of a certain operation inverses of each other.
1. ADD - SUBTRACT
2. MULTIPLY - DIVIDE - If it is not a one-to-one function, there is no
3. PERFECT SQUARE - SQRT inverse function. Its inverse won’t be
considered a function.
Steps to Find the Inverse
Given: 𝑓(𝑥) = 8𝑥 − 1 EXPONENTIAL FUNCTIONS
1. Switch x & y Exponential Function
𝑦 = 8𝑥 − 1, 𝑥 = 8𝑦 − 1 - has the variable in the exponent, not in
2. Solve y the base
𝑥 3
𝑥+1
=
8𝑦
; 𝑦 =
𝑥+1 - 3 is an example, not 𝑥
8 8 8
- General Form:
3. Change the functional notation 𝑥
𝑥+1 𝑥+1 −1 𝑥+1 𝑓(𝑥) = 𝑏 , 𝑏 > 0
𝑦 = 8
𝑡𝑜 𝑓(𝑥) = 8
/𝑓 (𝑥) = 8
Information to Remember:
- Only one-to-one functions have inverses
which are also functions. You can find out if a
function is one-to-one through Horizontal Line
Test.
One-to-one functions
𝑓(𝑥1) = 𝑓(𝑥2), 𝑖𝑚𝑝𝑙𝑖𝑒𝑠 𝑡ℎ𝑎𝑡 𝑥1 = 𝑥2
FORMULA
𝑟 𝑛𝑡
𝐴 = 𝑃(1 + 𝑛
) , where
P = # of dollars (present value)
r = rate (divide by 100 to get decimal form)
n = # of interest payments per year
- monthly = 12 payments/y
- semi-monthly = 24 payments/y
- quarterly = 4 payments/y
- semi-annually = 2 payments/y
- annually = 1 payment/y
t = # of years
A = # of dollars (future value)
Information to Remember:
- Exponential functions with POSITIVE BASES
GREATER THAN 1 have graphs that are
INCREASING.
- a < b; not a proposition
Propositional variable
- represented by a lower case of capital
letter in the English alphabet
Examples:
- P: “1 is an even number”; a propositional
variable
Propositional Form
- an assertion which contains at least one
propositional variable
- appears as a sequence; symbols
containing propositional variables and
logical connectives or connectors
Primitive Proposition
- can not be broken down in to simple
proposition
Composite or Compound Proposition
- can be broken down in to two or more
primitive propositions
FORMULA
𝑟𝑡
𝐴 = 𝑃𝑒 , where
P = # of dollars (present value)
e = 2.71828169…
r = rate (divide by 100 to get decimal form)
t = # of years Negation
A = # of dollars (future value) - any statement P which can be formed
by using the word ‘not’; symbol is ~P
PROPOSITIONS Disjunction
Propositions (Statements) - denoted by P v Q, read as “P or Q”
- A sentence which is either TRUE or whose truth value depends on P or Q
FALSE but not both. Conjunction
Examples: - denoted by P ^ Q, read as “P and Q”
- 3 + 5 = 8; proposition whose truth value depends on P and Q
Implication
P Q PvQ
- conditional statements which are
sometimes called if-then statements T T T
- “if” part is hypothesis, “then” is
F T T
conclusion
- represented by P -> Q T F T
Grouping Marks F F F
T T T
F T F
T F F
F F F
Translating English Statements to
Propositional Forms Implication - will be false if true hypothesis is
followed by a false conclusion
P Q P→Q
T T T
- G v ~A F T T
T F F
- A → (G v T) F F T
F T
Contingency
- a compound statement that can either
be true or false, depending on the truth
values of the propositional variables;
are neither a tautology nor a
contradiction