Combination Locks and Permutations
|
|
- Felicity Marybeth Wheeler
- 7 years ago
- Views:
Transcription
1 Combination Locks and Permutations An Exploration Through Analysis Tim Sasaki Western Oregon University April 9, 2011 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
2 Introduction Suppose we have a combination lock with buttons numbered 1 through n. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
3 Introduction Suppose we have a combination lock with buttons numbered 1 through n. Combinations are entered by pressing buttons in sequence, with each button being pushed only once. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
4 Introduction Suppose we have a combination lock with buttons numbered 1 through n. Combinations are entered by pressing buttons in sequence, with each button being pushed only once. How many combinations are possible? Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
5 Introduction Suppose we have a combination lock with buttons numbered 1 through n. Combinations are entered by pressing buttons in sequence, with each button being pushed only once. How many combinations are possible? If we push buttons one at a time, then the number of combinations is simply n! since we are not repeating buttons. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
6 Introduction Suppose we have a combination lock with buttons numbered 1 through n. Combinations are entered by pressing buttons in sequence, with each button being pushed only once. How many combinations are possible? If we push buttons one at a time, then the number of combinations is simply n! since we are not repeating buttons. However, what if we are allowed to push multiple buttons at once? Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
7 Introduction An example for n = 4 Possible combinations are: {1,2},{3},{4} {2,3,4},{1} {1,3},{2,4} {1},{2},{3},{4} In particular, the set of multiple-button-push combinations contains the set of single-button-push combinations, so we know there are at least n! combinations (the only instance when the number of combinations is actually equal to n! is for n {0,1}). Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
8 Introduction Exhaustive checking works fine for small n. Combinations for n = 3 ({1}, {2}, {3}), ({1}, {3}, {2}), ({2}, {1}, {3}), ({2}, {3}, {1}), ({3}, {1}, {2}), ({3}, {2}, {1}), ({1, 2}, {3}), ({1, 3}, {2}), ({2, 3}, {1}), ({1}, {2, 3}),({2}, {1, 3}), ({3}, {1, 2}), ({1, 2, 3}) There are 13 possible combinations for n = 3. However, the number of combinations as n increases becomes very large. We know that there are at least n! combinations, and the factorials blow up quickly. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
9 Introduction For n = 6, this gives us at least 6! = 720 combinations. Then, we are motivated to try and derive a formula to compute the number of combinations for a lock with n buttons, since writing out each of 720 combinations is not desirable. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
10 Introduction Let a n be the number of combinations for an n-button lock. Then, note that a 0, the number of combinations for a 0-button lock, is equal to 1 (the only combination is no buttons pressed). Further, for any n > 0, a valid combination comprises an initial push of k buttons, for 1 k n, followed by a combination formed with the remaining n k buttons. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
11 Introduction This leads us to a recurrence relation: a n = ( ) ( ) ( ) ( ) ( ) n n n n n n a n k = a n 1 + a n a 1 + a 0, k 1 2 n 1 n k=1 where ( n k) represents the number of ways to pick the initial k buttons and a n k represents the number of ways to choose all of the remaining n k buttons. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
12 Introduction Let s try out our formula using n = 3. Using our recurrence relation, ( ) ( ) ( ) a 3 = a 2 + a 1 + a ( ) ( ) ( ) = (3) + (1) + (1) = (3 3) + (3 1) + (1 1) = 13 This matches the value we had earlier. Naturally, we would like to try and find a closed-form equation instead of a recursive one. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
13 Introduction Let s try out our formula using n = 3. Using our recurrence relation, ( ) ( ) ( ) a 3 = a 2 + a 1 + a ( ) ( ) ( ) = (3) + (1) + (1) = (3 3) + (3 1) + (1 1) = 13 This matches the value we had earlier. Naturally, we would like to try and find a closed-form equation instead of a recursive one. This is a task we will accomplish through the use of some infinite series and integrals. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
14 Introduction Let s try out our formula using n = 3. Using our recurrence relation, ( ) ( ) ( ) a 3 = a 2 + a 1 + a ( ) ( ) ( ) = (3) + (1) + (1) = (3 3) + (3 1) + (1 1) = 13 This matches the value we had earlier. Naturally, we would like to try and find a closed-form equation instead of a recursive one. This is a task we will accomplish through the use of some infinite series and integrals. For the duration of the talk, we will adopt the convention that 0 0 = 1 strictly for notational convenience. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
15 A new recursive formula We now take our relation ( ) ( ) ( ) ( ) ( ) n n n n n n a n = a n k = a n 1 + a n a 1 + a 0, k 1 2 n 1 n k=1 and put in the values of the binomial coefficients: n! a n = (n 1)!1! a n 1 + ( = n! n! (n 2)!2! a n a n 1 (n 1)!1! + a n 2 (n 2)!2! + + a 1 1!(n 1)! + a 0 0!n! n! 1!(n 1)! a 1 + n! 0!n! a 0 ). Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
16 A new recursive formula We now take our relation ( ) ( ) ( ) ( ) ( ) n n n n n n a n = a n k = a n 1 + a n a 1 + a 0, k 1 2 n 1 n k=1 and put in the values of the binomial coefficients: n! a n = (n 1)!1! a n 1 + ( = n! n! (n 2)!2! a n a n 1 (n 1)!1! + a n 2 (n 2)!2! + + a 1 1!(n 1)! + a 0 0!n! n! 1!(n 1)! a 1 + n! 0!n! a 0 ). We notice a relationship in the terms of the sum between each a k and the first factorial in the denominator. We thus define a new term b n = a n / n! and rewrite the relation: a n = n! ( bn 1 1! + b n 2 2! + + b ) 0 n! Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
17 A new recursive formula ( bn 1 a n = n! + b n b ) 0 1! 2! n! Finally, since b n = a n / n!, we divide by n! to get b n = a ( n n! = bn 1 + b n b ) 0 = 1! 2! n! n k=1 b n k. k! This relation is a bit simpler than our original one, so it may be easier to find a closed equation for b n first and then get one for a n. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
18 The calculus begins Theorem 1 For all n > 0, 1 2(ln2) n b n 1 (ln2) n We consider the generating function f (x) = b n x n. n=0 It can be shown using Theorem 1 that the series is absolutely convergent for x < ln2. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
19 And continues. Then, for x < ln 2, f (x) = b 0 + = 1 + b n x n n=1 ( b0 1! x1 ( b0 ) ( b1 + 1! x2 + b ) 0 2! x2 = 1 + 1! x1 + b 1 1! x2 + b 2 1! x3 + b n k = 1 + x n k=1 n=k k! x k = 1 + b n x n k! k=1 n=0 = 1 + (e x 1)f (x) ( b2 + 1! x3 + b 1 2! x3 + b 0 3! x3 ( b0 2! x2 + b 1 2! x3 + ) + From this, we get that f (x) = 1 2 e for x < ln2. x ) + ) + Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
20 And continues.. If b n x n is the power series representation of f at 0, then we know that n=0 the coefficients, b n, have the form b n = f (n) (0). n! Recall that b n = a n / n!, which implies that or a n = f (n) (0), a n = d n ( 1 dx n 2 e x ). x=0 However, this formula is still problematic, since we must calculate each intermediary derivative to get to the n th one if we wish to use it. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
21 And continues... To get past this problem, we can view f (x) as a geometric series: Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
22 And continues... To get past this problem, we can view f (x) as a geometric series: e x = 2 (1) 1 2 (2 ex ) = 1/2 1 e x /2 = 1 ( e x ) k, 2 k=0 2 as long as the series converges, which is for e x /2 < 1. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
23 And continues... To get past this problem, we can view f (x) as a geometric series: e x = 2 (1) 1 2 (2 ex ) = 1/2 1 e x /2 = 1 ( e x ) k, 2 k=0 2 as long as the series converges, which is for e x /2 < 1. Since e x /2 is always positive, this becomes e x 2 < 1 = ex < 2 = x < ln2. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
24 And continues... To get past this problem, we can view f (x) as a geometric series: e x = 2 (1) 1 2 (2 ex ) = 1/2 1 e x /2 = 1 ( e x ) k, 2 k=0 2 as long as the series converges, which is for e x /2 < 1. Since e x /2 is always positive, this becomes e x Then, because 0 < ln 2, 2 < 1 = ex < 2 = x < ln2. [ a n = d n ( 1 e x ) ] k dx n = 1 ( e k n 0 ) k = 1 k n x=0 2 k. k=0 k=0 k=0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
25 And now, integrals We can approximate the sum k=0 k n 2 k 0 x n 2 x dx, Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
26 And now, integrals We can approximate the sum k=0 k n 2 k 0 x n 2 x dx, but first we want to make the substitutions u = x ln2 = x = u/ln2 and dx = 1/ln2 du: Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
27 And now, integrals We can approximate the sum k=0 k n 2 k 0 x n 2 x dx, but first we want to make the substitutions u = x ln2 = x = u/ln2 and dx = 1/ln2 du: x n 0 2 x dx = 0 1 = (ln2) n+1 (u/(ln2)) n 2 u/(ln2) u n 0 1 ln2 du = 1 (ln2) n+1 0 e u du. u n ( 2 (1/ln2) ) u du Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
28 Integrals, continued We focus now on the new integral and use integration by parts n times (choosing the constituent parts wisely): u n 0 du = lim eu b n k=0 n! (n k)! u n k e u b 0 = n n! (n k)! k=0 0 n k e 0. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
29 Integrals, continued We focus now on the new integral and use integration by parts n times (choosing the constituent parts wisely): u n 0 du = lim eu b n k=0 n! (n k)! u n k e u b 0 = n n! (n k)! k=0 0 n k e 0. We note that every term in the sum is equal to 0 except the last, which is n! 0 0 (n n)! e 0 = n! 1 0! 1 = n!. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
30 Integrals, continued We focus now on the new integral and use integration by parts n times (choosing the constituent parts wisely): u n 0 du = lim eu b n k=0 n! (n k)! u n k e u b 0 = n n! (n k)! k=0 0 n k e 0. We note that every term in the sum is equal to 0 except the last, which is n! 0 0 (n n)! e 0 = n! 1 0! 1 = n!. Referring back to our estimation of a n, this gives us a n = 1 2 k=0 k n 2 k x n 2 x dx = 1 u n 2(ln2) n+1 0 e u du = n! 2(ln2) n+1. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
31 A brief recap We ve derived the following formulas for a n so far: 1 a n = ( ) ( ) ( ) ( ) ( ) n n n n n n a n k = a n 1 + a n a 1 + k 1 2 n 1 n k=1 2 a n = d n 3 a n = a n dx n ( 1 2 e x k n k=0 2 k n! 2(ln2) n+1 ) x=0 a 0 We now wish to determine just how accurate our last approximation is. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
32 Some more calculus We begin by defining a function g such that for n N, for all x [0, ), g (x) := x n /e x. The First Derivative Test will show us that g is increasing on [0, n/ ln 2] and decreasing on [n/ ln 2, ). Hence, g has a local maximum at x = n/ln2. We are going to use rectangles to approximate the integral 0 x n e x dx. Instead of using the height at left-or-right endpoints, however, we will be using the suprema (least upper bound) and infima (greatest lower bound) of g in each subinterval. These are called Darboux sums. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
33 A pictoral interlude Break the interval [0, ) into subintervals [0,1],[1,2],, and define j = n/ln2. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
34 Back to work Recall that g has a max at x = n/ln2. The value of g at this point is (n/ln2) n n n ( 2 n/ln2 = ( ) 2 1/ln2 n = n ) n. (ln2) n e ln2 Then, the sum of the areas of the rectangles from the previous slide is Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
35 Back to work Recall that g has a max at x = n/ln2. The value of g at this point is (n/ln2) n n n ( 2 n/ln2 = ( ) 2 1/ln2 n = n ) n. (ln2) n e ln2 Then, the sum of the areas of the rectangles from the previous slide is j k n ( 2 k + n ) n (k) n + e ln2 2 k k=1 k=j +1 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
36 Back to work Recall that g has a max at x = n/ln2. The value of g at this point is (n/ln2) n n n ( 2 n/ln2 = ( ) 2 1/ln2 n = n ) n. (ln2) n e ln2 Then, the sum of the areas of the rectangles from the previous slide is j k n ( k=1 2 k + n ) n (k) n + e ln2 k=j +1 2 k k n ( = 2 k + n ) n ( n ) n. = 2an + e ln2 e ln2 k=0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
37 An answer at last The approximation is clearly greater than the value of the integral, so this gives us x n 0 ( 2 x dx < 2a n ) n 1 ( n ) n n + = < an e ln2 2 e ln2 A similar process for an underestimation of the integral yields Hence, we have n! a n 2(ln2) n+1 < 1 ( n ) n. 2 e ln2 a n n! 2(ln2) n+1 < 1 ( n ) n, 2 e ln2 which means our approximation is within 1 2 ( n e ln2) n of an. n! 2(ln2) n+1. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
38 An unexpected result The error bound we found is a function that increases with n. Despite this, we can show that a n lim n n! /[ 2(ln2) n+1] = 1. The proof uses our derived error bounds, Stirling s Formula, and the Squeeze Theorem to show that lim n a n n! /[ 2(ln2) n+1] 1 = 0. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
39 An unexpected result This may initially seem counter-intuitive, since the error is increasing, but consider as a simple example n 3 + n 2 and n 3. The error between them is n 2, which increases quadratically with n, but n 3 + n 2 lim n n 3 = 1. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
40 Finally, some combinatorics Instead of approximating a n via the methods we have gone through, we can also simply just evaluate the infinite sum. For n 0, define Recalling our formula it is clear that h n (x) = a n = 1 2 k n x k. k=0 k=0 a n = 1 2 h n k n 2 k, So, by finding formulas for each h n, we can find a formula for a n. ( 1 2 ). Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
41 But first, some preliminary calculus (Ha!) Looking at h 0 (x), we have h 0 (x) = k 0 x k = k=0 k=0 x k = 1 1 x 1 < x < 1. We now look at the differentiation of the series: h n (x) = k n k x k 1 = k n+1 x k 1, k=0 k=0 from which we can get xh n (x) = k n+1 x k = h n+1 (x). k=0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
42 Yet another recurrence Given our newly found recurrence, xh n (x) = h n+1(x), we look at its particular values for n 5 : h 0 (x) = 1 1 x x h 1 (x) = (1 x) 2 h 2 (x) = x + x2 (1 x) 3 h 3 (x) = x + 4x2 + x 3 (1 x) 4 h 4 (x) = x + 11x2 + 11x 3 + x 4 (1 x) 5 h 5 (x) = x + 26x2 + 66x x 4 + x 5 (1 x) 6 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
43 Some patterns of note We notice some patterns in each h n : Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
44 Some patterns of note We notice some patterns in each h n : 1 The numerator contains a polynomial of degree n. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
45 Some patterns of note We notice some patterns in each h n : 1 The numerator contains a polynomial of degree n. 2 The coefficients of the polynomial appear to be symmetric. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
46 Some patterns of note We notice some patterns in each h n : 1 The numerator contains a polynomial of degree n. 2 The coefficients of the polynomial appear to be symmetric. 3 The denominator is always (1 x) n+1. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
47 Some patterns of note We notice some patterns in each h n : 1 The numerator contains a polynomial of degree n. 2 The coefficients of the polynomial appear to be symmetric. 3 The denominator is always (1 x) n+1. We define now A n,k to be the coefficient of x k in h n. For example, given A 4,3 = 11. h 4 (x) = x + 11x2 + 11x 3 + x 4 (1 x) 5, Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
48 This is the last recurrence relation Theorem 2 For all n 1, n k=1 h n (x) = A n,k x k (1 x) n+1 where A n,k is defined by the following recurrence: A n,1 = A n,n = 1, A n+1 = k A n,k + (n + 2 k)a n,k 1, for2 k n The proof of Theorem 2 follows by induction. Since we have a formula for A n,k now, we will compute them for the first few values of n. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
49 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
50 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = 1 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
51 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = = 2 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
52 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = = = 6 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
53 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = = = = 24 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
54 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = = = = = 120 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
55 Like Pascal s Triangle, only not These do in fact match the coefficients we found earlier. Recall (or learn anew) that the numbers in the n th row of Pascal s Triangle sum to 2 n. Let s sum the rows of this triangle to see if we get anything interesting: 1 = = = = = 120 These are the factorials! Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
56 Eulerean numbers The A n,k s we defined earlier are, in fact, already well known in combinatorics as the Eulerean numbers, and they denote the number of n-permutations with k increasing runs. As a reminder, an n-permutation is a permutation of 1,2,,n. A definition of an increasing run is as follows: Increasing run For an n-permutation (s 1 s 2 s n ), a sequence of terms s i s i+1 s k where i k, s j < s j +1 for i j < k, and either k = n or s k > s k+1. Example: The permutation ( ) has the increasing runs (1 4), (3 5), and (2). Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
57 No calculus appears on this slide The patterns we noticed earlier are in fact properties of the Eulerean numbers: Theorem 3 For all n 1, (a) n k=1 A n,k = n!, (b) A n,k = A n,n+1 k for1 k n. Part (a) is obvious from the definition of A n,k. A proof of part (b) appears in [Advanced Combinatorics by L. Comtet, p. 242]. Recalling that a n = (1/2)h n (1/2), we can now say ( ) n 1 k=1 a n = A n,k(1/2) k n 2 (1 (1/2)) n+1 = A n,k 2 n k. k=1 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
58 Interpreting the formula The equation a n = n A n,k 2 n k has a natural interpretation for the lock k=1 combinations. If we take an n-permutation with k increasing runs, we can delimit the runs as seen for ( ): ( ). Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
59 Interpreting the formula The equation a n = n A n,k 2 n k has a natural interpretation for the lock k=1 combinations. If we take an n-permutation with k increasing runs, we can delimit the runs as seen for ( ): ( ). The most obvious combination we can get from this is ({4}, {1,3}, {2,5,6}), but we can also create other combinations by limiting any of the remaining spots. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
60 Interpreting the formula The equation a n = n A n,k 2 n k has a natural interpretation for the lock k=1 combinations. If we take an n-permutation with k increasing runs, we can delimit the runs as seen for ( ): ( ). The most obvious combination we can get from this is ({4}, {1,3}, {2,5,6}), but we can also create other combinations by limiting any of the remaining spots. This gives us 2 n k combinations for each n-permutation with k increasing runs, of which there are A n,k. Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
61 Interpreting the formula The equation a n = n A n,k 2 n k has a natural interpretation for the lock k=1 combinations. If we take an n-permutation with k increasing runs, we can delimit the runs as seen for ( ): ( ). The most obvious combination we can get from this is ({4}, {1,3}, {2,5,6}), but we can also create other combinations by limiting any of the remaining spots. This gives us 2 n k combinations for each n-permutation with k increasing runs, of which there are A n,k. A formula does exist for A n,k (see Comtet, pp. 243), we can combine it with the above formula to get ( ) n k 1 a n = ( 1) i n + 1 (k i ) n 2 n k. i k=1 i=0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
62 The Stirling numbers of the second kind Stirling number of the second kind For n N and 1 k n, the Stirling number of the second kind, denoted S(n,k) is equal to the number of ways to partition the set {1, 2,, n} into k unordered non-empty subsets. A combination lock is of course an ordered partition, and if we have k subsets, there are k! ways to order them. Hence, n a n = k!s(n,k). k=1 A formula for S(n,k) exists as well (Comtet, pp ): ( ) S(n,k) = 1 k 1 ( 1) n k (k i ) n. k! i i=0 Thus, we get our last formula for a n : ( ) n k 1 a n = ( 1) n k (k i ) n. i k=1 i=0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
63 Wrapping up Here are all of our formulas for a n : ( ) ( ) ( ) ( ) ( ) n n n n n n 1 a n = a n k = a n 1 + a n a 1 + k=1 k 1 2 n 1 n 2 a n = d n ( ) 1 dx n 2 e x x=0 3 a n = 1 2 k n k=0 2 k n! 4 a n 2(ln2) n+1 ( ) n k 1 5 a n = ( 1) i n + 1 (k i ) n 2 n k k=1 i=0 i ( ) n k 1 6 a n = ( 1) n k (k i ) n i k=1 i=0 a 0 Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
64 References 1. L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht-Holland, D. Velleman and G. Call, Permutations and combination locks, Mathematics Magazine 68 (1995) Tim Sasaki (Western Oregon University) Combination Locks and Permutations April 9, / 35
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
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationTaylor 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
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationHOMEWORK 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
More information9.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
More informationEstimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationSequences 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
More informationMATRIX 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
More informationUndergraduate 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
More informationContinued 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
More information7.6 Approximation Errors and Simpson's Rule
WileyPLUS: Home Help Contact us Logout Hughes-Hallett, Calculus: Single and Multivariable, 4/e Calculus I, II, and Vector Calculus Reading content Integration 7.1. Integration by Substitution 7.2. Integration
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationPartial 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
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More information1 Review of Newton Polynomials
cs: introduction to numerical analysis 0/0/0 Lecture 8: Polynomial Interpolation: Using Newton Polynomials and Error Analysis Instructor: Professor Amos Ron Scribes: Giordano Fusco, Mark Cowlishaw, Nathanael
More information4. Binomial Expansions
4. Binomial Expansions 4.. Pascal's Triangle The expansion of (a + x) 2 is (a + x) 2 = a 2 + 2ax + x 2 Hence, (a + x) 3 = (a + x)(a + x) 2 = (a + x)(a 2 + 2ax + x 2 ) = a 3 + ( + 2)a 2 x + (2 + )ax 2 +
More informationMath 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
More information1 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
More informationStanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions
Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in
More informationMathematical 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
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationMATH 132: CALCULUS II SYLLABUS
MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early
More informationPartial Fractions Decomposition
Partial Fractions Decomposition Dr. Philippe B. Laval Kennesaw State University August 6, 008 Abstract This handout describes partial fractions decomposition and how it can be used when integrating rational
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More information1 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.
More informationA power series about x = a is the series of the form
POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to
More informationExamples of Functions
Examples of Functions In this document is provided examples of a variety of functions. The purpose is to convince the beginning student that functions are something quite different than polynomial equations.
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationCourse Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics
Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used
More informationGeneral 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,
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationCHAPTER 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.,
More information10.2 ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS. The Jacobi Method
578 CHAPTER 1 NUMERICAL METHODS 1. ITERATIVE METHODS FOR SOLVING LINEAR SYSTEMS As a numerical technique, Gaussian elimination is rather unusual because it is direct. That is, a solution is obtained after
More informationInner 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
More informationStirling s formula, n-spheres and the Gamma Function
Stirling s formula, n-spheres and the Gamma Function We start by noticing that and hence x n e x dx lim a 1 ( 1 n n a n n! e ax dx lim a 1 ( 1 n n a n a 1 x n e x dx (1 Let us make a remark in passing.
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More information3. 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)
More informationMathematical 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,
More informationIntegrals 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
More informationDefinition of derivative
Definition of derivative Contents 1. Slope-The Concept 2. Slope of a curve 3. Derivative-The Concept 4. Illustration of Example 5. Definition of Derivative 6. Example 7. Extension of the idea 8. Example
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More informationI remember that when I
8. Airthmetic and Geometric Sequences 45 8. ARITHMETIC AND GEOMETRIC SEQUENCES Whenever you tell me that mathematics is just a human invention like the game of chess I would like to believe you. But I
More informationMATRIX 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 +
More informationPOLYNOMIAL FUNCTIONS
POLYNOMIAL FUNCTIONS Polynomial Division.. 314 The Rational Zero Test.....317 Descarte s Rule of Signs... 319 The Remainder Theorem.....31 Finding all Zeros of a Polynomial Function.......33 Writing a
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationPatterns in Pascal s Triangle
Pascal s Triangle Pascal s Triangle is an infinite triangular array of numbers beginning with a at the top. Pascal s Triangle can be constructed starting with just the on the top by following one easy
More informationReal 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
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationThe 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
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationSolving DEs by Separation of Variables.
Solving DEs by Separation of Variables. Introduction and procedure Separation of variables allows us to solve differential equations of the form The steps to solving such DEs are as follows: dx = gx).
More informationRecursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1
Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationCombinatorial Proofs
Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A
More informationNumerical Solution of Differential
Chapter 13 Numerical Solution of Differential Equations We have considered numerical solution procedures for two kinds of equations: In chapter 10 the unknown was a real number; in chapter 6 the unknown
More information15. 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.
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationUse finite approximations to estimate the area under the graph of the function. f(x) = x 3
5.1: 6 Use finite approximations to estimate the area under the graph of the function f(x) = x 3 between x = 0 and x = 1 using (a) a lower sum with two rectangles of equal width (b) a lower sum with four
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 13. Random Variables: Distribution and Expectation
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 3 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationRegions in a circle. 7 points 57 regions
Regions in a circle 1 point 1 region points regions 3 points 4 regions 4 points 8 regions 5 points 16 regions The question is, what is the next picture? How many regions will 6 points give? There's an
More information8 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
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
More informationPartial 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
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationConstrained optimization.
ams/econ 11b supplementary notes ucsc Constrained optimization. c 2010, Yonatan Katznelson 1. Constraints In many of the optimization problems that arise in economics, there are restrictions on the values
More informationNotes 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
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationDerivatives Math 120 Calculus I D Joyce, Fall 2013
Derivatives Mat 20 Calculus I D Joyce, Fall 203 Since we ave a good understanding of its, we can develop derivatives very quickly. Recall tat we defined te derivative f x of a function f at x to be te
More informationDifferentiation 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
More informationGenerating Functions Count
2 Generating Functions Count 2.1 Counting from Polynomials to Power Series Consider the outcomes when a pair of dice are thrown and our interest is the sum of the numbers showing. One way to model the
More informationSolving Quadratic Equations
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
More informationSection 6.4: Counting Subsets of a Set: Combinations
Section 6.4: Counting Subsets of a Set: Combinations In section 6.2, we learnt how to count the number of r-permutations from an n-element set (recall that an r-permutation is an ordered selection of r
More informationMath 1B, lecture 5: area and volume
Math B, lecture 5: area and volume Nathan Pflueger 6 September 2 Introduction This lecture and the next will be concerned with the computation of areas of regions in the plane, and volumes of regions in
More informationSMT 2014 Algebra Test Solutions February 15, 2014
1. Alice and Bob are painting a house. If Alice and Bob do not take any breaks, they will finish painting the house in 20 hours. If, however, Bob stops painting once the house is half-finished, then the
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More information18.01 Single Variable Calculus Fall 2006
MIT OpenCourseWare http://ocw.mit.edu 8.0 Single Variable Calculus Fall 2006 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Unit : Derivatives A. What
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationMathematics Pre-Test Sample Questions A. { 11, 7} B. { 7,0,7} C. { 7, 7} D. { 11, 11}
Mathematics Pre-Test Sample Questions 1. Which of the following sets is closed under division? I. {½, 1,, 4} II. {-1, 1} III. {-1, 0, 1} A. I only B. II only C. III only D. I and II. Which of the following
More informationAbout the Gamma Function
About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is
More informationLecture 5 Principal Minors and the Hessian
Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and
More informationFactoring A Quadratic Polynomial
Factoring A Quadratic Polynomial If we multiply two binomials together, the result is a quadratic polynomial: This multiplication is pretty straightforward, using the distributive property of multiplication
More informationWeek 13 Trigonometric Form of Complex Numbers
Week Trigonometric Form of Complex Numbers Overview In this week of the course, which is the last week if you are not going to take calculus, we will look at how Trigonometry can sometimes help in working
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationLies My Calculator and Computer Told Me
Lies My Calculator and Computer Told Me 2 LIES MY CALCULATOR AND COMPUTER TOLD ME Lies My Calculator and Computer Told Me See Section.4 for a discussion of graphing calculators and computers with graphing
More informationGeometric Series and Annuities
Geometric Series and Annuities Our goal here is to calculate annuities. For example, how much money do you need to have saved for retirement so that you can withdraw a fixed amount of money each year for
More informationAlum Rock Elementary Union School District Algebra I Study Guide for Benchmark III
Alum Rock Elementary Union School District Algebra I Study Guide for Benchmark III Name Date Adding and Subtracting Polynomials Algebra Standard 10.0 A polynomial is a sum of one ore more monomials. Polynomial
More informationGuide to Leaving Certificate Mathematics Ordinary Level
Guide to Leaving Certificate Mathematics Ordinary Level Dr. Aoife Jones Paper 1 For the Leaving Cert 013, Paper 1 is divided into three sections. Section A is entitled Concepts and Skills and contains
More informationTechniques of Integration
CHPTER 7 Techniques of Integration 7.. Substitution Integration, unlike differentiation, is more of an art-form than a collection of algorithms. Many problems in applied mathematics involve the integration
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More information