Advanced Engineering Mathematics
6th Edition
ISBN: 9781284105902
Author: Dennis G. Zill
Publisher: Jones & Bartlett Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
why the know-show table below is not valid: I know something is wrong in the step p2-p5 but I don't know how to explain it. Can you explain why please.
Consider the following statement:
For all integers a and b, if a 0 (mod 6) and b #0 (mod 6), then
ab #0 (mod 6).
Which of the following statements are true? (select all that apply)
Original statement
✓ Contrapositive
Converse
Negation
☐ None of the statements are true
Proposition: If m is an odd integer, then m + 6 is
an odd integer.
Proof: For m + 6 to be an odd integer, there must
exist an integer n such that
m+6=2n+1.
Subtracting 6 from both sides, we see that
m = 2n+1-6
=
= 2n― 6+1
= 2(n − 3) + 1.
Since the integers are closed under subtraction,
then n-3 € Z. Hence, the last equation implies
that m = = 2q+1 where q = n = 3. This proves
-
that if m is an odd integer, then m + 6 is an odd
integer.
Based upon the Reading assignment and the Elements of Style >>, which of the
following is the most significant error in the proof?
The proof does not use complete sentences
The proof contains a sentence that begins with a mathematical symbol
The proof uses cumbersome notation
The proof contains a variable used for more than one object
The proof is written backwards
The proof uses an example to prove the general case
Chapter 2 Solutions
Advanced Engineering Mathematics
Ch. 2.1 - Prob. 1ECh. 2.1 - Prob. 2ECh. 2.1 - Prob. 3ECh. 2.1 - Prob. 4ECh. 2.1 - Prob. 5ECh. 2.1 - Prob. 6ECh. 2.1 - Prob. 7ECh. 2.1 - Prob. 8ECh. 2.1 - Prob. 9ECh. 2.1 - Prob. 10E
Ch. 2.1 - Prob. 11ECh. 2.1 - Prob. 12ECh. 2.1 - Prob. 13ECh. 2.1 - Prob. 14ECh. 2.1 - Prob. 15ECh. 2.1 - Prob. 16ECh. 2.1 - Prob. 19ECh. 2.1 - Prob. 20ECh. 2.1 - Prob. 21ECh. 2.1 - Prob. 22ECh. 2.1 - Prob. 23ECh. 2.1 - Prob. 24ECh. 2.1 - Prob. 25ECh. 2.1 - Prob. 26ECh. 2.1 - Prob. 27ECh. 2.1 - Prob. 28ECh. 2.1 - Prob. 29ECh. 2.1 - Prob. 30ECh. 2.1 - Prob. 31ECh. 2.1 - Prob. 32ECh. 2.1 - Prob. 33ECh. 2.1 - Prob. 34ECh. 2.1 - Prob. 35ECh. 2.1 - Prob. 36ECh. 2.1 - Prob. 37ECh. 2.1 - Prob. 38ECh. 2.1 - Prob. 39ECh. 2.1 - Prob. 40ECh. 2.1 - Prob. 41ECh. 2.1 - Prob. 42ECh. 2.2 - Prob. 1ECh. 2.2 - Prob. 2ECh. 2.2 - Prob. 3ECh. 2.2 - Prob. 4ECh. 2.2 - Prob. 5ECh. 2.2 - Prob. 6ECh. 2.2 - Prob. 7ECh. 2.2 - Prob. 8ECh. 2.2 - Prob. 9ECh. 2.2 - Prob. 10ECh. 2.2 - Prob. 11ECh. 2.2 - Prob. 12ECh. 2.2 - Prob. 13ECh. 2.2 - Prob. 14ECh. 2.2 - Prob. 15ECh. 2.2 - Prob. 16ECh. 2.2 - Prob. 17ECh. 2.2 - Prob. 18ECh. 2.2 - Prob. 19ECh. 2.2 - Prob. 20ECh. 2.2 - Prob. 21ECh. 2.2 - Prob. 22ECh. 2.2 - Prob. 23ECh. 2.2 - Prob. 24ECh. 2.2 - Prob. 25ECh. 2.2 - Prob. 26ECh. 2.2 - Prob. 27ECh. 2.2 - Prob. 28ECh. 2.2 - Prob. 29ECh. 2.2 - Prob. 30ECh. 2.2 - Prob. 31ECh. 2.2 - Prob. 32ECh. 2.2 - Prob. 33ECh. 2.2 - Prob. 34ECh. 2.2 - Prob. 35ECh. 2.2 - Prob. 36ECh. 2.2 - Prob. 37ECh. 2.2 - Prob. 38ECh. 2.2 - Prob. 39ECh. 2.2 - Prob. 40ECh. 2.2 - Prob. 41ECh. 2.2 - Prob. 42ECh. 2.2 - Prob. 43ECh. 2.2 - Prob. 44ECh. 2.2 - Prob. 45ECh. 2.2 - Prob. 46ECh. 2.2 - Prob. 47ECh. 2.2 - Prob. 48ECh. 2.2 - Prob. 49ECh. 2.2 - Prob. 50ECh. 2.2 - Prob. 51ECh. 2.2 - Prob. 52ECh. 2.2 - Prob. 53ECh. 2.3 - Prob. 1ECh. 2.3 - Prob. 2ECh. 2.3 - Prob. 3ECh. 2.3 - Prob. 4ECh. 2.3 - Prob. 5ECh. 2.3 - Prob. 6ECh. 2.3 - Prob. 7ECh. 2.3 - Prob. 8ECh. 2.3 - Prob. 9ECh. 2.3 - Prob. 10ECh. 2.3 - Prob. 11ECh. 2.3 - Prob. 12ECh. 2.3 - Prob. 13ECh. 2.3 - Prob. 14ECh. 2.3 - Prob. 15ECh. 2.3 - Prob. 16ECh. 2.3 - Prob. 17ECh. 2.3 - Prob. 18ECh. 2.3 - Prob. 19ECh. 2.3 - Prob. 20ECh. 2.3 - Prob. 21ECh. 2.3 - Prob. 22ECh. 2.3 - Prob. 23ECh. 2.3 - Prob. 24ECh. 2.3 - Prob. 25ECh. 2.3 - Prob. 26ECh. 2.3 - Prob. 27ECh. 2.3 - Prob. 28ECh. 2.3 - Prob. 29ECh. 2.3 - Prob. 30ECh. 2.3 - Prob. 31ECh. 2.3 - Prob. 32ECh. 2.3 - Prob. 33ECh. 2.3 - Prob. 34ECh. 2.3 - Prob. 35ECh. 2.3 - Prob. 36ECh. 2.3 - Prob. 37ECh. 2.3 - Prob. 38ECh. 2.3 - Prob. 39ECh. 2.3 - Prob. 40ECh. 2.3 - Prob. 41ECh. 2.3 - Prob. 42ECh. 2.3 - Prob. 43ECh. 2.3 - Prob. 44ECh. 2.3 - Prob. 45ECh. 2.3 - Prob. 46ECh. 2.3 - Prob. 47ECh. 2.3 - Prob. 48ECh. 2.3 - Prob. 49ECh. 2.3 - Prob. 50ECh. 2.3 - Prob. 51ECh. 2.3 - Prob. 52ECh. 2.3 - Prob. 53ECh. 2.3 - Prob. 56ECh. 2.4 - Prob. 1ECh. 2.4 - Prob. 2ECh. 2.4 - Prob. 3ECh. 2.4 - Prob. 4ECh. 2.4 - Prob. 5ECh. 2.4 - Prob. 6ECh. 2.4 - Prob. 7ECh. 2.4 - Prob. 8ECh. 2.4 - Prob. 9ECh. 2.4 - Prob. 10ECh. 2.4 - Prob. 11ECh. 2.4 - Prob. 12ECh. 2.4 - Prob. 13ECh. 2.4 - Prob. 14ECh. 2.4 - Prob. 15ECh. 2.4 - Prob. 16ECh. 2.4 - Prob. 17ECh. 2.4 - Prob. 18ECh. 2.4 - Prob. 19ECh. 2.4 - Prob. 20ECh. 2.4 - Prob. 21ECh. 2.4 - Prob. 22ECh. 2.4 - Prob. 23ECh. 2.4 - Prob. 24ECh. 2.4 - Prob. 25ECh. 2.4 - Prob. 26ECh. 2.4 - Prob. 27ECh. 2.4 - Prob. 28ECh. 2.4 - Prob. 29ECh. 2.4 - Prob. 30ECh. 2.4 - Prob. 31ECh. 2.4 - Prob. 32ECh. 2.4 - Prob. 33ECh. 2.4 - Prob. 34ECh. 2.4 - Prob. 35ECh. 2.4 - Prob. 36ECh. 2.4 - Prob. 37ECh. 2.4 - Prob. 38ECh. 2.4 - Prob. 39ECh. 2.4 - Prob. 40ECh. 2.4 - Prob. 41ECh. 2.4 - Prob. 42ECh. 2.4 - Prob. 43ECh. 2.4 - Prob. 44ECh. 2.4 - Prob. 45ECh. 2.5 - Prob. 1ECh. 2.5 - Prob. 2ECh. 2.5 - Prob. 3ECh. 2.5 - Prob. 4ECh. 2.5 - Prob. 5ECh. 2.5 - Prob. 6ECh. 2.5 - Prob. 7ECh. 2.5 - Prob. 8ECh. 2.5 - Prob. 9ECh. 2.5 - Prob. 10ECh. 2.5 - Prob. 11ECh. 2.5 - Prob. 12ECh. 2.5 - Prob. 13ECh. 2.5 - Prob. 14ECh. 2.5 - Prob. 15ECh. 2.5 - Prob. 16ECh. 2.5 - Prob. 17ECh. 2.5 - Prob. 18ECh. 2.5 - Prob. 19ECh. 2.5 - Prob. 20ECh. 2.5 - Prob. 21ECh. 2.5 - Prob. 22ECh. 2.5 - Prob. 23ECh. 2.5 - Prob. 24ECh. 2.5 - Prob. 25ECh. 2.5 - Prob. 26ECh. 2.5 - Prob. 27ECh. 2.5 - Prob. 28ECh. 2.5 - Prob. 29ECh. 2.5 - Prob. 30ECh. 2.5 - Prob. 31ECh. 2.5 - Prob. 32ECh. 2.5 - Prob. 33ECh. 2.5 - Prob. 34ECh. 2.5 - Prob. 35ECh. 2.5 - Prob. 36ECh. 2.5 - Prob. 37ECh. 2.6 - Prob. 1ECh. 2.6 - Prob. 2ECh. 2.6 - Prob. 3ECh. 2.6 - Prob. 4ECh. 2.6 - Prob. 5ECh. 2.6 - Prob. 6ECh. 2.6 - Prob. 7ECh. 2.6 - Prob. 8ECh. 2.6 - Prob. 9ECh. 2.6 - Prob. 10ECh. 2.7 - Prob. 1ECh. 2.7 - Prob. 2ECh. 2.7 - Prob. 3ECh. 2.7 - Prob. 4ECh. 2.7 - Prob. 5ECh. 2.7 - Prob. 6ECh. 2.7 - Prob. 7ECh. 2.7 - Prob. 8ECh. 2.7 - Prob. 9ECh. 2.7 - Prob. 10ECh. 2.7 - Prob. 11ECh. 2.7 - Prob. 12ECh. 2.7 - Prob. 13ECh. 2.7 - Prob. 14ECh. 2.7 - Prob. 15ECh. 2.7 - Prob. 16ECh. 2.7 - Prob. 17ECh. 2.7 - Prob. 18ECh. 2.7 - Prob. 19ECh. 2.7 - Prob. 20ECh. 2.7 - Prob. 21ECh. 2.7 - Prob. 22ECh. 2.7 - Prob. 23ECh. 2.7 - Prob. 24ECh. 2.7 - Prob. 25ECh. 2.7 - Prob. 26ECh. 2.7 - Prob. 27ECh. 2.7 - Prob. 28ECh. 2.7 - Prob. 29ECh. 2.7 - Prob. 30ECh. 2.7 - Prob. 31ECh. 2.7 - Prob. 32ECh. 2.7 - Prob. 33ECh. 2.7 - Prob. 34ECh. 2.7 - Prob. 35ECh. 2.7 - Prob. 36ECh. 2.7 - Prob. 37ECh. 2.7 - Prob. 38ECh. 2.7 - Prob. 39ECh. 2.7 - Prob. 40ECh. 2.7 - Prob. 41ECh. 2.7 - Prob. 42ECh. 2.7 - Prob. 43ECh. 2.7 - Prob. 44ECh. 2.7 - Prob. 45ECh. 2.7 - Prob. 46ECh. 2.7 - Prob. 48ECh. 2.7 - Prob. 50ECh. 2.7 - Prob. 51ECh. 2.8 - Prob. 1ECh. 2.8 - Prob. 2ECh. 2.8 - Prob. 3ECh. 2.8 - Prob. 4ECh. 2.8 - Prob. 5ECh. 2.8 - Prob. 6ECh. 2.8 - Prob. 7ECh. 2.8 - Prob. 8ECh. 2.8 - Prob. 9ECh. 2.8 - Prob. 10ECh. 2.8 - Prob. 11ECh. 2.8 - Prob. 12ECh. 2.8 - Prob. 13ECh. 2.8 - Prob. 14ECh. 2.8 - Prob. 15ECh. 2.8 - Prob. 16ECh. 2.8 - Prob. 17ECh. 2.8 - Prob. 18ECh. 2.8 - Prob. 19ECh. 2.8 - Prob. 20ECh. 2.8 - Prob. 21ECh. 2.8 - Prob. 22ECh. 2.8 - Prob. 23ECh. 2.8 - Prob. 24ECh. 2.8 - Prob. 30ECh. 2.9 - Prob. 1ECh. 2.9 - Prob. 2ECh. 2.9 - Prob. 3ECh. 2.9 - Prob. 4ECh. 2.9 - Prob. 7ECh. 2.9 - Prob. 8ECh. 2.9 - Prob. 9ECh. 2.9 - Prob. 10ECh. 2.9 - Prob. 11ECh. 2.9 - Prob. 14ECh. 2.9 - Prob. 15ECh. 2.9 - Prob. 16ECh. 2.9 - Prob. 17ECh. 2.9 - Prob. 18ECh. 2 - Prob. 1CRCh. 2 - Prob. 2CRCh. 2 - Prob. 3CRCh. 2 - Prob. 4CRCh. 2 - Prob. 5CRCh. 2 - Prob. 6CRCh. 2 - Prob. 7CRCh. 2 - Prob. 8CRCh. 2 - Prob. 9CRCh. 2 - Prob. 10CRCh. 2 - Prob. 11CRCh. 2 - Prob. 12CRCh. 2 - Prob. 13CRCh. 2 - Prob. 14CRCh. 2 - Prob. 15CRCh. 2 - Prob. 16CRCh. 2 - Prob. 17CRCh. 2 - Prob. 18CRCh. 2 - Prob. 19CRCh. 2 - Prob. 20CRCh. 2 - Prob. 21CRCh. 2 - Prob. 22CRCh. 2 - Prob. 23CRCh. 2 - Prob. 24CRCh. 2 - Prob. 25CRCh. 2 - Prob. 26CRCh. 2 - Prob. 27CRCh. 2 - Prob. 28CRCh. 2 - Prob. 29CRCh. 2 - Prob. 30CRCh. 2 - Prob. 31CRCh. 2 - Prob. 32CRCh. 2 - Prob. 33CRCh. 2 - Prob. 34CRCh. 2 - Prob. 35CRCh. 2 - Prob. 36CRCh. 2 - Prob. 37CRCh. 2 - Prob. 38CRCh. 2 - Prob. 39CRCh. 2 - Prob. 40CRCh. 2 - Prob. 41CRCh. 2 - Prob. 42CRCh. 2 - Prob. 43CRCh. 2 - Prob. 44CRCh. 2 - Prob. 45CRCh. 2 - Prob. 46CRCh. 2 - Prob. 47CRCh. 2 - Prob. 48CRCh. 2 - Prob. 49CRCh. 2 - Prob. 50CR
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.Similar questions
- Determine the force in members HI and FI of the truss shown when P = 100 kips.arrow_forward7:33 97% UNIVERSITY OF THE WEST INDIES OPEN CAMPUS MATH0900 SEMESTER 2 2024/2025 Tutorial Assignment 1 – GROUP ASSESSMENT ( 52 marks) 26% Course Work + 4% - from Peer Assessment TOTAL 30% 1) a) From the set {-6, 5, 3.4, 8, -²/5, √(-3), √5, 6i, -3.2, 5+4i} i) List the set of ii) List the set of iii) List the set of vi) List the set of b) Calculate Natural Numbers Integers Numbers Rational Numbers Imaginary numbers (4 marks) || i) 5(-3)+(-6)(-4) -7(-2) = ii) -4(-2)-3(6) + 2(-5) = 3(-2) (2)7-3(-5) (4, 4 marks) 2) a) Calculate 13 -13433 x 5/6 = (4 marks) b) Given 2 3(x-2)=2(2x+3)-1 5 Solve for x (4 marks) Same as 3(x-2)/2 = 2(2x+3)/5 - 1 3) a) Calculate the time taken for an investment of $900,000 to gain an interest of $75,600 if the interest rate is 1.2%. (3 marks) b) 4 sandwiches and 2 drinks cost $46.00 also 3 sandwiches and 1 drinks cost $32.00 What is the cost of each item? (4 marks) 4) a) Out of 7 male employees and 5 female employees 4 are randomly selected for a pay increase. How…arrow_forward2. In a computer network some pairs of computers are connected by network cables. Your goal is to set up the computers so that messages can be sent quickly from any computer to any other computer. For this you have identified each of the n com- puters uniquely with a number between 1 and n, and have decided that a message should consist of two such numbers, identifying the sender and the recipient, fol- lowed by the content of the message. As cables are relatively short, you can assume that sending a message across a single cable takes an amount of time that is the same irrespective of the length of the cable. You can further assume that at most one message travels between computer at any point, so that you don't have to worry about inference among messages. (a) Define a graph or network that models the computer network and allows you to answer the remaining parts of this question. (b) Consider two computers, a sender and a recipient. Using the graph or network you have defined,…arrow_forward
- 3. A spreadsheet consists of cells indexed by a row and a column. Each cell contains either a value or a formula that depends on the values of other cells. (a) Describe a graph, digraph, or network that models an arbitrary spreadsheet and allows you to answer the remaining parts of this question. (b) Explain, by referring to the graph, digraph, or network, when it is possible to change the value of cell x without changing the value of cell y. (c) Explain, by referring to the graph, digraph, or network, when it is possible to calculate the values of all cells in the spreadsheet. Consider the following spreadsheet with 5 rows, 7 columns, and 35 cells. For exam- ple, cell el contains a value, whereas cell al contains a formula that depends on the values cells el and 95. a b с 1 el+g5 al-c5 110 d al+cl 180 e f g f5-el c1+c2 2 al+b1 a2+c4 240 a2+c2 120 f5-e2 e3+e5 3 a2+b2 a3-c3 100 a3+c1 200 f5-e3 f1+f2 4 a3+b3 a4+c2 220 a4+c2 100 f5-e4 f3+f4 5 a4+b4 a5-c1 130 a5+c5 120 g3+g4 g1+g2 (d) Can…arrow_forward1. Let W, U, and S be graphs defined as follows: • V(W) is the set of countries in the world; • V(U) is the set of countries in the European Union; V(S) is the set of countries in the Schengen Area; ● for X = {W,U,S}, E(X) is the set of pairs of countries in V(X) that share a land border. Recall that land borders between countries in the Schengen Area are special in that they can be crossed without a passport. (a) The notions of a country and a land border are somewhat ambiguous. Explain the notions you will use to get a precise definition of the graphs W, U, and S. (b) Is S a subgraph of U? Is U an induced subgraph of W? Justify your answers. (c) Using non-mathematical language, explain what it means for a country x if VEV(S) and dw (v) = 0. Give all such countries. Let A = {v Є V(W) \V(S) such that |Nw(v)| > 0 and Nw (v) ≤ V(S)}. (d) Using non-mathematical language, explain what the set A represents in terms of countries and land borders. Give a specific element of A or explain why A…arrow_forward3. A spreadsheet consists of cells indexed by a row and a column. Each cell contains either a value or a formula that depends on the values of other cells. (a) Describe a graph, digraph, or network that models an arbitrary spreadsheet and allows you to answer the remaining parts of this question. (b) Explain, by referring to the graph, digraph, or network, when it is possible to change the value of cell x without changing the value of cell y. (c) Explain, by referring to the graph, digraph, or network, when it is possible to calculate the values of all cells in the spreadsheet. Consider the following spreadsheet with 5 rows, 7 columns, and 35 cells. For exam- ple, cell el contains a value, whereas cell al contains a formula that depends on the values cells el and 95. a b с d e f g 1 el+g5 al-c5 110 al+cl 180 f5-el c1+c2 2 al+bl a2+c4 240 a2+c2 120 f5-e2 e3+e5 3 a2+b2 a3-c3 100 a3+c1 200 f5-e3 f1+f2 4 a3+b3 a4+c2 220 a4+c2 100 f5-e4 f3+f4 5 a4+b4 a5-c1 130 a5+c5 120 g3+g4 gl+g2 (d) Can…arrow_forward
- Solution: Solution: 7.2 2x²+5x-3. Diagram: till sh one The Steps the same technique as in 4 and 5) above to factor the following Show all the Steps. "Diagram, (2) 03) But (be Wha x+2 3arrow_forwardQ/ solving Laplace equation on Rectangular Rejon a xx+uyy = o u (x, 0) = u(x,2) = 0 u (o,y) = y (1,y) = 27arrow_forwardQ / solving ha place equation a x x + u y y = 0 u (x, 0)=0 u ( x, 2) = 10 u (o,y) = 4 (119)=0 и on Rectangular Rejonarrow_forward
- Conjecture Let x and y be integers. If x is even and y is odd, then xy is even. Try some examples. Does the conjecture seem to be true or false?arrow_forwardSOLVE ONLY FOR (L) (M) AND (O)arrow_forwardFile Preview A gardener has ten different potted plants, and they are spraying the plants with doses of Tertizers. Plants can receive zero or more doses in a session. In the following, we count each possible number of doses the ten plants can receive (the order of spraying in a session does not matter). (a) How many ways are there if there were twelve total doses of a single type of fertilizer? (b) How many ways are there if there are six total doses of a single type of fertilizer, each plant receives no more than one dose? (c) How many ways are there if is was one dose of each of six types of fertilizers? (d) How many ways are there if there are four doses of fertilizer #1 and eight doses of fertilizer #2? (e) How many ways are there if there are four doses of fertilizer #1 and eight doses of fertilizer #2, and each plant receives no more than one dose of fertilizer #1? (f) How many ways are there to do two sessions of spraying, where each plant receives at most two doses total?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Trigonometry (MindTap Course List)TrigonometryISBN:9781305652224Author:Charles P. McKeague, Mark D. TurnerPublisher:Cengage Learning
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Functions and Change: A Modeling Approach to Coll...AlgebraISBN:9781337111348Author:Bruce Crauder, Benny Evans, Alan NoellPublisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Trigonometry (MindTap Course List)
Trigonometry
ISBN:9781305652224
Author:Charles P. McKeague, Mark D. Turner
Publisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Functions and Change: A Modeling Approach to Coll...
Algebra
ISBN:9781337111348
Author:Bruce Crauder, Benny Evans, Alan Noell
Publisher:Cengage Learning
Learn Algebra 6 : Rate of Change; Author: Derek Banas;https://www.youtube.com/watch?v=Dw701mKcJ1k;License: Standard YouTube License, CC-BY