Feb 25­3:17 PM

Activity:  Investigating Graphs of Exponential Functions, pg. 465

An Exponential Function involves  the expression bx where the base b is  a positive number other than 1.

x

Feb 25­3:18 PM

1.  Make a table of values:

Graph f(x)=2

What did you observe? • •

y=2x

• 2.  Y­Intercept



3.  Notice the end behavior of the graph:

x→  f(x)→  x→­  f(x)→  4.  An Asymptote is a line that a graph  approaches as you move away from the origin.

y=

Feb 25­3:18 PM

Feb 25­3:24 PM

1

Exponential GROWTH Function:

y=abx

Graph   y = ­ (3/2)x

if a>0 and b>1.   **Same characteristics of the graph 7=a*2x.

•Graph y = (½) 3x • Plot (0, ½) and (1, 3/2) • Then, from left to right, draw a curve that  begins just above the x­axis, passes thru the 2  points, and moves up to the right

Feb 25­3:34 PM

To graph a general exponential function,

Feb 25­3:40 PM

Graph y=3*2x­2 +1

y=a*bx­h+k Graph y=3*2x­1 ­ 4 1.  Start by sketching the graph of y=3*2x 2. Translate the graph (horizontal and vertical shifts)

Feb 25­3:41 PM

Feb 25­3:44 PM

2

USING EXPONENTIAL GROWTH MODELS When a real­life quantity increases by a fixed percent each year (or other time period), the amount y of  the quantity after t years can be modeled by this equation:

y=a(1+r/n)nt In this model,  • a is the intial amount,  • r is the percent increase expressed as a decimal, and  • n is the number of times the rate is compounded per year. EXAMPLES: • In 1980 wind turbines in Europe generated about 5 gigawatt­hours of energy.  Over the next 15 years,  the amount of energy increased by about 59% per year.  Write a model giving the amount E (in  gigawatt­hours) of energy t years after 1980.

• You buy a commemorative coin for $110.  Each year t, the value V, of the coin increases by 4%.

Feb 25­3:45 PM

3

Graph f(x)=2x

Make a table of values: 2. YIntercept. 3. Notice the end ... In 1980 wind turbines in Europe generated about 5 gigawatthours of energy. Over the next 15 years,.

214KB Sizes 1 Downloads 306 Views

Recommend Documents

Knowledge Graph Identification
The web is a vast repository of knowledge, but automatically extracting that ... Early work on the problem of jointly identifying a best latent KB from a collec- ... limitations, and we build on and improve the model of Jiang et al. by including ....

Graph Theory.PDF
(c) Find the chromatic number of the Graph 4. given below. If the chromatic number is k, ... MMTE-001 3. Page 3 of 5. Main menu. Displaying Graph Theory.PDF.

Graph Algorithms
DOWNLOAD in @PDF Algorithms in C++ Part 5: Graph Algorithms: Graph Algorithms Pt.5 By #A#. Download EBOOK EPUB KINDLE. Book detail.

Robust Graph Mode Seeking by Graph Shift
ample, in World Wide Web, dense subgraphs might be communities or link spam; in telephone call graph, dense subgraphs might be groups of friends or families. In these situations, the graphs are usually very sparse in global, but have many dense subgr

Graph Coloring.pdf
Sign in. Loading… Whoops! There was a problem loading more pages. Retrying... Whoops! There was a problem previewing this document. Retrying.

Graph Theory Notes - CiteSeerX
To prove the minimality of the set MFIS(X), we will show that for any set N ..... Prove that for a non-empty regular bipartite graph the number of vertices in both.

Graph Theory Notes - CiteSeerX
Let us define A = {v1,...,vm} and B = V (G)−A. We split the sum m. ∑ i=1 di into two parts m. ∑ i=1 di = C + D, where C is the contribution of the edges with both ...

Graph Theory.pdf
Page. 1. /. 2. Loading… Page 1 of 2. Page 1 of 2. Page 2 of 2. Page 2 of 2. Main menu. Displaying Graph Theory.pdf. Page 1 of 2.

Graph representations
Models for small world? ▫ Erdos-Renyi model. ▫ n nodes, each node has a probability p of ... Barabasi-Albert model. ▫ Graph not static, but grows with time.

graph-contraction.pdf
... loading more pages. Retrying... graph-contraction.pdf. graph-contraction.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying graph-contraction.pdf.

Graph Theory.pdf
Define proper coloring and determine chromatic number of the graph given below. (02). b. State Hall's matching condition. (02). c. For the bipartite graph given ...

graph-search.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. graph-search.

Graph Algorithms
Read Algorithms in C++ Part 5: Graph Algorithms: Graph Algorithms Pt.5 - Online. Book detail. Title : Read Algorithms in C++ Part 5: Graph q. Algorithms: Graph ...

Discrete Graph Hashing - Sanjiv Kumar
IBM T. J. Watson Research Center. ‡ ... gantic databases. ..... We call the code learning model formulated in Eq. (4) as Discrete Graph Hashing (DGH). Because.

Polar Graph Paper.pdf
Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Polar Graph Paper.pdf. Polar Graph Paper.pdf. Open. Extract.

On Efficient Graph Substructure Selection
Abstract. Graphs have a wide range of applications in many domains. The graph substructure selection problem is to find all subgraph isomor- phic mappings of ...

Unbalanced Graph Cuts
tention recently, in the context of analyzing social networks and the World ..... [10]. We consider the converse of the densest k-subgraph problem, in which the.

Graph Information Ratio
Abstract—We introduce the notion of information ratio. Ir(H/G) between two (simple, undirected) graphs G and H, which characterizes the maximal number of source symbols per channel use that can be reliably sent over a channel with confusion graph H

Practice Graph Paper.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Practice Graph ...

Graph Theory Notes - Semantic Scholar
The degree of v ∈ V (G), denoted deg(v), is the number of edges incident with v. Alterna- tively, deg(v) = |N(v)|. Definition 3 The complement of a graph G = (V,E) is a graph with vertex set V and edge set. E such that e ∈ E if and only if e ∈

Graph Paper Full.pdf
TrigCheatSheet.com. Page 1 of 1. Graph Paper Full.pdf. Graph Paper Full.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Graph Paper Full.pdf.

Unbalanced Graph Cuts
mial time. Since then, many problems have been shown to reduce to graph cut problems ...... Technical Report 2002-06, NEC, Princeton, 2002. 16. L. Ford and ...

Discrete Graph Hashing - Semantic Scholar
matrix trace norm, matrix Frobenius norm, l1 norm, and inner-product operator, respectively. Anchor Graphs. In the discrete graph hashing model, we need to ...