Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )


 Quentin Ford
 2 years ago
 Views:
Transcription
1 1. (Chapter 1 supplementary, problem 7): There are 12 men at a dance. (a) In how many ways can eight of them be selected to form a cleanup crew? (b) How many ways are there to pair off eight women at the dance with eight of those 12 men? Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( ) (b) One way to think about this there are 12 choices for who gets the first woman, 11 choices for who gets the second, and so on, down to 5 choices for who gets the eighth. We multiply because we have to match up each woman. Another way to think about it is that we re again selecting 8 men without repetition, but now order matters, because choosing Adam for Alice and Bob for Betty is different than choosing Bob for Alice and Adam for Betty. Therefore we can use the formula P (12, 8) = 12!. 8! Comments: At second glance, it seems like the book wasn t very precise in laying out this problem. In particular, you had to assume that there were only eight women to be paired off. If a problem like this is on the exam and you re not sure what assumptions you should be making, ask. On the exam, you d have gotten full credit for just writing down the answer (it s a very straightforward problem). However, showing work would have made it more likely for you to get partial credit if you made a mistake. 2. (Chapter 1 supplementary, problem 10): Mr. and Mrs. Richardson want to name their new daughter so that hew initials (First, middle, and last) will be in alphabetical order with no repeated initial. How many triples of initials can occur under these circumstances? Answer: The trick here is to think about the Richardsons as first choosing three letters to use as the initials, then sorting the letters in alphabetical order. There are ( ) 26 3 ways to choose the three letters, and only one way to put them in order. 3. (Chapter 1 supplementary, problem 12): In how many ways can a teacher distribute 12 different science books among 16 students if (a) no student gets more than one book? (b) the oldest student gets two books but no other student gets more than one book? Answer: (a): Method 1: We re choosing one student for each science book. The problem states that we re not allowed to repeat ( no student gets more than one book ) and order matters ( different books). This means we use P (n, k), which in this case is P (16, 12). Method 2: Think of the teacher as first choosing 12 students to give books to, then giving out the books. There are ( 16 12) ways of choosing the students, and 12! ways of assigning the books, so ( 16 12) 12!. (b): We first give two books to the oldest student, then give out the remaining ten. There are ( ) 12 2 ways to choose two books for the older student, and (for the same reason as part (a)) P (15, 10) ways to give ten books to the remaining students. The answer is ( ) 12 2 P (15, 10). 4. (Chapter 1 supplementary, problem 16a): Find the coefficient of x 2 yz 2 in the expansion of [(x/2) + y 3z] 5 1
2 Answer: By the binomial theorem, the coefficient is 5! 2!1!2! ( 1 2 )2 ( 3) 2. As usual, it s okay if you just leave your answer like that. 5. (Section 4.1, problem 15): Prove that for every positive integer n > 4, we have that n 2 < 2 n. Answer: We use induction. We re proving something for n > 4, so our base case is the smallest integer satisfying that, n = 5. In that case, 25 = 5 2 < 2 5 = 32. Now for the inductive step. We assume that n 2 < 2 n, and want to prove that (n + 1) 2 < 2 n+1. There s a couple ways to prove this. One is to note that (n + 1) 2 = n 2 + 2n + 1 n 2 + 3n( since 1 < n) n 2 + n 2 ( since 3 < n, so 3n < n 2 ) 2 n + 2 n = 2 n+1 ( using our inductive hypothesis ) 6. Find a pair of integers (x, y) for which 19x + 47y = 200. Answer: We first use the Euclidean Algorithm to compute GCD(19, 47). 47 2(19) = (9) = 1 9 9(1) = 0 so the GCD is 1. Now we reverse to write 1 as a combination of 19 and 47: 1 = 19 2(9) = 19 2(47 2(19)) = 19 2(47) + 4(19) = 5(19) 2(47). Then we multiply the equation 5(19) 2(47) = 1 by 200 to get 1000(19) 400(47) = 200. Therefore (1000, 400) is a solution. 7. (Section 5.5, problem 4): Let S = {3, 7, 11, 15, 19,..., 95, 99, 103}. How many elements must we select from S to insure that there will be at least two whose sum is 110? Answer: Divide S into the pairs {7, 103}, {11, 99},... {51, 59}, {55}, {3}. There are 14 pairs total, so if we select 15 elements than by the Pigeonhole principle we ve selected two elements from the same subset, so we get a sum of 110. Comment: Again, the book was a bit unclear in its statement of the problem. I assumed it to mean that we shouldn t select the same element twice, and that the two whose sum is 110 must be different. Again, if you aren t sure during the exam about something like this, ASK! 8. (based on Section 5.5, problem 13): Alice and Bob are playing a game. Alice gives Bob a list of five positive integers, each of which is at most 9. Bob wins if he can find two different 2
3 subsets of that list having the same sum. For example, if Alice chooses 1, 2, 4, 5, 7, Bob can choose {1, 2, 4} and {7}, both of which add to 7. Show that no matter what set of 5 integers Alice chooses, Bob can still win. Answer: Suppose we could show that there are more subsets for Bob to choose from then there are possible sums in the set of numbers that Alice chose. We d then be done by the pigeonhole principle. So let s see if this works. There are 2 5 = 32 choices for Bob s subsets. The largest sum possible for Bob is = 35, and the smallest possible sum is 0 (if he leaves everything out. Unfortunately, this is too large. So we ll do a bit of a trick instead. Suppose we further restricted Bob to only choose subsets of size between 1 and 3. Now there are ( ( 5 1) + 5 ( 2) + 5 3) = 25 choices of subsets Bob can take. However, now the largest possible sum is = 24 instead of 35, and the smallest possible sum is 1. Since we have 25 subsets with at most 24 different sums, two subsets have the same sum by the Pigeonhole principle. But this restriction only makes things harder for Bob. Comment: This problem was harder than I had thought (An arithmetic mistake I made when solving it led me to initially believe that the trick wasn t necessary), and probably a bit hard for the final exam. A more reasonable problem would have been to have Alice only allowed to choose numbers between 1 and Find the number of ways of arranging the letters in MAT HEMAT ICS so that no pair of consecutive letters appears. Answer: We use inclusionexclusion. The conditions we want to avoid are: c M : the two M s are consecutive c A : the two A s are consecutive c T : the two T s are consecutive. We have N = S 0 = 11!. For N(c 2!2!2! M), we view the 2 M s as a single letter, so we now have a 10 letter word with two pairs of repeated letters. This gives N(C M ) = 10!, and similarly for 2!2! the other letters, so S 1 = 3(10!). Similarly, S 2!2! 2 = 3(9!), and S 2! 3 = 8!. By inclusionexclusion, the answer is S 0 S 1 + S 2 S 3 = 11! 2!2!2! 3(10!) + 3(9!) 8!. 2!2! 2! 10. Find the number of ways of arranging the letters in MAT HEMAT ICS so that exactly two pairs of consecutive letters occurs (this uses Theorem 8.2 if necessary that theorem will be on your exam). 3
4 Answer: We re looking for E 2, which by the formula with m = 2 is S 2 3S 3 = 3(9!) 2! 38!. 11. Determine the generating function for the sequence 1, 2, 2, 8, 16, 32, 64,... where the formula a n = 2 n holds for every term except the third one. Answer: If the sequence was 1, 2, 4, 8, 16, 32, 64,..., the generating function would be 1 + 2x + (2x) 2 + = 1. Since a 1 2x 2 is 2 instead of 4, we subtract 2x 2, giving f(x) = 1 1 2x 2x Find a generating function for the number of ways of distributing n pennies among five children such that every child gets at least 2 cents and the youngest child gets at most 5 cents. Answer: For each child but the youngest, the generating function for the number of ways a child can get n pennies is x 2 +x 3 +x 4 + = x2. For the youngest child, it is 1 x x2 +x 3 +x 4 +x 5. We multiply (since we re splitting the coins up between children), so that gives us ( x 2 ) 4 (x 2 + x 3 + x 4 + x 5 ) 1 x Comment: As the problem was stated, you could have left (x 2 +x 3 +x ) unsimplified. If I had said in closed form, then you would have had to use the geometric series formula to simplify it down to x2 1 x. 13. Find the x 5 coefficient of x 1 3x. Answer: This is the same as the x 4 1 coefficient of, which by the binomial theorem is 1 3x ( ) ( ) ( 3) 4 = ( 3) 4 ( 1) 4 = Comment: In this case you could also have used the geometric series formula. But if I x had instead asked about, you would have had to have used the binomial theorem. (1 3x) Find the constant (the x 0 coefficient) of (3x 2 x 1 ) 15 Answer: ( When we expand this out by the binomial theorem, the terms will look like 15 ) k (3x 2 ) k ( x 1 ) 15 k for various k. The x cancels for k = 5, so this is the term we want. The answer is ( ) ( 1) 10 = 3 5( )
5 15. Write down, but do not solve, a recurrence relation for the number of ways of writing n as a sum of 2 s, 3 s, and 5 s. Assume that order matters, that is that and are different. Answer: Let a n be the number of ways of writing n as a sum of 2 s, 3 s, and 5 s. If we consider the last number in our sum, it is either 2, 3,or 5. If it is 2, the remaining numbers have to add up to n 2, so there are a n 2 sums ending in 2. Similarly, there are a n 3 sums ending in 3 and a n 5 sums ending in 5. We therefore have a n = a n 2 + a n 3 + a n 5. Since this is a 5 th order recurrence, we need five initial conditions. We can see by inspection that a 1 = 0, a 2 = 1, a 3 = 1, a 4 = 1, a 5 = 3. Comments: Don t forget the initial conditions! 16. Solve: a n 3a n 1 + 2a n 2 = 2 n, a 0 = 0, a 1 = 1. Answer: We first solve a n 3a n 1 +2a n 2 = 0. The characteristic equation is r 2 3r+2 = 0, with roots 1 and 2, so the solution is A + B2 n. Next, we guess a solution to a n 3a n 1 + 2a n 2 = 2 n. Say we tried to guess C2 n. In this case a n 3a n 1 + 2a n 2 = C2 n 3C2 n 1 + 2C2 n 2 = C2 n ( ) = 0, which is hard to make equal to 2 n. So instead we go back and guess Cn2 n. This gives a n 3a n 1 +2a n 2 = Cn2 n 3C(n 1)2 n 1 +2C(n 2)2 n 2 = C2 n (n 3 2 (n 1)+1 2 (n 2)) = C2n ( 1 2. We want this to be equal to 2 n, so we set C = 2. Next we add our two solutions, getting 2n2 n + A + B2 n. Finally, we plug in our initial conditions. a 0 = 0 gives A+B = 0. a 1 = 1 gives 4+A+2B = 1. Solving gives B = 3, A = 3. So our final solution is 3 + (2n 3)2 n. We can check our solution by plugging in 2. Our formula gives a 2 = 7, and a 2 3a 1 +2a n 2 = 7 3 = 4 = 2 2, so it all checks. Comments: The problem we had initially when our guess turned the left hand side into 0 as a sign that we needed to multiply our guess by n. We could have known in advance this would happen, since our guess C2 n was also a solution to the homogenous recurrence. 17. Draw a 3 regular graph on 25 vertices, or explain why no such graph exists. Answer: No such graph exists. If it did, we would have 2e = deg(v) = (25)(3) = 75, so e would not be an integer. 5
6 18. Determine whether the graphs in figure in page 537 of your book are isomorphic or not. Answer: The graphs are not isomorphic. Acceptable reasons would include (i) G 2 contains a 4 cycle where every vertex has degree 4 (wztu). In G 1, the vertices of degree 4 are c, b, f, g, and do not make a cycle. (ii) In G 1, every vertex is contained in a 3 cycle. In G 2, y is not contained in any such cycle. (iii) Graph G 2 contains three 3 cycles intersecting in a single point. Graph G For which n does the Hypercube Q n have an Eulerian trail? Answer: Q n has 2 n vertices, each having degree n. If n is even, every vertex has even degree, so there is an Eulerian circuit. If n is odd, all the vertices have odd degree, so there is only a trail if n = Is graph (f) on page 554 of your book planar? Why or why not? Answer: The graph is not planar. It contains K 5, as can be seen from the below drawing. 6
7 Comment: How did I find this graph? I knew that if I wanted to find a K 5 somewhere inside the graph, the vertices I put in the K 5 had to have degree at least four. There were only five vertices like that in the original graph. Then I checked and saw which pairs of vertices of my five weren t connected in the original graph. For each of those pairs, I found a path going through one of the vertices I hadn t used so far in my graph. 21. (11.4, problem 19): Let G be a loopfree, connected, 4regular, planar graph with 16 edges. How many regions are in a planar drawing of G? Answer: By the formula deg(v) = 2e, we see that the sum of the degrees of the vertices must be 32. Since each vertex has degree 4, there must be 8 vertices. Now we use v e+r = 2. We know v = 8 and e = 16, so r = politicians get together at a party. It is known that each politician despises exactly 7 of his colleagues at the party. Show that we can put all 16 politicians in a receiving line so that nobody has to stand next so someone he or she despises. Answer: Draw a graph where each politician is connected to the people he or she does not despise, not counting him or herself. By assumption, each person is connected to 8 other people, and the graph has 16 vertices. It follows that the graph has a Hamiltonian cycle. We start at an arbitrary point in the cycle and just follow the cycle to get our receiving line. 23. A class of 5 people are trying to divide up into teams to work on at most 3 different projects. It is known that (Alice and Bob), (Bob and Charlie), (Charlie and Dave), (Dave and Alice), (Alice and Edna), and (Edna and Bob) are all incompatible pairs...putting both people in a pair on the same project would be a disaster. a) Express this in terms of a graphcoloring problem. b) Use chromatic polynomials to find the number of different arrangements of teams possible. Answer: We consider a graph where we connect two people if they cannot work together. The situation is equivalent to trying to find a 3 coloring of the graph labelled G below. 7
8 We use the chromatic polynomial recurrence to write P (G, λ) = P (G e, λ) P (G e(λ)). We have P (G e, λ) = λ(λ 1) 3 (λ 2) (there are λ choices for E, λ 1 for A, λ 2 for B, and λ 1 for each of C and D). For P (G e, λ), we see that there are λ choices for A, then λ 1 for B, then λ 2 for each of C and D, so P (G e, λ) = λ(λ 1)(λ 2) 2. Plugging into our recurrence, we see that P (G, λ) = (λ)(λ 1) 3 (λ 2) (λ)(λ 1)(λ 2) 2 We want to use three colors, so λ = 3, and we get P (G, 3) = 24 6 = Prove that any graph on 10 vertices with at least 26 edges must have chromatic number at least 3. Answer: This is really one of your homework problems in disguise. Suppose the chromatic number was 2 or less. Then the graph would be bipartite. If there are k vertices in one class and (10 k) vertices in the other class, there are at most k(10 k) edges connecting the two classes. But this can never be larger than 25, and our graph has 26 edges. Therefore the graph must not be bipartite, and therefore must have chromatic number at least two. Comments: Alternatively, you could think of k as the number of vertices of one color and 10 k as the number of vertices of the other color. It s really the same thing. 25. Find the tree on 8 vertices with Prufer code Answer: Code Vertex Set Edge ,2,3,4,5,6,7, ,3,4,5,6,7, ,3,5,6,7, ,3,6,7, ,6,7, ,7, ,8 38 The tree is the one with the seven edges from the edge column. 26. Problem 3 from section 13.1 Sketch of Answer: The final labels end up being a = (0, )b = (5, a), c = (6, a), f = (12, c), g = (16, h), h = (12, b). 27. (based on 13.4, number 2): Cathy is liked by Albert, Joseph, and Robert; Janice by Joseph and Dennis; Theresa by Albert and Joseph; Nettie by Dennis, Joseph, and Frank; and 8
9 Karen by Albert, Joseph, and Robert. USING THE ALGORITHM FROM THE PROOF OF HALL S THEOREM, find a way of setting up all five women up on dates with men who like them. Be sure to show and explain your procedure. Answer: We start with a bipartite graph where a woman is connected to a man if the man likes them. Initially the entire graph is colored blue. We will take each woman in turn and add her to our matching. Cathy: Connect to Albert. Albert is unused, so stop. At this point the only red edge is (Cathy, Albert) Janice: Connect to Joseph. Joseph is unused, so stop. At this point the red edges are (Cathy, Albert) and (Janice, Joseph) Theresa: Connect to Albert. Albert is already matched to Cathy, so we move down the list and connect Cathy to Joseph. Joseph is already connected to Janice, so we move down her list and connect her to Dennis. This gives the alternating path Theresa Albert Cathy Joseph Janice Dennis. Swapping the colors of every edge on that path leaves (Theresa, Albert), (Cathy, Joseph), and (Janice, Dennis) as red. Nettie: We first connect her to Dennis, who is paired with Janice. Janice can be connected to Joseph, who is paired with Cathy. Cathy is connected to Robert, who is currently unused. Swapping edges on the alternating path Nettie Dennis Janice Joseph Cathy Robert gives the new red edges as (Theresa, Albert), (Cathy, Robert), (Janice, Joseph), (Nettie, Dennis). Karen: Karen likes Albert, who is paired with Theresa, who likes Joseph, who is paired with Janice, who likes Dennis, who is paired with Nettie, who likes Frank. Switching the edges on this path gives new red edges of (Karen, Albert), (Theresa, Joseph), (Janice, Dennis), (Nettie, Frank), (Cathy, Robert), and we stop. Comments: I could have sped things up somewhat if I had been a bit more careful in choosing my alternating paths, for example just connecting Nettie to Frank instead of looking for a long alternating path. Really what I would be looking for here is just an explanation that shows that you understand the gist of the algorithm (continually searching for and swapping alternating path), rather than that you arrive at the correct final matching. 28. (13.4, number 7): Fritz is in charge of assigning students to parttime jobs at the college where he works. He has 25 student applications, and there are 25 different parttime jobs available on the campus. Each applicant is qualified exactly four jobs, but each job can be performed by at exactly four applicants. Can Fritz assign all the students to jobs for which they are qualified? Explain. 9
10 Answer: Yes, he can. Consider a group of k students. If they all listed out the jobs they could do, there would be a total of 4k items on all the lists, but each job would only appear in at most 4 lists. This means, by the pigeonhole principle, that at least k different jobs must be appearing on the lists. In other words, any group of k students has k different jobs they can do. By Hall s theorem, there must be a perfect matching of students to qualified jobs. Comment: This is just the cards in columns problem in disguise. 10
Spring 2007 Math 510 Hints for practice problems
Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an chessboard There are doors between all adjacent cells A prisoner in one
More informationOutline. NPcompleteness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NPcompleteness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More information1 Introduction to Counting
1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationIf A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?
Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationDiscrete Mathematics Problems
Discrete Mathematics Problems William F. Klostermeyer School of Computing University of North Florida Jacksonville, FL 32224 Email: wkloster@unf.edu Contents 0 Preface 3 1 Logic 5 1.1 Basics...............................
More informationCOLLEGE ALGEBRA. Paul Dawkins
COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... Introduction... Integer Exponents... Rational Exponents... 9 Real Exponents...5 Radicals...6 Polynomials...5
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More information6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
More information(Refer Slide Time: 01.26)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture # 27 Pigeonhole Principle In the next few lectures
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More informationNPCompleteness I. Lecture 19. 19.1 Overview. 19.2 Introduction: Reduction and Expressiveness
Lecture 19 NPCompleteness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationInduction. 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
More informationDiscrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
More informationGREEN CHICKEN EXAM  NOVEMBER 2012
GREEN CHICKEN EXAM  NOVEMBER 2012 GREEN CHICKEN AND STEVEN J. MILLER Question 1: The Green Chicken is planning a surprise party for his grandfather and grandmother. The sum of the ages of the grandmother
More informationPigeonhole Principle Solutions
Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such
More informationIntroduction to Diophantine Equations
Introduction to Diophantine Equations Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles September, 2006 Abstract In this article we will only touch on a few tiny parts of the field
More informationFractions and Decimals
Fractions and Decimals Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 1, 2005 1 Introduction If you divide 1 by 81, you will find that 1/81 =.012345679012345679... The first
More informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121
More informationFunctions 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
More informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More informationEuler Paths and Euler Circuits
Euler Paths and Euler Circuits An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once. An Euler path starts and
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More informationAnswer 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.
More informationVISUAL ALGEBRA FOR COLLEGE STUDENTS. Laurie J. Burton Western Oregon University
VISUAL ALGEBRA FOR COLLEGE STUDENTS Laurie J. Burton Western Oregon University VISUAL ALGEBRA FOR COLLEGE STUDENTS TABLE OF CONTENTS Welcome and Introduction 1 Chapter 1: INTEGERS AND INTEGER OPERATIONS
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 201213 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
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More informationLecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
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 informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationComputer Algorithms. NPComplete Problems. CISC 4080 Yanjun Li
Computer Algorithms NPComplete Problems NPcompleteness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order
More information1.1 Logical Form and Logical Equivalence 1
Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic
More informationSouth Carolina College and CareerReady (SCCCR) Algebra 1
South Carolina College and CareerReady (SCCCR) Algebra 1 South Carolina College and CareerReady Mathematical Process Standards The South Carolina College and CareerReady (SCCCR) Mathematical Process
More informationIn a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.
PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs
More informationIntro. to the DivideandConquer Strategy via Merge Sort CMPSC 465 CLRS Sections 2.3, Intro. to and various parts of Chapter 4
Intro. to the DivideandConquer Strategy via Merge Sort CMPSC 465 CLRS Sections 2.3, Intro. to and various parts of Chapter 4 I. Algorithm Design and DivideandConquer There are various strategies we
More informationAn Interesting Way to Combine Numbers
An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis November 28, 2007 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationFACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY
FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this
More informationInduction Problems. Tom Davis November 7, 2005
Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationCHAPTER 3 Numbers and Numeral Systems
CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,
More informations = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 50 51. 2
1. Use Euler s trick to find the sum 1 + 2 + 3 + 4 + + 49 + 50. s = 1 + 2 +... + 49 + 50 s = 50 + 49 +... + 2 + 1 2s = 51 + 51 +... + 51 + 51 Thus, 2s = 50 51. Therefore, s = 50 51. 2 2. Consider the sequence
More information5.1 The Remainder and Factor Theorems; Synthetic Division
5.1 The Remainder and Factor Theorems; Synthetic Division In this section you will learn to: understand the definition of a zero of a polynomial function use long and synthetic division to divide polynomials
More information3.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
More informationALGEBRA 2 CRA 2 REVIEW  Chapters 16 Answer Section
ALGEBRA 2 CRA 2 REVIEW  Chapters 16 Answer Section MULTIPLE CHOICE 1. ANS: C 2. ANS: A 3. ANS: A OBJ: 53.1 Using Vertex Form SHORT ANSWER 4. ANS: (x + 6)(x 2 6x + 36) OBJ: 64.2 Solving Equations by
More informationA Quick Algebra Review
1. Simplifying Epressions. Solving Equations 3. Problem Solving 4. Inequalities 5. Absolute Values 6. Linear Equations 7. Systems of Equations 8. Laws of Eponents 9. Quadratics 10. Rationals 11. Radicals
More informationFactoring Polynomials
UNIT 11 Factoring Polynomials You can use polynomials to describe framing for art. 396 Unit 11 factoring polynomials A polynomial is an expression that has variables that represent numbers. A number can
More informationeach college c i C has a capacity q i  the maximum number of students it will admit
n colleges in a set C, m applicants in a set A, where m is much larger than n. each college c i C has a capacity q i  the maximum number of students it will admit each college c i has a strict order i
More informationMath 1050 Khan Academy Extra Credit Algebra Assignment
Math 1050 Khan Academy Extra Credit Algebra Assignment KhanAcademy.org offers over 2,700 instructional videos, including hundreds of videos teaching algebra concepts, and corresponding problem sets. In
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationMath 2001 Homework #10 Solutions
Math 00 Homework #0 Solutions. Section.: ab. For each map below, determine the number of southerly paths from point to point. Solution: We just have to use the same process as we did in building Pascal
More informationDeterminants can be used to solve a linear system of equations using Cramer s Rule.
2.6.2 Cramer s Rule Determinants can be used to solve a linear system of equations using Cramer s Rule. Cramer s Rule for Two Equations in Two Variables Given the system This system has the unique solution
More informationcalculating probabilities
4 calculating probabilities Taking Chances What s the probability he s remembered I m allergic to nonprecious metals? Life is full of uncertainty. Sometimes it can be impossible to say what will happen
More informationThe program also provides supplemental modules on topics in geometry and probability and statistics.
Algebra 1 Course Overview Students develop algebraic fluency by learning the skills needed to solve equations and perform important manipulations with numbers, variables, equations, and inequalities. Students
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More information13. Write the decimal approximation of 9,000,001 9,000,000, rounded to three significant
æ If 3 + 4 = x, then x = 2 gold bar is a rectangular solid measuring 2 3 4 It is melted down, and three equal cubes are constructed from this gold What is the length of a side of each cube? 3 What is the
More informationDiscrete Mathematics Lecture 5. Harper Langston New York University
Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = 1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREERREADY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More information1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works.
MATH 13150: Freshman Seminar Unit 18 1. The RSA algorithm In this chapter, we ll learn how the RSA algorithm works. 1.1. Bob and Alice. Suppose that Alice wants to send a message to Bob over the internet
More informationPolynomial Operations and Factoring
Algebra 1, Quarter 4, Unit 4.1 Polynomial Operations and Factoring Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned Identify terms, coefficients, and degree of polynomials.
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationPUTNAM 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
More informationLecture 7: NPComplete Problems
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 7: NPComplete Problems David Mix Barrington and Alexis Maciel July 25, 2000 1. Circuit
More informationJust the Factors, Ma am
1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive
More informationProblem 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
More informationNSM100 Introduction to Algebra Chapter 5 Notes Factoring
Section 5.1 Greatest Common Factor (GCF) and Factoring by Grouping Greatest Common Factor for a polynomial is the largest monomial that divides (is a factor of) each term of the polynomial. GCF is the
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationSets, Venn Diagrams & Counting
MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised January 5, 2011 What is a set? Sets set is a collection of objects. The objects in the set are called elements of
More informationON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu
ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a
More informationA permutation can also be represented by describing its cycles. What do you suppose is meant by this?
Shuffling, Cycles, and Matrices Warm up problem. Eight people stand in a line. From left to right their positions are numbered,,,... 8. The eight people then change places according to THE RULE which directs
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationa 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
More informationPolynomials and Vieta s Formulas
Polynomials and Vieta s Formulas Misha Lavrov ARML Practice 2/9/2014 Review problems 1 If a 0 = 0 and a n = 3a n 1 + 2, find a 100. 2 If b 0 = 0 and b n = n 2 b n 1, find b 100. Review problems 1 If a
More informationMA 1125 Lecture 14  Expected Values. Friday, February 28, 2014. Objectives: Introduce expected values.
MA 5 Lecture 4  Expected Values Friday, February 2, 24. Objectives: Introduce expected values.. Means, Variances, and Standard Deviations of Probability Distributions Two classes ago, we computed the
More informationOne last point: we started off this book by introducing another famously hard search problem:
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani 261 Factoring One last point: we started off this book by introducing another famously hard search problem: FACTORING, the task of finding all prime factors
More information1.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.
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
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 information( ) FACTORING. x In this polynomial the only variable in common to all is x.
FACTORING Factoring is similar to breaking up a number into its multiples. For example, 10=5*. The multiples are 5 and. In a polynomial it is the same way, however, the procedure is somewhat more complicated
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationCPM Educational Program
CPM Educational Program A California, NonProfit Corporation Chris Mikles, National Director (888) 8084276 email: mikles @cpm.org CPM Courses and Their Core Threads Each course is built around a few
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 informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More informationMth 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
More informationApplied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationPolynomials and Factoring. Unit Lesson Plan
Polynomials and Factoring Unit Lesson Plan By: David Harris University of North Carolina Chapel Hill Math 410 Dr. Thomas, M D. 2 Abstract This paper will discuss, and give, lesson plans for all the topics
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 halffinished, then the
More information