 Shuffle Toggle OnToggle Off
 Alphabetize Toggle OnToggle Off
 Front First Toggle OnToggle Off
 Both Sides Toggle OnToggle Off
 Read Toggle OnToggle Off
Reading...
How to study your flashcards.
Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key
Up/Down arrow keys: Flip the card between the front and back.down keyup key
H key: Show hint (3rd side).h key
A key: Read text to speech.a key
Play button
Play button
28 Cards in this Set
 Front
 Back
solve

e.g. for variable in equation


evaluate

the expression


simplify

e.g. by combining like terms


relation

set of ordered pairs


standard form

Ax + By = C


mapping diagram

shows how domain is paired with range


domain

relation of set of all first coordinates (Xs)


range

relation of set of all second coordinates (Ys)


slope formula

x^2x^1/y^2y^1


constant of variation

k in 'y=kx'


greatest integer function

f(x)=[a] <greatest integer no greater than function


[3.2]

3


step functions

look like steps on graph, greatest integer function is subset of these


[3.4]

4


You are given a table of values. How do you know if its a direct variation or not? How can you tell what the constant of variation is?

constant of variation = y/x
direct variation if constant of variations are all same in every ordered pair and passes through origin 

consistent dependent system

infinite amount of solutions
same line {(X,Y)  y=mx+b} e.g. when solving, yield 0=0 

graphically, solution to system of equations in three variables

intersection of three planes


consistent independent system

unique solution


inconsistent system

no solutions
parallel null set 

integers

{...2, 1, 0, 1, 2...}


whole numbers

{0, 1, 2, 3, 4, 5...}


digits

{0, 1, 2, 3, 4, 5, 6, 7, 8, 9


rational numbers

terminate or repeat


irrational numbers

do not terminate or repeat


real numbers

are basically everything


imaginary numbers

just don't work


linear programming method

1) Identify variables.
2) Make constraint inequalities. 3) Graph these. (Simplify y if needed) 4) Find corners of intersection. These are the vertices of the feasible region 5) Make an objective function. P(x,y) = __x + __y 6) Plug in the ordered pairs of the corners. 7) The highest amount yielded is the optimum. 

feasible region

optimum for both variables
