Lab 4. Recall, from last lab the commands Table[], ListPlot[], DiscretePlot[], and Limit[]. Go ahead and review them now you'll be using them soon.

Size: px
Start display at page:

Download "Lab 4. Recall, from last lab the commands Table[], ListPlot[], DiscretePlot[], and Limit[]. Go ahead and review them now you'll be using them soon."

Transcription

1 Calc II Page 1 Lab 4 Wednesday, February 19, :01 PM Recall, from last lab the commands Table[], ListPlot[], DiscretePlot[], and Limit[]. Go ahead and review them now you'll be using them soon. Use the material from the last lab to generate the recursive series: Generate the first 30 terms using the Table[] command Generate the first 30 terms as decimal approximations. Create a DiscretePlot[] of the absolute value of the difference between the terms and looks like this:. My graph Obviously it converges fairly quickly. Generate the Discrete Plot of the Log[10,<expression>] (we are making the log base 10 for ease of interpretation). Mine looks like this: Wow! That's a nice looking graph. The graph stops around 21-- but that's just because we have reached the limit of what Mathematica can determine as a difference... so the absolute value of the difference evaluates to 0 in Mathematica and the Log[] of 0 is undefined, so the graph quits. Let's approximate the slope of this graph: (that's change in y from x=5 to x=6 divided by a change in x of 1). Other sample points will give us similar values. If we wanted to do this correctly we would perform a linear regression-- but that's a

2 Calc II Page 2 topic for another class. So, if we ball park things... every 4 terms improves out accuracy by around 3 decimal places. Not too shaby! The 15th term in the sequence is: And according to our graph above, that's accurate to around +/- 1 in the 11 decimal place. So we should definitely get accuracy up to 10 places: let's check: No on to series Okay.. Moving along. In the last lab you dealt primarily with sequences (and a little bit of arc length). Now we are going to start to do some work with series. Recall that there are THREE components to keep in mind when dealing with series: The sequence of terms ( ) The series The sequence of partial sums ( ) Let's consider the geometric series. The key things to notice are the POWER is n-1 the constant term is 5 the base is 2/3 Use Table[] to generate the first 10 terms in the sequence (NOTE: this is the first 10 terms-- not the first 10 partial sums): You know that as n goes to infinity the expression goes to 0, and so goes to 0 as well. If we want to have any hope of the sequence of partial sums converging (and hence the series) then the sequence of terms MUST go to 0. FIRST TEST OF DIVERGENCE OF A SERIES: If the sequence of terms does NOT go to 0 then the series diverges. It's not immediately obvious from the output that the sequence is decreasing. Let's turn those fractions into decimal approximations with 3 decimal places: Test your understanding of the material from the last lab and produce a graph that shows the first 10 terms. My graph looks like this:

3 Calc II Page 3 It is important to remember that the convergence (or divergence) of a series is determined by the behavior of its sequence of partial sums, so let's see what we can do about looking at the terms in the sequence of partial sums. The main Mathematica function you need for partial sums is the aptly named Sum[] function. Here's how to interpret them: Sum[5(2/3)^(n-1),{n,4,10}] Notice the how each piece aligns (I'll color code): Sum[5(2/3)^(n-1),{n,4,10}] By and large we care about the series from to, but the option for any sort of partial sum is available. Let's see if Mathematica is smart enough to calculate the partial sum from 1 to n. To make this easy to follow I need to use a different variable: Sum[5(2/3)^(i-1),{i,1,n}] I get the rather unenlightening: However, if we force Mathematica to make it look nicer: then we find something that's a bit easier to understand. Is that what we should expect? According to the formula we learned in class for the nth partial sum we get: In our example above,, and. So we should get: So... does this equal what we found above? And if you look at that carefully you will see it is equivalent to the value suggested by Mathematica... so

4 Calc II Page 4 yay! The next function we want to use (again) is Limit[]. From class we know that the limit as n goes to infinity of a geometric series is. Since and, then we should get. Can Mathematica do as well? Well... Wasn't that handy? Let's try a different series. To begin with, let's define the sequence of terms and store them in a function called. Let's represent the terms in the terms sequence: this way: f[x_]:=sqrt[x+2]-sqrt[x]. Go ahead and do that (you might want to clear the definition of f first just to make sure there aren't any lingering 'special cases' floating around: Clear[f] f[x_]:=sqrt[x+2]-sqrt[x] Use Table[] to generate the 100 through the 110th term. Your output should look something like this: UseDiscretePlot[] to graph this subsequence: It certainly looks as if it is decreasing. Now let's consider the series that is formed from these terms: Using the terminology we developed in class, we define the nth partial sum for this series: We can represent this in Mathematica as follows: S[n_] := Sum[f[x], {x, 1, n}] Now let's use DiscretePlot[] to look at the first 100 partial sums as a graph:

5 Calc II Page 5 Looks as if this series is going to diverge. But can we be certain? Poke around a little for example, try looking at the graph of to (That shouldn't take too long to calculate). Doesn't look promising does it? There are several approaches we could take to convince ourselves this series diverges, but we won't see them for awhile, so we will have to be a little more imaginative. See what happens as you list out several of these terms. Let's figure out : Notice that most of these terms cancel (only 4 will remain... no matter how far we go):. = This series is an example of something called a telescoping sum. A bit of perseverance will lead us notice that when n is sufficiently large the only terms that survive the cancelling process are two from near the beginning of the partial sum. These two terms a 1 and a 2,show up as negative. Most of the intermediate terms are cancelled except for the two positive values in the last two terms. So in full generality we would say: Let's check our intuition by using Mathematica to compare our two values: SClosed[n_] := Sqrt[n + 2] + Sqrt[n + 1] - Sqrt[2] - 1 Table[SClosed[x] - S[x], {x, 1, 100}] You should see a lot of zeros. This suggests that we did things correctly. Clearly, corresponding sum diverges too. Let's examine the same problem in another fashion. Graph the function are the TERMS in the series). Look to see if it's decreasing: diverges so the (these That looks pretty convincing to me but how do I prove it carefully? Obviously, you answer in a somewhat bored tone of voice, you take the derivative of f(x) and prove that it is negative on the

6 Calc II Page 6 interval [1, ): This looks a *bit* intimidating, but the denominator is always positive on [1, ), and since the square root function preserves ORDER the numerator must always be negative (think about it). Hence the entire expression is always negative on [1, ). Surprisingly, we can get Mathematica to do this for us: Reduce[{D[f[x], x] < 0}] Give it a try. Or even easier: Reduce[f'[x]<0] Mathematica will return the interval on which this condition is satisfied. Notice, we again took advantage of Mathematica's inability to tell the difference between a sequence and a function. (Go back and review the last lab if what I just said confused you) OK so we've ascertained that the function f(x) is decreasing on [1, ). We can figure out the limit easily enough (as x goes to infinity). (Do this). This sequence is also clearly positive and continuous on this interval too... so check this out: Here's what I want you to realize... the HEIGHT of each dot is the value of a term in the sequence associated to the series. The other thing to notice is that the distance between the vertical lines is exactly one. Let me emphasize the points and enhance the graphics a bit (this will also change the x- and y-scales a tad): The area of reach rectangle is the height of the red dot in the rectangles upper, left corner (remember that these heights come from the sequence). Because these heights are decreasing, the rectangle is

7 Calc II Page 7 completely contained under the curve. The total area in grey in the picture above is the exactly value of. But... that's LESS than the area under the curve. Since the curve is always positive the AREA of the curve over the rectangles should be MORE than the area under the rectangles... But we could also draw the rectangles like this: Here the (because the function is decreasing and always positive) the area of the rectangles is MORE than the area under the curve from to If this integral DIVERGES, then series does too. So try to find the improper integral using mathematica (recall that : See what I did there? I used the infinity sign in the boundary. Handy isn't it? Clearly, Mathematica believes the sequence diverges but let's do the steps ourselves a bit more carefully just to be certain. We're going to start by figuring out the value of We can do this, but in order to keep Mathematica from confusing itself with some unwarranted assumptions, we have to add a little bit of legalese: Integrate[f[x], {x, 1, t}, Assumptions -> {Element[t, Reals],t>1}] That last bit is new to us. It's an argument to Integrate[], that tells the command that t is greater than one and that t is a real number. It's a bit of a hassle, but on the plus side we get a nice expression for the definite integral: It's not immediately clear whether or not this expression will diverge as t goes to infinity but we can ask Mathematica (and you should try to do this one): So we see from the steps that the integral diverges and hence the series diverges too. Before we move on let's look at the first 10 partial sums: Table[S[n],{n,1,10}] That's useful but well it's sort of hard to see what's happening. If we hadn't defined the function S[n]

8 Calc II Page 8 we could have generated the terms in the partial sum sequence directly: Table[Sum[f[x], {x, 1, n}],{n,1,10}] You'll get the same result of course, but now if we change Sum[] to NSum[], we get an expression which is occasionally more useful: Table[NSum[f[x], {x, 1, n}], {n, 1, 10}] Here's another cool thing (but not about that problem): Mathematica can dispense with a lot of the intermediate steps figure out what we really mean. Try the following (remember, you can get Mathematica to give you infinity by typing <esc>inf<esc>): Spiffy non? That should make all sorts of problems easier to solve! As always, it is important for you to know what's really going on. Mathematica can give the wrong results. Consider this expression: NSum[1/n^2+10^(-8)/n,{n,1, }] Give that a try see.. Mathematica says it converges but Mathematica is WRONG! Each term in the sequence is greater than. That's a multiple of the harmonic series (which you will learn about on Friday), and that diverges, so the entire expression diverges. The symbolic version of the command is, however, smarter: That should be good enough for today. Be sure to send me your Mathematica file (along with the names of your group members). If you're done early you can either leave, or ask me homework questions.

An Introduction to Maple This lab is adapted from a lab created by Bob Milnikel.

An Introduction to Maple This lab is adapted from a lab created by Bob Milnikel. Some quick tips for getting started with Maple: An Introduction to Maple This lab is adapted from a lab created by Bob Milnikel. [Even before we start, take note of the distinction between Tet mode and

More information

Mathematica Proficiency and motivation for 6.1 and 6.2

Mathematica Proficiency and motivation for 6.1 and 6.2 Calculus Page 1 Master Lab Friday, August 19, 2011 2:13 PM Mathematica Proficiency and motivation for 6.1 and 6.2 This lab is designed to test some of your Mathematica background, to be useful as a reference,

More information

MITOCW watch?v=4dj1oguwtem

MITOCW watch?v=4dj1oguwtem MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive

More information

Skill 1: Multiplying Polynomials

Skill 1: Multiplying Polynomials CS103 Spring 2018 Mathematical Prerequisites Although CS103 is primarily a math class, this course does not require any higher math as a prerequisite. The most advanced level of mathematics you'll need

More information

3.7. Vertex and tangent

3.7. Vertex and tangent 3.7. Vertex and tangent Example 1. At the right we have drawn the graph of the cubic polynomial f(x) = x 2 (3 x). Notice how the structure of the graph matches the form of the algebraic expression. The

More information

MAT 003 Brian Killough s Instructor Notes Saint Leo University

MAT 003 Brian Killough s Instructor Notes Saint Leo University MAT 003 Brian Killough s Instructor Notes Saint Leo University Success in online courses requires self-motivation and discipline. It is anticipated that students will read the textbook and complete sample

More information

6.001 Notes: Section 15.1

6.001 Notes: Section 15.1 6.001 Notes: Section 15.1 Slide 15.1.1 Our goal over the next few lectures is to build an interpreter, which in a very basic sense is the ultimate in programming, since doing so will allow us to define

More information

Divisibility Rules and Their Explanations

Divisibility Rules and Their Explanations Divisibility Rules and Their Explanations Increase Your Number Sense These divisibility rules apply to determining the divisibility of a positive integer (1, 2, 3, ) by another positive integer or 0 (although

More information

Hi everyone. Starting this week I'm going to make a couple tweaks to how section is run. The first thing is that I'm going to go over all the slides

Hi everyone. Starting this week I'm going to make a couple tweaks to how section is run. The first thing is that I'm going to go over all the slides Hi everyone. Starting this week I'm going to make a couple tweaks to how section is run. The first thing is that I'm going to go over all the slides for both problems first, and let you guys code them

More information

1

1 Zeros&asymptotes Example 1 In an early version of this activity I began with a sequence of simple examples (parabolas and cubics) working gradually up to the main idea. But now I think the best strategy

More information

Intro. Speed V Growth

Intro. Speed V Growth Intro Good code is two things. It's elegant, and it's fast. In other words, we got a need for speed. We want to find out what's fast, what's slow, and what we can optimize. First, we'll take a tour of

More information

PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between

PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between MITOCW Lecture 10A [MUSIC PLAYING] PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between all these high-level languages like Lisp and the query

More information

MTH 122 Calculus II Essex County College Division of Mathematics and Physics 1 Lecture Notes #11 Sakai Web Project Material

MTH 122 Calculus II Essex County College Division of Mathematics and Physics 1 Lecture Notes #11 Sakai Web Project Material MTH Calculus II Essex County College Division of Mathematics and Physics Lecture Notes # Sakai Web Project Material Introduction - - 0 - Figure : Graph of y sin ( x y ) = x cos (x + y) with red tangent

More information

Intro. Scheme Basics. scm> 5 5. scm>

Intro. Scheme Basics. scm> 5 5. scm> Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if

More information

Download, Install and Use Winzip

Download, Install and Use Winzip Download, Install and Use Winzip Something that you are frequently asked to do (particularly if you are in one of my classes) is to either 'zip' or 'unzip' a file or folders. Invariably, when I ask people

More information

It Might Be Valid, But It's Still Wrong Paul Maskens and Andy Kramek

It Might Be Valid, But It's Still Wrong Paul Maskens and Andy Kramek Seite 1 von 5 Issue Date: FoxTalk July 2000 It Might Be Valid, But It's Still Wrong Paul Maskens and Andy Kramek This month, Paul Maskens and Andy Kramek discuss the problems of validating data entry.

More information

In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology.

In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology. Guide to and Hi everybody! In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology. This guide focuses on two of those symbols: and. These symbols represent concepts

More information

Binary, Hexadecimal and Octal number system

Binary, Hexadecimal and Octal number system Binary, Hexadecimal and Octal number system Binary, hexadecimal, and octal refer to different number systems. The one that we typically use is called decimal. These number systems refer to the number of

More information

MITOCW ocw f99-lec07_300k

MITOCW ocw f99-lec07_300k MITOCW ocw-18.06-f99-lec07_300k OK, here's linear algebra lecture seven. I've been talking about vector spaces and specially the null space of a matrix and the column space of a matrix. What's in those

More information

1.7 Limit of a Function

1.7 Limit of a Function 1.7 Limit of a Function We will discuss the following in this section: 1. Limit Notation 2. Finding a it numerically 3. Right and Left Hand Limits 4. Infinite Limits Consider the following graph Notation:

More information

6.001 Notes: Section 8.1

6.001 Notes: Section 8.1 6.001 Notes: Section 8.1 Slide 8.1.1 In this lecture we are going to introduce a new data type, specifically to deal with symbols. This may sound a bit odd, but if you step back, you may realize that everything

More information

MITOCW watch?v=yarwp7tntl4

MITOCW watch?v=yarwp7tntl4 MITOCW watch?v=yarwp7tntl4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality, educational resources for free.

More information

Derivatives and Graphs of Functions

Derivatives and Graphs of Functions Derivatives and Graphs of Functions September 8, 2014 2.2 Second Derivatives, Concavity, and Graphs In the previous section, we discussed how our derivatives can be used to obtain useful information about

More information

(Refer Slide Time: 02:59)

(Refer Slide Time: 02:59) Numerical Methods and Programming P. B. Sunil Kumar Department of Physics Indian Institute of Technology, Madras Lecture - 7 Error propagation and stability Last class we discussed about the representation

More information

Graphing Techniques. Domain (, ) Range (, ) Squaring Function f(x) = x 2 Domain (, ) Range [, ) f( x) = x 2

Graphing Techniques. Domain (, ) Range (, ) Squaring Function f(x) = x 2 Domain (, ) Range [, ) f( x) = x 2 Graphing Techniques In this chapter, we will take our knowledge of graphs of basic functions and expand our ability to graph polynomial and rational functions using common sense, zeros, y-intercepts, stretching

More information

4. Write sets of directions for how to check for direct variation. How to check for direct variation by analyzing the graph :

4. Write sets of directions for how to check for direct variation. How to check for direct variation by analyzing the graph : Name Direct Variations There are many relationships that two variables can have. One of these relationships is called a direct variation. Use the description and example of direct variation to help you

More information

The following content is provided under a Creative Commons license. Your support

The following content is provided under a Creative Commons license. Your support MITOCW Lecture 9 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high-quality educational resources for free. To make a donation

More information

Post Experiment Interview Questions

Post Experiment Interview Questions Post Experiment Interview Questions Questions about the Maximum Problem 1. What is this problem statement asking? 2. What is meant by positive integers? 3. What does it mean by the user entering valid

More information

Chapter Fourteen Bonus Lessons: Algorithms and Efficiency

Chapter Fourteen Bonus Lessons: Algorithms and Efficiency : Algorithms and Efficiency The following lessons take a deeper look at Chapter 14 topics regarding algorithms, efficiency, and Big O measurements. They can be completed by AP students after Chapter 14.

More information

Hey there, I m (name) and today I m gonna talk to you about rate of change and slope.

Hey there, I m (name) and today I m gonna talk to you about rate of change and slope. Rate and Change of Slope A1711 Activity Introduction Hey there, I m (name) and today I m gonna talk to you about rate of change and slope. Slope is the steepness of a line and is represented by the letter

More information

An infinite decimal is a decimal with digits that do not end. They may repeat, but they never end. An example of an infinite decimal is..

An infinite decimal is a decimal with digits that do not end. They may repeat, but they never end. An example of an infinite decimal is.. Student Outcomes Students know the intuitive meaning of an infinite decimal. Students will be able to explain why the infinite decimal 0. 9 is equal to 1. Lesson Notes The purpose of this lesson is to

More information

Limits at Infinity

Limits at Infinity Limits at Infinity 9-6-08 In this section, I ll discuss the it of a function f() as goes to and. We ll see that this is related to horizontal asyptotes of a graph. It s natural to discuss vertical asymptotes

More information

Limits. f(x) and lim. g(x) g(x)

Limits. f(x) and lim. g(x) g(x) Limits Limit Laws Suppose c is constant, n is a positive integer, and f() and g() both eist. Then,. [f() + g()] = f() + g() 2. [f() g()] = f() g() [ ] 3. [c f()] = c f() [ ] [ ] 4. [f() g()] = f() g()

More information

MITOCW watch?v=se4p7ivcune

MITOCW watch?v=se4p7ivcune MITOCW watch?v=se4p7ivcune The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

x 2 + 3, r 4(x) = x2 1

x 2 + 3, r 4(x) = x2 1 Math 121 (Lesieutre); 4.2: Rational functions; September 1, 2017 1. What is a rational function? It s a function of the form p(x), where p(x) and q(x) are both polynomials. In other words, q(x) something

More information

Basics of Computational Geometry

Basics of Computational Geometry Basics of Computational Geometry Nadeem Mohsin October 12, 2013 1 Contents This handout covers the basic concepts of computational geometry. Rather than exhaustively covering all the algorithms, it deals

More information

MITOCW watch?v=w_-sx4vr53m

MITOCW watch?v=w_-sx4vr53m MITOCW watch?v=w_-sx4vr53m The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high-quality educational resources for free. To

More information

Distance. Dollars. Reviewing gradient

Distance. Dollars. Reviewing gradient Gradient The gradient of a line is its slope. It is a very important feature of a line because it tells you how fast things are changing. Look at the graphs below to find the meaning of gradient in two

More information

6.001 Notes: Section 17.5

6.001 Notes: Section 17.5 6.001 Notes: Section 17.5 Slide 17.5.1 Now, let's look at one example in which changing the evaluation model allows us to explore a very different kind of computational problem. Our goal is to show how

More information

Square Roots: Introduction & Simplification

Square Roots: Introduction & Simplification Square Roots: Introduction & Simplification You already know about squaring. For instance, 2 2 = 4, 3 2 = 9, etc. The backwards of squaring is square-rooting. The symbol for square-rooting is " ", the

More information

Intro. Classes & Inheritance

Intro. Classes & Inheritance Intro Functions are useful, but they're not always intuitive. Today we're going to learn about a different way of programming, where instead of functions we will deal primarily with objects. This school

More information

n! = 1 * 2 * 3 * 4 * * (n-1) * n

n! = 1 * 2 * 3 * 4 * * (n-1) * n The Beauty and Joy of Computing 1 Lab Exercise 9: Problem self-similarity and recursion Objectives By completing this lab exercise, you should learn to Recognize simple self-similar problems which are

More information

Exploring Fractals through Geometry and Algebra. Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss

Exploring Fractals through Geometry and Algebra. Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss Exploring Fractals through Geometry and Algebra Kelly Deckelman Ben Eggleston Laura Mckenzie Patricia Parker-Davis Deanna Voss Learning Objective and skills practiced Students will: Learn the three criteria

More information

Microscopic Measurement

Microscopic Measurement Microscopic Measurement Estimating Specimen Size : The area of the slide that you see when you look through a microscope is called the " field of view ". If you know the diameter of your field of view,

More information

1 Algorithm and Proof for Minimum Vertex Coloring

1 Algorithm and Proof for Minimum Vertex Coloring Solutions to Homework 7, CS 173A (Fall 2018) Homework 7 asked you to show that the construction problems Maximum Independent Set, Minimum Vertex Coloring, and Maximum Clique could all be solved in polynomial

More information

5.5 Newton s Approximation Method

5.5 Newton s Approximation Method 498CHAPTER 5. USING DERIVATIVES TO ANALYZE FUNCTIONS; FURTHER APPLICATIONS 4 3 y = x 4 3 f(x) = x cosx y = cosx 3 3 x = cosx x cosx = 0 Figure 5.: Figure showing the existence of a solution of x = cos

More information

, etc. Let s work with the last one. We can graph a few points determined by this equation.

, etc. Let s work with the last one. We can graph a few points determined by this equation. 1. Lines By a line, we simply mean a straight curve. We will always think of lines relative to the cartesian plane. Consider the equation 2x 3y 4 = 0. We can rewrite it in many different ways : 2x 3y =

More information

Embedding Python in Your C Programs

Embedding Python in Your C Programs 1 of 7 6/18/2006 9:05 PM Embedding Python in Your C Programs William Nagel Abstract C, meet Python. Python, this is C. With surprisingly little effort, the Python interpreter can be integrated into your

More information

Binary Search Trees. Carlos Moreno uwaterloo.ca EIT https://ece.uwaterloo.ca/~cmoreno/ece250

Binary Search Trees. Carlos Moreno uwaterloo.ca EIT https://ece.uwaterloo.ca/~cmoreno/ece250 Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 https://ece.uwaterloo.ca/~cmoreno/ece250 Standard reminder to set phones to silent/vibrate mode, please! Previously, on ECE-250... We discussed trees (the

More information

Graphing and Equations

Graphing and Equations Graphing and Equations Plotting Functions (Graphing) Let's see how to plot the graphs of functions. If we want to graph the function f(x) on the interval [a,b] then we type in: plot(f(x), x=a..b) That

More information

Chapter 1. Math review. 1.1 Some sets

Chapter 1. Math review. 1.1 Some sets Chapter 1 Math review This book assumes that you understood precalculus when you took it. So you used to know how to do things like factoring polynomials, solving high school geometry problems, using trigonometric

More information

MITOCW ocw f99-lec12_300k

MITOCW ocw f99-lec12_300k MITOCW ocw-18.06-f99-lec12_300k This is lecture twelve. OK. We've reached twelve lectures. And this one is more than the others about applications of linear algebra. And I'll confess. When I'm giving you

More information

The following content is provided under a Creative Commons license. Your support

The following content is provided under a Creative Commons license. Your support MITOCW Recitation 4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To make

More information

1. The Normal Distribution, continued

1. The Normal Distribution, continued Math 1125-Introductory Statistics Lecture 16 10/9/06 1. The Normal Distribution, continued Recall that the standard normal distribution is symmetric about z = 0, so the area to the right of zero is 0.5000.

More information

Algebra 2 Semester 1 (#2221)

Algebra 2 Semester 1 (#2221) Instructional Materials for WCSD Math Common Finals The Instructional Materials are for student and teacher use and are aligned to the 2016-2017 Course Guides for the following course: Algebra 2 Semester

More information

In this chapter, we will investigate what have become the standard applications of the integral:

In this chapter, we will investigate what have become the standard applications of the integral: Chapter 8 Overview: Applications of Integrals Calculus, like most mathematical fields, began with trying to solve everyday problems. The theory and operations were formalized later. As early as 70 BC,

More information

Module 6. Campaign Layering

Module 6.  Campaign Layering Module 6 Email Campaign Layering Slide 1 Hello everyone, it is Andy Mackow and in today s training, I am going to teach you a deeper level of writing your email campaign. I and I am calling this Email

More information

Direct Variations DIRECT AND INVERSE VARIATIONS 19. Name

Direct Variations DIRECT AND INVERSE VARIATIONS 19. Name DIRECT AND INVERSE VARIATIONS 19 Direct Variations Name Of the many relationships that two variables can have, one category is called a direct variation. Use the description and example of direct variation

More information

COMP 161 Lecture Notes 16 Analyzing Search and Sort

COMP 161 Lecture Notes 16 Analyzing Search and Sort COMP 161 Lecture Notes 16 Analyzing Search and Sort In these notes we analyze search and sort. Counting Operations When we analyze the complexity of procedures we re determine the order of the number of

More information

Math 1191 Mathematica Introduction

Math 1191 Mathematica Introduction Math 1191 Mathematica Introduction Lab 2 Fall, 2005 REMEMBER: Functions use square brackets [] for their arguments, not parentheses. Sin[3], Log[10], myfunction[42], N[Pi,8] Example: Mathematica s built-in

More information

If Statements, For Loops, Functions

If Statements, For Loops, Functions Fundamentals of Programming If Statements, For Loops, Functions Table of Contents Hello World Types of Variables Integers and Floats String Boolean Relational Operators Lists Conditionals If and Else Statements

More information

Drawing curves automatically: procedures as arguments

Drawing curves automatically: procedures as arguments CHAPTER 7 Drawing curves automatically: procedures as arguments moveto lineto stroke fill clip The process of drawing curves by programming each one specially is too complicated to be done easily. In this

More information

MITOCW watch?v=hverxup4cfg

MITOCW watch?v=hverxup4cfg MITOCW watch?v=hverxup4cfg PROFESSOR: We've briefly looked at graph isomorphism in the context of digraphs. And it comes up in even more fundamental way really for simple graphs where the definition is

More information

Calculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier

Calculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier Calculus I Review Handout 1.3 Introduction to Calculus - Limits by Kevin M. Chevalier We are now going to dive into Calculus I as we take a look at the it process. While precalculus covered more static

More information

The following content is provided under a Creative Commons license. Your support

The following content is provided under a Creative Commons license. Your support MITOCW Lecture 8 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To make a donation

More information

(Refer Slide Time: 01.26)

(Refer Slide Time: 01.26) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture # 22 Why Sorting? Today we are going to be looking at sorting.

More information

MITOCW watch?v=rvrkt-jxvko

MITOCW watch?v=rvrkt-jxvko MITOCW watch?v=rvrkt-jxvko The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

Well, Hal just told us how you build robust systems. The key idea was-- I'm sure that many of

Well, Hal just told us how you build robust systems. The key idea was-- I'm sure that many of MITOCW Lecture 3B [MUSIC PLAYING] Well, Hal just told us how you build robust systems. The key idea was-- I'm sure that many of you don't really assimilate that yet-- but the key idea is that in order

More information

An introduction to plotting data

An introduction to plotting data An introduction to plotting data Eric D. Black California Institute of Technology February 25, 2014 1 Introduction Plotting data is one of the essential skills every scientist must have. We use it on a

More information

Chapter 7. Polygons, Circles, Stars and Stuff

Chapter 7. Polygons, Circles, Stars and Stuff Chapter 7. Polygons, Circles, Stars and Stuff Now it s time for the magic! Magic? asked Morf. What do you mean, magic? You ve never talked about Logo magic before. We ve talked about shapes, and how you

More information

PROFESSOR: So far in this course we've been talking a lot about data abstraction. And remember the idea is that

PROFESSOR: So far in this course we've been talking a lot about data abstraction. And remember the idea is that MITOCW Lecture 4B [MUSIC-- "JESU, JOY OF MAN'S DESIRING" BY JOHANN SEBASTIAN BACH] PROFESSOR: So far in this course we've been talking a lot about data abstraction. And remember the idea is that we build

More information

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA

DOWNLOAD PDF BIG IDEAS MATH VERTICAL SHRINK OF A PARABOLA Chapter 1 : BioMath: Transformation of Graphs Use the results in part (a) to identify the vertex of the parabola. c. Find a vertical line on your graph paper so that when you fold the paper, the left portion

More information

Excerpt from "Art of Problem Solving Volume 1: the Basics" 2014 AoPS Inc.

Excerpt from Art of Problem Solving Volume 1: the Basics 2014 AoPS Inc. Chapter 5 Using the Integers In spite of their being a rather restricted class of numbers, the integers have a lot of interesting properties and uses. Math which involves the properties of integers is

More information

Formal Methods of Software Design, Eric Hehner, segment 24 page 1 out of 5

Formal Methods of Software Design, Eric Hehner, segment 24 page 1 out of 5 Formal Methods of Software Design, Eric Hehner, segment 24 page 1 out of 5 [talking head] This lecture we study theory design and implementation. Programmers have two roles to play here. In one role, they

More information

Binary Search Trees. Carlos Moreno uwaterloo.ca EIT https://ece.uwaterloo.ca/~cmoreno/ece250

Binary Search Trees. Carlos Moreno uwaterloo.ca EIT https://ece.uwaterloo.ca/~cmoreno/ece250 Carlos Moreno cmoreno @ uwaterloo.ca EIT-4103 https://ece.uwaterloo.ca/~cmoreno/ece250 Previously, on ECE-250... We discussed trees (the general type) and their implementations. We looked at traversals

More information

Table of Laplace Transforms

Table of Laplace Transforms Table of Laplace Transforms 1 1 2 3 4, p > -1 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 Heaviside Function 27 28. Dirac Delta Function 29 30. 31 32. 1 33 34. 35 36. 37 Laplace Transforms

More information

CPSC 320 Sample Solution, Playing with Graphs!

CPSC 320 Sample Solution, Playing with Graphs! CPSC 320 Sample Solution, Playing with Graphs! September 23, 2017 Today we practice reasoning about graphs by playing with two new terms. These terms/concepts are useful in themselves but not tremendously

More information

Lesson 3: Solving Equations; Floating-point Computation

Lesson 3: Solving Equations; Floating-point Computation Lesson 3: Solving Equations; Floating-point Computation restart; A hard equation Last time we were looking at this equation. eq := * sin() = Pi/2; (1.1) Maple didn't know the solutions. solve(eq,,allsolutions);

More information

Critical and Inflection Points

Critical and Inflection Points Critical and Inflection Points 1 Finding and Classifying Critical Points A critical point is a point on the graph where the tangent slope is horizontal, (0) or vertical, ( ). or not defined like the minimum

More information

Hi everyone. I hope everyone had a good Fourth of July. Today we're going to be covering graph search. Now, whenever we bring up graph algorithms, we

Hi everyone. I hope everyone had a good Fourth of July. Today we're going to be covering graph search. Now, whenever we bring up graph algorithms, we Hi everyone. I hope everyone had a good Fourth of July. Today we're going to be covering graph search. Now, whenever we bring up graph algorithms, we have to talk about the way in which we represent the

More information

Aspects of Geometry. Finite models of the projective plane and coordinates

Aspects of Geometry. Finite models of the projective plane and coordinates Review Sheet There will be an exam on Thursday, February 14. The exam will cover topics up through material from projective geometry through Day 3 of the DIY Hyperbolic geometry packet. Below are some

More information

lundi 7 janvier 2002 Blender: tutorial: Building a Castle Page: 1

lundi 7 janvier 2002 Blender: tutorial: Building a Castle Page: 1 lundi 7 janvier 2002 Blender: tutorial: Building a Castle Page: 1 www.blender.nl this document is online at http://www.blender.nl/showitem.php?id=4 Building a Castle 2000 07 19 Bart Veldhuizen id4 Introduction

More information

The method of rationalizing

The method of rationalizing Roberto s Notes on Differential Calculus Chapter : Resolving indeterminate forms Section The method of rationalizing What you need to know already: The concept of it and the factor-and-cancel method of

More information

MITOCW watch?v=r6-lqbquci0

MITOCW watch?v=r6-lqbquci0 MITOCW watch?v=r6-lqbquci0 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

Continuity and Tangent Lines for functions of two variables

Continuity and Tangent Lines for functions of two variables Continuity and Tangent Lines for functions of two variables James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April 4, 2014 Outline 1 Continuity

More information

Here is the data collected.

Here is the data collected. Introduction to Scientific Analysis of Data Using Spreadsheets. Computer spreadsheets are very powerful tools that are widely used in Business, Science, and Engineering to perform calculations and record,

More information

Math Fundamentals for Statistics (Math 52) Unit 3: Addition and Subtraction. Scott Fallstrom and Brent Pickett The How and Whys Guys.

Math Fundamentals for Statistics (Math 52) Unit 3: Addition and Subtraction. Scott Fallstrom and Brent Pickett The How and Whys Guys. Math Fundamentals for Statistics (Math 52) Unit 3: Addition and Subtraction Scott Fallstrom and Brent Pickett The How and Whys Guys Unit 3 Page 1 3.1: Place Value (Addition Preview) Our system is a base-ten,

More information

The method of rationalizing

The method of rationalizing Roberto s Notes on Differential Calculus Chapter : Resolving indeterminate forms Section The method of rationalizing What you need to know already: The concept of it and the factor-and-cancel method of

More information

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17 601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17 5.1 Introduction You should all know a few ways of sorting in O(n log n)

More information

Rev Name Date. . Round-off error is the answer to the question How wrong is the rounded answer?

Rev Name Date. . Round-off error is the answer to the question How wrong is the rounded answer? Name Date TI-84+ GC 7 Avoiding Round-off Error in Multiple Calculations Objectives: Recall the meaning of exact and approximate Observe round-off error and learn to avoid it Perform calculations using

More information

Mathematics Background

Mathematics Background Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects

More information

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters..

A point is pictured by a dot. While a dot must have some size, the point it represents has no size. Points are named by capital letters.. Chapter 1 Points, Lines & Planes s we begin any new topic, we have to familiarize ourselves with the language and notation to be successful. My guess that you might already be pretty familiar with many

More information

What's the Slope of a Line?

What's the Slope of a Line? What's the Slope of a Line? These lines look pretty different, don't they? Lines are used to keep track of lots of info -- like how much money a company makes. Just off the top of your head, which of the

More information

(Refer Slide Time: 02.06)

(Refer Slide Time: 02.06) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking

More information

AP Calculus. Extreme Values: Graphically. Slide 1 / 163 Slide 2 / 163. Slide 4 / 163. Slide 3 / 163. Slide 5 / 163. Slide 6 / 163

AP Calculus. Extreme Values: Graphically. Slide 1 / 163 Slide 2 / 163. Slide 4 / 163. Slide 3 / 163. Slide 5 / 163. Slide 6 / 163 Slide 1 / 163 Slide 2 / 163 AP Calculus Analyzing Functions Using Derivatives 2015-11-04 www.njctl.org Slide 3 / 163 Table of Contents click on the topic to go to that section Slide 4 / 163 Extreme Values

More information

Polygons in the Coordinate Plane

Polygons in the Coordinate Plane Polygons in the Coordinate Plane LAUNCH (8 MIN) Before How can you find the perimeter of the sandbox that the park worker made? During How will you determine whether the park worker s plan for the sandbox

More information

Using Arithmetic of Real Numbers to Explore Limits and Continuity

Using Arithmetic of Real Numbers to Explore Limits and Continuity Using Arithmetic of Real Numbers to Explore Limits and Continuity by Maria Terrell Cornell University Problem Let a =.898989... and b =.000000... (a) Find a + b. (b) Use your ideas about how to add a and

More information

6.001 Notes: Section 4.1

6.001 Notes: Section 4.1 6.001 Notes: Section 4.1 Slide 4.1.1 In this lecture, we are going to take a careful look at the kinds of procedures we can build. We will first go back to look very carefully at the substitution model,

More information

Fractions and their Equivalent Forms

Fractions and their Equivalent Forms Fractions Fractions and their Equivalent Forms Little kids use the concept of a fraction long before we ever formalize their knowledge in school. Watching little kids share a candy bar or a bottle of soda

More information

Surfaces and Partial Derivatives

Surfaces and Partial Derivatives Surfaces and James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 15, 2017 Outline 1 2 Tangent Planes Let s go back to our simple surface

More information