Chapter 7. Induction and Recursion. Part 1. Mathematical Induction

Save this PDF as:

Size: px
Start display at page:

Download "Chapter 7. Induction and Recursion. Part 1. Mathematical Induction"

Transcription

1 Chapter 7. Induction and Recursion Part 1. Mathematical Induction The principle of mathematical induction is this: to establish an infinite sequence of propositions P 1, P 2, P 3,..., P n,... (or, simply put, P n (n 1)), it is enough to verify the following two things (1) P 1, and (2) P k P k+ 1 ; (that is, assuming P k vaild, we can rpove the validity of P k+ 1 ). These two things will give a domino effect for the validity of all P n (n 1). Indeed, step (1) tells us that P 1 is true. Applying (2) to the case n = 1, we know that P 2 is true. Knowing that P 2 is true and applying (2) to the case n = 2 we know that P 3 is true. Continue in this manner, we see that P 4 is true, P 5 is true, etc. This argument can go on and on. Now you should be convinced that P n is true, no matter how big is n. We give some examples to show how this induction principle works. Example 1. Use mathematical induction to show (2n 1) = n 2. (Remember: in mathematics, show means prove.) Answer: For n = 1, the identity becomes 1 = 1 2, which is obviously true. Now assume the validity of the identity for n = k: (2k 1) = k 2. For n = k +1, the left hand side of the identity is (2k 1)+(2(k +1) 1) = k 2 +(2k +1) = (k +1) 2 which is the right hand side for n = k +1. The proof is complete. 1

2 Example 2. Use mathematical induction to show the following formula for a geometric series: 1+x+x 2 + +x n = 1 xn+ 1. (x 0) (7.1) 1 x Answer: For n = 1, the formula becomes 1 = 1 x 1 x, which holds trivially. Now we assume the validity of the identity for n = k: 1+x+x 2 + +x k = (1 x k+ 1 )/(1 x). For n = k +1, the left hand side of the formula is 1+x+x 2 + +x k +x k+ 1 = 1 xk+ 1 1 x +xk+ 1 = 1 xk+ 1 1 x + xk+ 1 (1 x) 1 x = 1 xk+ 1 1 x + xk+ 1 x k+ 2 1 x = 1 xk+ 2 1 x which is the right hand side for n = k +1. So the formula is valid for general n. Exercise 1. Prove the following identity by induction: n = n(n+1) 2 (7.2) Exercise 2. Prove the following identity by induction: n 2 = n(n+1)(2n+1). (7.3) 6 Exercise 3. Prove the following identity by induction: n 3 = ( n) 2 (According to Exercise 1, you only need to prove n 3 = ( ) n(n+ 1) 2.) 2 Not every identity depending on n can be handled by induction, as indicated in the following exercise. Exercise 4. Try to prove the following identity by induction: a n+ 1 b n+ 1 = (a b)(a n +a n 1 b+a n 2 b 2 + +ab n 1 +b n ). (7.4) After failing to do so, try to prove this by multiplying out the right hand side. 2

3 Sometimes we can use induction to statements depending on a parameter n of natural numbers, other than identities, as shown in the following example: Example 3. The celebrated Cauchy-Schwarz inequality says (a 1 b 1 +a 2 b 2 + +a n b n ) 2 (a 2 1 +a a 2 n)(b 2 1 +b b 2 n) (7.5) Check this for n = 1, 2. Then use induction to prove this inequality for general n. Answer. When n = 1, the inequality reads (a 1 b 1 ) 2 a 2 1 b2 2. This is clear: in fact, (a 1 b 1 ) 2 = a 2 1b 2 2. Next we verify this inequality for n = 2. Here we rewrite this inequality in different symbols because we need it in the inductive step: (A 1 B 1 +A 2 B 2 ) 2 (A 2 1 +A2 2 )(B2 1 +B2 2 ), ( ) that is, A 2 1B A 1 B 1 A 2 B 2 +A 2 2B 2 2 A 2 1B 2 1 +A 2 1B 2 2 +A 2 2B 2 1 +A 2 2B 2 2. So it is enough to check 2A 1 B 1 A 2 B 2 A 2 1 B2 2 +A2 2 B2 1, which can be recast as A 2 1 B2 2 2A 1B 1 A 2 B 2 +A 2 2 B But A 2 1 B2 2 2A 1B 1 A 2 B 2 +A 2 2 B2 1 = (A 1B 2 A 2 B 1 ) 2 which is clearly 0. Thus ( ) is valid. Now we assume the validity of (a 1 b 1 +a 2 b 2 + +a n b n ) 2 (a 2 1 +a a2 n )(b2 1 +b b2 n ) ( ) for n = k. Notice that the left hand side of ( ) increases or remains the same if all numbers in it are replaced by their absolute values, while the right hand side remains the same. Hence we may (and we do) assume that a j 0 and b j 0 for all j = 1,...,n. By the induction hypothesis, (a 1 b 1 + +a k b k ) 2 (a a 2 k )(b b 2 k ), or a 1 b 1 +a 2 b 2 + +a k b k A 1 B 1, where A 1 = a 2 1 +a a2 k, and B 1 = Now let A 2 = a k+ 1 and B 2 = b k+ 1 and use ( ) to obtain (a 1 b 1 + +a k b k +a k+ 1 b k+ 1 ) 2 (A 1 B 1 +a k+ 1 b k+ 1 ) 2 (A 1 B 1 +A 2 B 2 ) 2 (A 2 1 +A 2 2)(B 2 1 +B 2 2) b 2 1 +b b2 k. = (a 2 1 +a a2 k +a2 k+ 1 )(b2 1 +b b2 k +b2 k+ 1 ), 3

4 and hence ( ) is also valid for n = k +1. Question 5. What is wrong with the following proof of n = n+1? Assume that n = n+1 holds for n = k, that is, k = k +1. Add both sides by 1, we get k +1 = k + 1+1, which shows that the identity n = n+1 also holds for n = k +1. By the principle of induction, n = n+1 is valid for all n. Question 6. What is wrong with the following proof of the statement every man is bald by induction? All we need to do is to establish the statement a man with n hairs or less is bald for all n. When n = 0, 1 or 2, the statement is clearly valid. Now assume that the statement is true for n = k, that is, assume that a man with k hairs or less is bald is valid. Then the statement n = k+1 is also valid because an additional hair cannot change the fact of being bald. So by the principle of induction, the statement a man with n hairs is bald is valid for all n. This proves all men are bald. An important role played by induction is to give proper definitions for many mathematical expressions involving natural numbers. The usual pattern (or its variant) of this definition by induction or by recursion is such: to define a sequence {f(n)} n 1, we take the following two steps: (I) Specify what f(1) is, (II) Specify how f(n+1) can be decided from a subset of f(1), f(2),..., f(n). Example 4. You know the meanings of the expressions a n, and n!. Strictly speaking, they should be defined by induction. We write down the two steps (I), (II) described above for defining each of them: a 1 = a; a n+ 1 = a n a. (With f(n) = a n, f(1) = a and f(n+1) = f(n)f(1).) 1! = 1; (n+1)! = n!(n+1). (With f(n) = n!, f(1) = 1 and f(n+1) = f(n)(n+1).) Certainly, na is also defined by induction: 1a = a and (n+1)a = na+a. 4

5 Example 5. This is an example of great importance about an expression involving the summation symbol that can be defined recursively, given as follows n a k. k= 1 We read the expression as the sum of all terms a k, where k runs from 1 to n. (Earlier we write such an expression simply as a 1 +a 2 + +a n.) Many identities and exercises above can be recast nicely in the format using the summation symbol, for example, n k= 1 (2k 1) = n2, n k= 1 k3 = ( n ) 2, k k= 1 etc.; (see Example 1 and Exercise 3 above). The recursive definition of 1 k= 1 a k = a 1 ; n+ 1 ( n ) a k = k= 1 a k k= 1 + a n+ 1 n k= 1 a k is (with f(n) = n k= 1 a k, f(1) = a 1 and f(n+1) = f(n)+a n+ 1.) Example 6. The famous Fibonacci numbers F n (n = 0,1,2,3,... ) are defined by induction (or recursion): F n = F n 1 +F n 2, n 2, (7.6) which says, starting from the third term, every term in the sequence of Fibonacci numbers is the sum of the previous two terms. In order to determine this sequence, we have to specify the first two terms. Here they are: F 0 = 1 and F 1 = 1. It is easy to produce a few terms at the beginning of the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34,... (This sequence was originally described by the inventor as how rabbits multiply: F n is the number of pairs of rabbits on the nth day. There is an interesting story of this but it does not concern us here.) The mathematical question here is, how can we find a closed expression for F n for general n? There are many ways to answer this question, such as: treat it as a difference equation, or rewrite the recursion relation as a matrix identity [ ] [ ][ ] Fn 1 1 Fn 1 = F n F n 2 and use the method of diagonalization in linear algebra, or use generating functions. 5

6 ** Appendix (may be omitted). We briefly describe the last method here. Form the power series f(x) = n= 0 F nx n. It is called the generating function for the Fibonacci sequence. It converges when x is small enough. Now f(x) = F 0 +F 1 x+ n 2 F nx n = F 0 +F 1 x+ n 2 (F n 1 +F n 2 )x n = 1+x+ n 2 F n 1x n + n 2 F n 2x n = 1+x+ k 1 F kx k+ 1 + l 0 F lx l+ 2 (k = n 1, l = n 2) = 1+x+x ( k 1 F kx k) +x 2( l 0 F lx l) = 1+x+x(f(x) 1)+x 2 f(x) = 1+xf(x)+x 2 f(x). So we have (1 x x 2 )f(x) = 1. We can factorize the polynomial 1 x x 2 as 1 x x 2 = (1 r + x)(1 r x), where r ± = (1 ± 5)/2 (with r + + r = 1 and r + r = 1). Now ( 1 f(x) = 1 x x 2 = 1 (1 r + x)(1 r x) = r+ 1 r + x r ) 1 1 r x r + r = (r + n 0 rn + x n r n 0 rn x n) 1 5 = 1 5 n 0 (rn+ + 1 r n+ 1 )x n. Comparing this with f(x) = n 0 F nx n, we obtain ( F n = 1 (r+ n+ 1 r n+ 1 ) ) n+ 1 ( ) n The amazing thing here is the appearance of the irrational number 5 in this answer for F n, which is always an integer. (End of the appendix **) Exercise 7. Use the recursion relation for Fibonacci numbers to prove the following identity F 0 +F 1 +F 2 + +F n 1 = F n+ 1 1, (n 1). Exercise 8. Prove the amazing identity F m+ n = F m F n +F m 1 F n 1 by induction. Recursion is an important notion for constructing so called recursive functions, which is a key notion in logic and theoretical computer science. 6

7 Part 2. Polynomials: Taylor s formula, binomial formula, etc. By a polynomial we mean a function of the form p(x) = a n x n +a n 1 x n 1 + +a 2 x 2 +a 1 x+a 0 n k= 0 a kx k where a 0, a 1, a 2,..., a n are some constants, called coefficients of p(x). When a n 0, we say that the degree of p(x) is n. Now let us take an arbitrary constant a. Then p(x+a) as a function of x is a polynomial of the same degree as that of p(x). However, the degree of p(x+a) p(x) is lower by 1, since the highest power terms in p(x+a) and p(x) are canceled out. Example 7. Consider the polynomial p(x) = 2x 2 +3x+1 of degree 2. Then, for any constant a, p(x+a) = 2(x+a) 2 +3(x+a)+1 = 2(x 2 +2ax+a 2 )+3(x+a)+1 = 2x 2 +(4a+3)x+(2a 2 +3a+1) which is also a polynomial of degree 2. So p(x+a) p(x) = 4ax+(2a 2 +3a), which is a polynomial of degree 1. The derivative of a polynomial p(x), denoted by p d (x) or p(x), is defined to be dx the limit of the expression (p(x+h) p(x))/h, called a difference quotient as h tends to zero. Thus we write d dx p(x) p(x+h) p(x) p (x) = lim. h 0 h Suppose that the degree of p(x) is n. Then the degree of the difference p(x+h) p(x) drops by 1 and hence we expect that the degree of p (x) is n 1. When p(x) is of degree zero, in other words, when p(x) is a constant function, say p(x) C, we have d dx C = 0. Simply put, the derivative of a constant function is zero. Example 8. Consider the polynomial p(x) = 2x 2 + 3x + 1. From the previous example we know that p(x + a) p(x) = 4ax + (2a 2 + 3a). Replace a by h to get p(x+h) p(x) = 4hx+(2h 2 +3h) = h(4x+2h+3). So p (x) = lim h 0 p(x+h) p(x) h = lim h 0 (4x+2h+3) = 4x+3. 7

8 We will develop some general rules to obtain this answer within seconds. The following are two basic rules for computing derivatives. For simplicity, we write u and v for two polynomials (instead of u(x) and v(x)) and a, b as two constants: Linearity: (au+bv) = au +bv. Product rule: (uv) = u v +uv. They can be checked as follows. For linearity: (au+bv) [au(x+h)+bv(x+h)] [au(x)+bv(x)] (x) = lim h 0 h { = lim a u(x+h) u(x) +b v(x+h) v(x) } = au (x)+bv (x). h 0 h h For the product rule, we need a clever trick of inserting appropriate terms used first time by Leibnitz: (uv) u(x+h)v(x+h) u(x)v(x) (x) = lim h 0 h { u(x+h)v(x+h) u(x)v(x+h) = lim + u(x)v(x+h) u(x)v(x) } h 0 h h { u(x+h) u(x) = lim v(x+h) + u(x) v(x+h) v(x) } h 0 h h = u (x)v(x)+u(x)v (x). (Note: In the mathematical literature this rule is commonly known as Leibnitz rule. Product rule is used in textbooks for the convenience of beginners.) The following identity is a basic formula for differentiating polynomials d dx xn = nx n 1 (n 0) (7.7) Together with linearity, we can find the derivative of a given polynomial instantly. For example, the derivative of p(x) = 2x 2 + 3x + 1 (Example 8 above) is p (x) = 2(2x) = 4x+3. Example 9. Prove (7.7) by induction. Solution. For n = 0, x n is the constant function 1. In this case the identity becomes d 1 = 0, which is valid as we know that the derivative of a constant function vanishes. dx For n = 1, we have dx dx = lim (x+h) x h 0 h h = lim h 0 h = lim 1 = 1 h 0 1.x0. 8

9 Hence the identity is valid for n = 1 as well. Now assume the validity of the identity for n = k, that is, d dx xk = kx k 1. By means of the product rule, we have d dx xk+ 1 = d ( ( ) d dx xk x = )x+x dx ddx xk k x = kx k 1 x+x k = (k +1)x k, showing the validity of the identity for n = k +1. The induction principle tells us that the identity holds for all n 0. The derivative of the derivative p (x) of a polynomial p(x) is called the second derivative of p(x), and is denoted by p (x) or p (2) (x). The derivative of p (2) (x) is called the third derivative of p(x) and is denoted by p (3) (x). In general, we can define the nth derivative p (n) (x) of a polynomial p(x) recursively as follows: p (0) (x) = p(x), p (k+ 1) (x) = d dx p(k) (x). For example, with p(x) = 2x 2 + 3x + 1 (Example 8 above) we have p (1) (x) = 4x + 3, p (2) (x) = 4, p (3) (x) = 0. Exercise 9. In each of the following cases, find all derivatives of a given polynomial p(x): (a) p(x) = 3+4x+2x 2, (b) p(x) = 7+3x+2x 2 +x 3, (c) p(x) = 1 15 x x4. Let f(x) be an arbitrary polynomial and let a be any number. Then f(x+a) is a polynomial in x of the same degree and hence we can put it in the form f(x+a) = n k= 0 c kx k. Replace x by x a through out the last identity, we get f(x) = n c k (x a) k c 0 +c 1 (x a)+c 2 (x a) 2 + +a n (x a) n. (7.8) k= 0 To determine the constant term c 0, we let x = a in (7.8) to get f(a) = c 0. To determine c 1, we take the derivatives of both sides of (8) first: f (x) = c 1 +c 2. 2(x a)+ +c n. n(x a) n 1 and then we substitute x = a to get p (a) = c 1. To get an expression for c j for general j (j n), we need to differentiate both sides of (7.8) j times. This leads us to the question of finding the jth derivative of (x a) k. The answer to this question is d j k! (k j)! (x a)k j if j < k ; dx j (x a)k = k! if j = k ; 0 if j > k. 9 (7.9)

10 You have to convince yourself that (7.9) is correct. Exercise 10. Verify (7.9) for k = 4 and j = 1,2,3,4. When j k, the right hand side of (7.9) either has a factor of x a or is equal to zero, and therefore its value is zero at x = a. When j = k, it becomes k! which is the same as j!. Thus we have d j dx j (x a)k = x= a { j! if j = k ; 0 if j k. (7.10) Now take the jth derivatives of both sides of (7.8) and then evaluate at x = a. The left hand side becomes f (j) (a). It follows from (7.10) that the right hand side becomes j!c j. Thus we have f (j) (a) = j!c j, or c j = f (j) (a)/j!. Replace j by k and substitute the resulting identity c k = f (k) (a)/k! back to (7.8). We finally get f(x) = n k= 0 f (k) (a) k! (x a) k. (7.11) The last identity is called the Taylor expansion at x = a for the polynomial f. Example 10. Use the Taylor expansion to find the partial fractions of x 2 +x+2 (x 1) 3. Solution. Let p(x) = x 2 +x+2. Then p (1) (x) = 2x+1, p (2) (x) = 2, p (3) (x) = 0. So p(1) = 4, p (1) (1) = 3, p (2) (1) = 2. The Taylor expansion of p(x) at x = 1 is p(x) = 4+3(x 1)+(x 1) 2. Hence x 2 +x+2 (x 1) 3 = 4+3(x 1)+(x 1)2 (x 1) 3 = 1 x (x 1) (x 1) 3. which is the requires partial fraction decomposition. Now we apply (7.11) to the monomial f(x) = x n. We have to compute the kth derivative of f(x) = x n for k n. The answer to this is supplied by (7.9). In using (7.9), we switch k to n and j to k, and set a = 0. We obtain f (k) (x) dk dx k xn = 10 n! (n k)! xn k

11 from which we get f (k) (a) = n! (n k)! an k. So (7.11) gives x n = n k= 0 n! k!(n k)! an k (x a) k. Substituting x = a+b to the last identity and noticing that ( ) n! n k!(n k)! =, (7.12) k we obtain n (a+b) n = k= 0 which is the celebrated binomial theorem. ( ) n a n k b k k Exercise 11. Use the binomial theorem to verify the identities ( ) ( ) ( ) ( ) n n n n n = 2 n k= 0 k 0 1 n and n ( ) n k= 0 ( 1)k k ( ) n 0 ( ) ( ) n n + +( 1) n = 0. 1 n The number ( n k), read as n choose k, is interpreted as the number of ways to choose k objects from n objects. For example, ( ) 4 2 = 4! 2!2! = 6 tells us that there are 6 ways to take two objects from a set of 4. Indeed, suppose that the four objects are { }, then the six ways of picking two are { }, { }, { }, { }, { }, { }. The following identities concerning n choose k is basic: ( ) ( ) ( ) ( ) n n n+1 n =, = + k n k k k 1 ( ) n. (7.13) k Both can be understood as follows. The first identity says, in dividing n objects between you and me, k for me and n k for you, the two methods below give the same number of ways. One method is that I pick k objects, leaving the rest to you, and there are ( n k) ways to do this. The other method is that you pick n k objects, leaving the rest to me and there are ( n n k) ways to do this. The second identity concerns the number of ways to pick k objects from n+1 objects. Let us label on of these n+1 objects and call it. There ) ( ways of taking k objects not including and there are n k 1) ways of taking k are ( n k objects including. Together they give ( ) ( n k + n 11 k 1) ways

12 Exercise 12. Use (7.12) to verify (7.13). *The rest material of this chapter is optional. We use the binomial theorem to prove the following assertion inductively: Proposition If p(x) is a polynomial of degree n, then there is a polynomial f(x) of degree n+1 such that p(x) = f(x+1) f(x). This proposition suggests how to find a recipe for the sum S n = p(0)+p(1)+p(2)+p(3)+ +p(n), where p(x) is a given polynomial. Indeed, if we know f(x) with p(x) = f(x+1) f(x) f(x)+f(x+1), S n becomes a telescoping sum : S n = ( f(0)+f(1))+( f(1)+f(2))+( f(2)+f(3))+ +( f(n)+f(n+1)) = f(0)+f(n+1) = f(n+1) f(0). Since the relation f(x+1) f(x) = p(x) is unchanged when we add an constant to f(x), we may arrange f(x) in such a way that f(0) = 0 so that the above identity becomes S n = f(n + 1), which is the required recipe for the sum. This proposition tells us that such f(x) exists. All we need is to look for it that may involve some hard work! Now we use this method to find therecipe forthesum n 2. Certainly the answer is given by (7.3) in Exercise 2, which asks to verify this recipe by induction. But how one can conjure up such a recipe is a complete myth! Our task here is to use a systematic method to demystify this recipe. Here p(x) = x 2. The above proposition tells us that there is a polynomial f(x) of degree 3 such that f(x+1) f(x) = p(x). Let us write f(x) = ax 3 +bx 2 +cx+d. Let us set f(0) = 0 so that d = 0. Now f(1) = f(1) f(0) = p(0) = 0, f(2) = f(2) f(1) = p(1) = 1 2 = 1, f(3) = f(2)+p(2) = = 5. So we have a+b+c = 0, 8a+4b+2c = 1, 27a+9b+3c = 4. The solution to this system of linear equations is a = 1/3, b = 1/2, c = 1/6. So f(x) = 1 3 x3 1 2 x x = (2x2 3x+1)x 6 = (x 1)(2x 1)x 6 12

13 and hence S n = f(n+1) = n(2n+1)(n+1)/6. Now we return to the proof of the proposition by induction on the degree n of p(x). When n = 0, p(x) is a constant, say p(x) = c. In this case we just let f(x) = cx, which is a polynomial of degree Indeed, f(x+1) f(x) = c(x+1) cx = c = p(x). Now we assume that the proposition is valid for all n k 1 and let p(x) be a polynomial of degree k. We can write p(x) = cx k + s(x), where s(x) is of degree k 1. By the induction hypothesis, there is a polynomial g(x) of degree k such that s(x) = g(x + 1) g(x). On the other hand, the binomial theorem tells us that (x+1) k+ 1 = x k+ 1 +(k +1)x k +r(x), where r(x) is a polynomial of degree k 1 and hence r(x) = h(x+1) h(x) for some polynomial h(x) of degree k. Thus we have x k = 1 [ (x+1) k+ 1 x k+ 1 (h(x+1) h(x)) ] = q(x+1) q(x) k +1 where q(x) = (x k+ 1 h(x))/(k +1) is a polynomial of degree k +1. Hence p(x) = c(q(x+1) q(x))+(g(x+1) g(x)) = f(x+1) f(x), where f(x) = cq(x)+g(x) is a polynomial of degree k +1. The proof is complete. 13

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

Taylor and Maclaurin Series

Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions

1 Lecture: Integration of rational functions by decomposition

Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

Functions and Equations

Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

Partial Fractions. p(x) q(x)

Partial Fractions Introduction to Partial Fractions Given a rational function of the form p(x) q(x) where the degree of p(x) is less than the degree of q(x), the method of partial fractions seeks to break

it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

Factorisation 1.5 Introduction In Block 4 we showed the way in which brackets were removed from algebraic expressions. Factorisation, which can be considered as the reverse of this process, is dealt with

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

SOLVING POLYNOMIAL EQUATIONS

C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

15. Symmetric polynomials

15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.

3.4 Complex Zeros and the Fundamental Theorem of Algebra

86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights

Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

Math 5311 Gateaux differentials and Frechet derivatives

Math 5311 Gateaux differentials and Frechet derivatives Kevin Long January 26, 2009 1 Differentiation in vector spaces Thus far, we ve developed the theory of minimization without reference to derivatives.

1.7. Partial Fractions. 1.7.1. Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

.7. PRTIL FRCTIONS 3.7. Partial Fractions.7.. Rational Functions and Partial Fractions. rational function is a quotient of two polynomials: R(x) = P (x) Q(x). Here we discuss how to integrate rational

Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

Representation of functions as power series

Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions

MATH PROBLEMS, WITH SOLUTIONS

MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These

1.3 Polynomials and Factoring

1.3 Polynomials and Factoring Polynomials Constant: a number, such as 5 or 27 Variable: a letter or symbol that represents a value. Term: a constant, variable, or the product or a constant and variable.

Tim Kerins. Leaving Certificate Honours Maths - Algebra. Tim Kerins. the date

Leaving Certificate Honours Maths - Algebra the date Chapter 1 Algebra This is an important portion of the course. As well as generally accounting for 2 3 questions in examination it is the basis for many

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

Integrals of Rational Functions

Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t

Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

expression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.

A polynomial of degree n (in one variable, with real coefficients) is an expression of the form: a n x n + a n 1 x n 1 + a n 2 x n 2 + + a 2 x 2 + a 1 x + a 0 where a n, a n 1, a n 2, a 2, a 1, a 0 are

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

General Framework for an Iterative Solution of Ax b. Jacobi s Method

2.6 Iterative Solutions of Linear Systems 143 2.6 Iterative Solutions of Linear Systems Consistent linear systems in real life are solved in one of two ways: by direct calculation (using a matrix factorization,

Exercises with solutions (1)

Exercises with solutions (). Investigate the relationship between independence and correlation. (a) Two random variables X and Y are said to be correlated if and only if their covariance C XY is not equal

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

Review for Calculus Rational Functions, Logarithms & Exponentials

Definition and Domain of Rational Functions A rational function is defined as the quotient of two polynomial functions. F(x) = P(x) / Q(x) The domain of F is the set of all real numbers except those for

Equations, Inequalities & Partial Fractions

Contents Equations, Inequalities & Partial Fractions.1 Solving Linear Equations 2.2 Solving Quadratic Equations 1. Solving Polynomial Equations 1.4 Solving Simultaneous Linear Equations 42.5 Solving Inequalities

Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

Differentiation and Integration

This material is a supplement to Appendix G of Stewart. You should read the appendix, except the last section on complex exponentials, before this material. Differentiation and Integration Suppose we have

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

Factoring Special Polynomials

6.6 Factoring Special Polynomials 6.6 OBJECTIVES 1. Factor the difference of two squares 2. Factor the sum or difference of two cubes In this section, we will look at several special polynomials. These

Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than

Factoring the trinomial ax 2 + bx + c when a = 1 A trinomial in the form x 2 + bx + c can be factored to equal (x + m)(x + n) when the product of m x n equals c and the sum of m + n equals b. (Note: the

Factoring Trinomials: The ac Method

6.7 Factoring Trinomials: The ac Method 6.7 OBJECTIVES 1. Use the ac test to determine whether a trinomial is factorable over the integers 2. Use the results of the ac test to factor a trinomial 3. For

3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Solving linear equations 3.1 Introduction Many problems in engineering reduce to the solution of an equation or a set of equations. An equation is a type of mathematical expression which contains one or

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

Overview of Math Standards

Algebra 2 Welcome to math curriculum design maps for Manhattan- Ogden USD 383, striving to produce learners who are: Effective Communicators who clearly express ideas and effectively communicate with diverse

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

Polynomials (Ch.1) Study Guide by BS, JL, AZ, CC, SH, HL Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given. Sasha s method

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation

College Algebra - MAT 161 Page: 1 Copyright 2009 Killoran

College Algebra - MAT 6 Page: Copyright 2009 Killoran Zeros and Roots of Polynomial Functions Finding a Root (zero or x-intercept) of a polynomial is identical to the process of factoring a polynomial.

To define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions

Chapter 7 Functions This unit defines and investigates functions as algebraic objects. First, we define functions and discuss various means of representing them. Then we introduce operations on functions

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

3.2 The Factor Theorem and The Remainder Theorem

3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial

6.1 Add & Subtract Polynomial Expression & Functions

6.1 Add & Subtract Polynomial Expression & Functions Objectives 1. Know the meaning of the words term, monomial, binomial, trinomial, polynomial, degree, coefficient, like terms, polynomial funciton, quardrtic

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

The Method of Partial Fractions Math 121 Calculus II Spring 2015

Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

Polynomial and Rational Functions Outline 3-1 Polynomial Functions 3-2 Finding Rational Zeros of Polynomials 3-3 Approximating Real Zeros of Polynomials 3-4 Rational Functions Chapter 3 Group Activity:

x 2 x 2 cos 1 x x2, lim 1. If x > 0, multiply all three parts by x > 0, we get: x x cos 1 x x, lim lim x cos 1 lim = 5 lim sin 5x

Homework 4 3.4,. Show that x x cos x x holds for x 0. Solution: Since cos x, multiply all three parts by x > 0, we get: x x cos x x, and since x 0 x x 0 ( x ) = 0, then by Sandwich theorem, we get: x 0

Mth 95 Module 2 Spring 2014

Mth 95 Module Spring 014 Section 5.3 Polynomials and Polynomial Functions Vocabulary of Polynomials A term is a number, a variable, or a product of numbers and variables raised to powers. Terms in an expression

Sequences and Series

Sequences and Series Consider the following sum: 2 + 4 + 8 + 6 + + 2 i + The dots at the end indicate that the sum goes on forever. Does this make sense? Can we assign a numerical value to an infinite

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

Jacobi s four squares identity Martin Klazar

Jacobi s four squares identity Martin Klazar (lecture on the 7-th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

2 Complex Functions and the Cauchy-Riemann Equations

2 Complex Functions and the Cauchy-Riemann Equations 2.1 Complex functions In one-variable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)

Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression

5.4 The Quadratic Formula

Section 5.4 The Quadratic Formula 481 5.4 The Quadratic Formula Consider the general quadratic function f(x) = ax + bx + c. In the previous section, we learned that we can find the zeros of this function