Pre-Cal D.

Front 1

Local Maximum

Back 1

check

Front 2

Local Minimum

Back 2

check

Front 3

Abscissa

Back 3

The first coordinate in an ordered pair

Front 4

Ordinate

Back 4

the 2nd coordinate in an ordered pair

Front 5

Extraneous solution

Back 5

Solution of the derived equation in which is not a solution of the original equation

Front 6

Complete Graph

Back 6

graph with all important/relative information labeled

Front 7

x-intercept

Back 7

where graph crosses the x-axis

Front 8

y-intercept

Back 8

where graph crosses the y-axis

Front 9

Closed interval

Back 9

[a,b]={x|a<x<b,a,b,x E Reals}

Front 10

Open interval

Back 10

(a,b)={x|a<x<b,a,b,c E Reals}

Front 11

Multiplication Property for Inequalities

Back 11

V a,b,c E Reals: if a<b and c>0 ac<bc; if a>b and c<0 ac>bc

Front 12

Unit circle

Back 12

circle w/ a radius of 1 unit

Front 13

median (of a triangle)

Back 13

Straight line from the vertex of a triangle to the opposite side

Front 14

Altitude (of a triangle)

Back 14

The Perpendic. Distance from a vertex to the opposite side

Front 15

Relation

Back 15

any set of ordered pairs

Front 16

Domain

Back 16

Set of 1st coordinates of the ordered pairs of a relation

Front 17

Range

Back 17

Set of 2nd coordinates of the ordered pairs of a relation

Front 18

Function

Back 18

Relation where no 2 coordinates have the same 1st cooridinate

Front 19

Vertical line test

Back 19

If a vertical line intersects the graph of a relation in more than 1 point, then the relation is not a function

Front 20

Understood Domain

Back 20

Largest set of real #'s such that the expression makes sense and is real #'s

Front 21

Independent Variable

Back 21

Variable associated w/ the Range

Front 22

Dependent Variable

Back 22

Variable associated w/ the Domain

Front 23

Average rate of change

Back 23

[f(b)-f(a)]/(b-a)

Front 24

Increasing on an interval

Back 24

function f is incresing if For All X1, X2 in the interval w/ X1<X2, f(X1)<f(X2)

Front 25

Decreasing on and interval

Back 25

function f is decreasing if For All X1, X2 in the interval w/ X1,X2, f(X2)<f(X1)

Front 26

Constant on an interval

Back 26

when all values of x give an equal f(x)

Front 27

Local Maximum

Front 28

Local Minimum

Front 29

Even function

Back 29

function f Such that f(-x)=f(x) For All x E Df

Front 30

Odd function

Back 30

function f Such that f(-x)=-f(x) For All x E Df

Front 31

Sum function

Back 31

(f+g)(x)=f(x)+g(x)

Front 32

Difference function

Back 32

(f-g)(x)=f(x)-g(x)

Front 33

Product Function

Back 33

(fg)(x)=f(x)*g(x)

Front 34

Quotient Function

Back 34

(f/g)(x)=f(x)/g(x)

Front 35

Composite function

Back 35

(f@g)(x)=f[g(x)]

Front 36

Quadratic Function

Back 36

function of the form f(x)=ax2+bx+c, a not equal to 0

Front 37

Formula for 1st coordinate of vertex of parabola

Back 37

X=(-b/2a)

Front 38

Quadratic Formula

Back 38

f(x)=a(X-h)2+k, V(h,k), axis of symmetry X=h

Front 39

Discriminant

Back 39

b2-4ac

Front 40

Projectile motion formula

Back 40

S(t)=-16t2+V0t+S0

Front 41

Power Function

Back 41

ax^b

Front 42

Polynomial Function

Back 42

function of the form f(x)=anXn+an-1Xn-1…+a1X+a0 where the coefficients are real #'s and the exponents are whole #'s

Front 43

continuous on an interval (informal def.)

Back 43

pg. 198

Front 44

Zero (of a function)

Back 44

any #Z E Df Such that f(Z)=0

Front 45

Multiplicity of zero z

Back 45

largest exponent k Such that (X-Z)k is a factor of the polynomial

Front 46

Division algorithm

Back 46

Dividend-(Quotient)(Divisor)+Remainder

Front 47

Remainder Theorem

Back 47

If polynomial f(x) is divided by X-C, then the remainder is f©

Front 48

Factor Theorem

Back 48

X-C is a factor of polynomial f(x) iff f(c )=0

Front 49

Decscartes Rule of Signs

Front 50

Rational Zeros Theorem

Back 50

Let f be a polynomial function w/ integral coefficients. If p/q is a rational zero, p must be a factor of the constant term and q must be a factor of the leading coefficient

Front 51

Upper Bound Test

Back 51

Let f be a polynomial function w/ a positive (negative) # c, then the results of synthetically substituting c into f yeilds non-negative (non-positive) #'s, then c is an upper bound for the zeros of f.