MATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30

Size: px
Start display at page:

Download "MATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30"

Transcription

1 MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in class, its also very similar to the flag-code problem. The solution is as follows. If each of the repeated letters was distinct B 1 O 1 O 2 K 1 K 2 E 1 E 2 P 1 E R 1 then there would be 10! ways to arrange these letters. However we need to divide by 2!2!! since each of the! permutations of the E s, the 2! permutations of the O s and 2! of the K s that give us the same word. Thus the total number of words is: 10!!2!2! =. We also can think of this as 10 objects with 1 of type B, of type E, 2 of type K, and 2 of type 0, and 1 of type R. As verified in class the number of distinct orderings from this set is exactly the same as the number above. We also called this number 10. 1,, 2, 2, 1 Problem 2. There are 10 students at a school and three dormetories A, B, and C with capacities 0, 5, and 5 respectively. (a) How many ways are there to fill up the dormitories? We have to split 10 distinct students into three distinct subgroups (dormitories A, B and C) with fixed sizes (0, 5, and 5 respectively). This is exactly counted by: 10 = 10! 0, 5, 5 0!5!5! (b) Suppose that of the 10 students, 0 are men and 70 are women and that A is an all men s dorm, B is an all women s dorm and C is co-ed. How many ways are there to fill up the dormitories? 1

2 0 To count this, first choose the 0 men for dorm A from the 0 possible men by. ( 0 ) 70 Second choose the 5 women from the 70 women, that will go into dorm B by. 5 The remainder will then be in dorm C. By the basic principle of counting the total possible placings of the students is the product: !70! = 0 5 0!0!5!5!. Problem. In how many ways can ten people be seated in a row if: (a) there are no restrictions on the seating arrangement? This is a simple permutation of 10 distinct objects. Thus the solution is 10! =. (b) persons A and B must sit next to each other? If A and B must sit together we treat them as one person and order them with the remaining 8 people in 9! different ways. Then for each of those orderings we either have A first or B first or 2 possible arrangements. By the basic counting principle we have a total of 2 9! = orderings. (c) there are 5 men and 5 women, and no 2 men or 2 women can sit next to each other? First choose if they sit mwmwmwmwmw or wmwmwmwmwm. Once this is chosen then order the men in their seats. Since there are five of them there are 5! arrangements. Similarly the women can then be seated in 5! different ways. Thus the total number of arrangements is 2 5! 5! =. (d) there are 5 men and they must sit next to each other? 2

3 If the 5 men must sit next to each other then if the seates are ordered #1 #10 then the first man can be in seat #1 #. Choose this seat ( ways). Then order the 5 men (5!). Then order the 5 women in the remaining seats (5!). Thus the total number of orderings is 5! 5! =. (e) there are 5 married couples, and each couple must sit together? To count this treat each couple as an object and order them in 5! ways. Then once their two seats are chosen there are 2 ways the first couple can sit (mw or wm). Then there are 2 ways in which the second couple can sit and so forth. Giving a total of 5!2 5 = arrangements of the people. Problem 4. properties? How many integers greater then 5400 have both of the following (a) The digits are distinct. (b) The digits 2 and 7 do not occur. To do this problem we split it into cases. First consider the numbers with 8 digits. in this case we must order the digits 1,, 4, 5,, 8, 9, and 0. However when we pick the digit for the first entry we only have 7 choices since 0 cannot be the first digit. Then once we have chosen that digit we have to order the remaining 7 digits in any of the 7! possible permutations. Thus the total number is 7 7! = In a similar fashion there are 7 7! = 5280 seven digit numbers, = 1740 six digit numbers of this type and = 5880 five digit numbers. The four digit numbers must be handled in cases since they must be bigger then First count the numbers that are 000 or bigger. To do this there are choices for the first digit (,8, or 9) then 7 choices for the second, for the third, and 5 for the fourth position, giving 7 5 = 0 numbers of this type. Secondly consider the numbers that begin with a 5. Then there are four choices for the second digit (4,, 8, or 9 ) that can be picked for the second digit. Then the third digit must be chosen from the remaining digits and then there are 5 choices for the fourth digit Giving 4 = 120 numbers of this type. Thus the total number of integers satisfying conditions (a) and (b) is = 9480.

4 Problem 5. (a) Suppose that Michigan table tennis team of 1 players splits into pairs for practicing. How many different splittings are possible? One way to think of this is that you have to take 1 people and envision placing two at each of 8 tables numbered 1-8. This is splitting 1 people into 8 distinct groups of 2 people each. The number of ways to do this is: ( ) 1 = 2, 2, 2, 2, 2, 2, 2, 2 1! 2!2!2!2!2!2!2!2!. However we have over counted since if Ms A and Mr. B are at table one or at table 2 makes no difference. Thus we must divide by 8!. Giving pairings. (b) Suppose that Michigan table tennis team of 12 players competes with MSU team of 12 players. How many different splittings are possible (each pair contains a player of each team)? This is actually easy to count because we envision the Michigan players lined up. Then we start with the first one in line and pick a MSU player to be paired with him. There are 12 ways to do this. Next we go to the second Michigan player and we have 11 possible choices of MSU players to play him, and so on. So a total of 12! possible pairing are possible. Problem. A classroom has 2 rows of 8 seats each. There are 14 students, 5 of whom always sit in the front row and 4 of whom always sit in the back row. In how many ways can the students be seated? Consider the probblem by breaking it into pieces. First suppose the back-row sitters walk into the room. Then there are 8 choices of where the first one to walk in can sit. 7 for the second, for the third and 5 for the fourth. Next the front-row-sitters walk in. There are 8 choices for the first 7 for the second,...4 for the 5th. Now the five remaining students walk in one at a time. There are 7 seats remaining and the first of these students that walks in has 7 choices of where to sit, the second has six choices,... the fifth has choices of where to sit. Viewing the problem in this way tells us that the answer should be: (8 7 5)( )(7 5 4 ) =

5 Problem 7. From a group of 8 women and men a committee consisting of men and women is to be formed. How many dierent committees are possible if: (a) 2 of the men (Mr. X and Mr. Y) refuse to serve together; We count this by first considering all the possible committees with out any restriction and then subtracting the number of committees with Mr. A and Mr. B. The total number of ways to choose men from is and the total ways of choosing 8 women from 8 is. Thus the total number of committees with men and 8 women is the product = Now if we count the number of committees that have both ( Mr. ) A and Mr. B then we must choose the one remaining man from 4 8 the other 4 or and then choose the women from 8. Giving a total of = 224. Thus subtracting the two gives = 89. (Note one could do this problem by considering the possible committees with neither A nor B and then as a separate case consider the committees with exactly one of A or B and then add the cases together) (b) 2 of the women (Ms. A and Ms. B) refuse to serve together; This proceeds in an analogous fashion to part (a) and we subtract the committees with both Ms. A and Ms. B from the total (1120 as counted in part (a)). The number of ( ways ) that Ms. A and Ms B can serve together is by first choosing the three men and then choosing one more woman from the other or =. Thus the 1 total number of committees with both Ms. A and Ms. B is = 120. Thus, the total number of committees when they DO NOT serve together is = (c) 1 man (Mr. X) and 1 woman (Ms. A) refuse to serve together? 5

6 Again we proceed in a similar fashion and count the committees when Mr. X and Ms. A serve together. To do this we first choose the 2 other men from the remaining 5, 5 7 or = 10 and then choose the other 2 women from the remaining 7 or = Thus the total number of ways in which they can serve together is the product of these two numbers of 210. Now the total number of committees in which they do not serve together is our total number of committees with no restrictions (1120) minus the committees where they do serve together (210). Thus the answer is 910. Problem 8. Let r, n, and m be positive integers, and let r < n and r < m. Then the following identity holds: n + m = r r i=0 n m. i r i Prove it combinatorially by considering a group of n men and m women, and determining (in two different ways) how many groups of size r are possible. To prove this we follow the suggestion and consider a group of n men and m women, and count the number of committees of r people we can choose from the total (n+m) people. Clearly one way to count this is the left hand side (LHS) of the equation we wish to verify. Now consider counting the same thing but breaking it into cases were we consider the committees that have no men, exactly 1 man, exactly 2 men,..., all r are men. To do this consider the arbitrary case where there are i men in the( committee ) and r-i n women. Thus we must choose the i men from the total n men or and we must i m choose the r-i women from the total m women or Thus the total number of r i committees with r people with i of them men and r-i of them women is the product, n m. Now since we want to count all the possible committees we must add i r i all the cases where i = 0, i = 1,...i = r. This is exactly the right hand side of the equation we wish to verify. Since both the left and the right hand side count the same thing, they must be equal. Problem 9. In the expansion of (z + 8y) 7, what is the coefficient of z 4 y?

7 Recall the binomial theorem: (a + b) n = n i=0 n a i b n i. i Using this, (z + 8y) 7 = 7 i=0 7 z i (8y) 7 i. i If I want the coefficient of z 4 y then i must consider the term 7 coefficient of that term is (8) 4 = z 4 4 (8y). Thus the Problem 10. There are 12 people to attend a dinner party and sit at a round table. (a) How many ways can these 12 people be arranged at the table? ( supposing that any seating arangement is equivalent to another if they are rotations of each other) Since any arrangement of the people at the table can be rotated so that a certain distinguished person (call him Bob) is sitting at the head of the table. We can count just the arrangements where Bob is sitting at the top of the table. To do this we order the remaining 11 people around the table in 11! ways. (b) Suppose there are men and women, How many seating arrangements are there if no two men are to sit together. In the same fashion we suppose Bob is sitting at the top. Then the person sitting to he left must be a woman and there are choices for that seat. Then we go the her left and there must be a man (other then bob so there are 5 choices for this seat. We continue around the table giving a total of! 5! = 8400 arrangements around the table. (c) How many arrangements are there if the host and the hostess are to sit opposite eachother, but the rest of the guests may sit anywhere? 7

8 Again we proceed in the same fashion and suppose that the Host is at 12 o clock and that the hostess is seated at o clock. Thus we must just order the remaining 10 people and there are 10! = ways to do so. Problem 11 How many integer solutions of: x 1 + x 2 + x + x 4 = 0 satisfy, x 1 2, x 2 0, x 5, and x 4 8? To solve this problem we re-scale the variables by letting y 1 = x 1 2, y 2 = x 2, y = x + 5, and y 4 = x 4 8. Solving for each x i and substituting into the equation above we obtain: (y 1 + 2) + y 2 + (y 5) + (y 4 + 8) = 0, where each y i is now greater then or equal to 0. Manipulating the constants gives us: y 1 + y 2 + y + y 4 = 25. As per definition in class, the number of integer solutions to this equation is given by: = = = ! 8

Mat 344F challenge set #2 Solutions

Mat 344F challenge set #2 Solutions Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This

More information

CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions)

CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions) CSE 312: Foundations of Computing II Quiz Section #2: Combinations, Counting Tricks (solutions Review: Main Theorems and Concepts Combinations (number of ways to choose k objects out of n distinct objects,

More information

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s.

In this section, we will learn to. 1. Use the Multiplication Principle for Events. Cheesecake Factory. Outback Steakhouse. P.F. Chang s. Section 10.6 Permutations and Combinations 10-1 10.6 Permutations and Combinations In this section, we will learn to 1. Use the Multiplication Principle for Events. 2. Solve permutation problems. 3. Solve

More information

IB HL Mathematics Homework 2014

IB HL Mathematics Homework 2014 IB HL Mathematics Homework Counting, Binomial Theorem Solutions 1) How many permutations are there of the letters MATHEMATICS? Using the permutation formula, we get 11!/(2!2!2!), since there are 2 M's,

More information

Topics to be covered

Topics to be covered Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6 CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3

More information

Counting. Chapter 6. With Question/Answer Animations

Counting. Chapter 6. With Question/Answer Animations . All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter

More information

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017 MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa

More information

HOMEWORK ASSIGNMENT 5

HOMEWORK ASSIGNMENT 5 HOMEWORK ASSIGNMENT 5 MATH 251, WILLIAMS COLLEGE, FALL 2006 Abstract. These are the instructor s solutions. 1. Big Brother The social security number of a person is a sequence of nine digits that are not

More information

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together?

LEVEL I. 3. In how many ways 4 identical white balls and 6 identical black balls be arranged in a row so that no two white balls are together? LEVEL I 1. Three numbers are chosen from 1,, 3..., n. In how many ways can the numbers be chosen such that either maximum of these numbers is s or minimum of these numbers is r (r < s)?. Six candidates

More information

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson

JUST THE MATHS UNIT NUMBER PROBABILITY 2 (Permutations and combinations) A.J.Hobson JUST THE MATHS UNIT NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects

More information

STAT 430/510 Probability Lecture 1: Counting-1

STAT 430/510 Probability Lecture 1: Counting-1 STAT 430/510 Probability Lecture 1: Counting-1 Pengyuan (Penelope) Wang May 22, 2011 Introduction In the early days, probability was associated with games of chance, such as gambling. Probability is describing

More information

Counting in Algorithms

Counting in Algorithms Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different

More information

Latin Squares for Elementary and Middle Grades

Latin Squares for Elementary and Middle Grades Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many

More information

Discrete Structures Lecture Permutations and Combinations

Discrete Structures Lecture Permutations and Combinations Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these

More information

With Question/Answer Animations. Chapter 6

With Question/Answer Animations. Chapter 6 With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and

More information

Finite Math Section 6_4 Solutions and Hints

Finite Math Section 6_4 Solutions and Hints Finite Math Section 6_4 Solutions and Hints by Brent M. Dingle for the book: Finite Mathematics, 7 th Edition by S. T. Tan. DO NOT PRINT THIS OUT AND TURN IT IN!!!!!!!! This is designed to assist you in

More information

Section Summary. Permutations Combinations Combinatorial Proofs

Section Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement

More information

Math Fall 2011 Exam 2 Solutions - November 1, 2011

Math Fall 2011 Exam 2 Solutions - November 1, 2011 Math 365 - Fall 011 Exam Solutions - November 1, 011 NAME: STUDENT ID: This is a closed-book and closed-note examination. Calculators are not allowed. Please show all your work. Use only the paper provided.

More information

Modular arithmetic Math 2320

Modular arithmetic Math 2320 Modular arithmetic Math 220 Fix an integer m 2, called the modulus. For any other integer a, we can use the division algorithm to write a = qm + r. The reduction of a modulo m is the remainder r resulting

More information

Name: Spring P. Walston/A. Moore. Topic worksheet # assigned #completed Teacher s Signature Tree Diagrams FCP

Name: Spring P. Walston/A. Moore. Topic worksheet # assigned #completed Teacher s Signature Tree Diagrams FCP Name: Spring 2016 P. Walston/A. Moore Topic worksheet # assigned #completed Teacher s Signature Tree Diagrams 1-0 13 FCP 1-1 16 Combinations/ Permutations Factorials 1-2 22 1-3 20 Intro to Probability

More information

Case 1: If Denver is the first city visited, then the outcome looks like: ( D ).

Case 1: If Denver is the first city visited, then the outcome looks like: ( D ). 2.37. (a) Think of each city as an object. Each one is distinct. Therefore, there are 6! = 720 different itineraries. (b) Envision the process of selecting an itinerary as a random experiment with sample

More information

Compound Probability. Set Theory. Basic Definitions

Compound Probability. Set Theory. Basic Definitions Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic

More information

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions)

CSE 312: Foundations of Computing II Quiz Section #1: Counting (solutions) CSE 31: Foundations of Computing II Quiz Section #1: Counting (solutions Review: Main Theorems and Concepts 1. Product Rule: Suppose there are m 1 possible outcomes for event A 1, then m possible outcomes

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/7 2.3 Counting Techniques (III) - Partitions Probability p.2/7 Partitioned

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility

More information

Math 475, Problem Set #3: Solutions

Math 475, Problem Set #3: Solutions Math 475, Problem Set #3: Solutions A. Section 3.6, problem 1. Also: How many of the four-digit numbers being considered satisfy (a) but not (b)? How many satisfy (b) but not (a)? How many satisfy neither

More information

Solutions to Exercises Chapter 6: Latin squares and SDRs

Solutions to Exercises Chapter 6: Latin squares and SDRs Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,

More information

50 Counting Questions

50 Counting Questions 50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,

More information

Permutations and Combinations

Permutations and Combinations Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;

More information

DISCRETE STRUCTURES COUNTING

DISCRETE STRUCTURES COUNTING DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the

More information

CIS 2033 Lecture 6, Spring 2017

CIS 2033 Lecture 6, Spring 2017 CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,

More information

MANIPULATIVE MATHEMATICS FOR STUDENTS

MANIPULATIVE MATHEMATICS FOR STUDENTS MANIPULATIVE MATHEMATICS FOR STUDENTS Manipulative Mathematics Using Manipulatives to Promote Understanding of Elementary Algebra Concepts Lynn Marecek MaryAnne Anthony-Smith This file is copyright 07,

More information

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product

More information

Math236 Discrete Maths with Applications

Math236 Discrete Maths with Applications Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,

More information

Solutions for the Practice Final

Solutions for the Practice Final Solutions for the Practice Final 1. Ian and Nai play the game of todo, where at each stage one of them flips a coin and then rolls a die. The person who played gets as many points as the number rolled

More information

6.2 Modular Arithmetic

6.2 Modular Arithmetic 6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through

More information

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Staircase Rook Polynomials and Cayley s Game of Mousetrap Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:

More information

Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION

Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION 3.1 The basics Consider a set of N obects and r properties that each obect may or may not have each one of them. Let the properties be a 1,a,..., a r. Let

More information

Sec$on Summary. Permutations Combinations Combinatorial Proofs

Sec$on Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?

More information

Principle of Inclusion-Exclusion Notes

Principle of Inclusion-Exclusion Notes Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.

More information

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b 11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in

More information

n! = n(n 1)(n 2) 3 2 1

n! = n(n 1)(n 2) 3 2 1 A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event

More information

Chapter 6.1. Cycles in Permutations

Chapter 6.1. Cycles in Permutations Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS PERMUTATIONS AND COMBINATIONS 1. Fundamental Counting Principle Assignment: Workbook: pg. 375 378 #1-14 2. Permutations and Factorial Notation Assignment: Workbook pg. 382-384 #1-13, pg. 526 of text #22

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS 8 PERMUTATIONS AND COMBINATIONS FUNDAMENTAL PRINCIPLE OF COUNTING Multiplication Principle : If an operation can be performed in 'm' different ways; following which a second operation can be performed

More information

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand. Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating

More information

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap European Journal of Combinatorics 30 (2009) 532 539 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Staircase rook polynomials

More information

5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.

5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other. A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English

More information

Solutions to the European Kangaroo Pink Paper

Solutions to the European Kangaroo Pink Paper Solutions to the European Kangaroo Pink Paper 1. The calculation can be approximated as follows: 17 0.3 20.16 999 17 3 2 1000 2. A y plotting the points, it is easy to check that E is a square. Since any

More information

Twenty-sixth Annual UNC Math Contest First Round Fall, 2017

Twenty-sixth Annual UNC Math Contest First Round Fall, 2017 Twenty-sixth Annual UNC Math Contest First Round Fall, 07 Rules: 90 minutes; no electronic devices. The positive integers are,,,,.... Find the largest integer n that satisfies both 6 < 5n and n < 99..

More information

Simple Counting Problems

Simple Counting Problems Appendix F Counting Principles F1 Appendix F Counting Principles What You Should Learn 1 Count the number of ways an event can occur. 2 Determine the number of ways two or three events can occur using

More information

MAT 409 Semester Exam: 80 points

MAT 409 Semester Exam: 80 points MAT 409 Semester Exam: 80 points Name Email Text # Impact on Course Grade: Approximately 25% Score Solve each problem based on the information provided. It is not necessary to complete every calculation.

More information

Permutations and Combinations Section

Permutations and Combinations Section A B I L E N E C H R I S T I A N U N I V E R S I T Y Department of Mathematics Permutations and Combinations Section 13.3-13.4 Dr. John Ehrke Department of Mathematics Fall 2012 Permutations A permutation

More information

Permutations & Combinations

Permutations & Combinations Permutations & Combinations Extension 1 Mathematics HSC Revision UOW PERMUTATIONS AND COMBINATIONS: REVIEW 1. A combination lock has 4 dials each with 10 digits. How many possible arrangements are there?

More information

commands Homework D1 Q.1.

commands Homework D1 Q.1. > commands > > Homework D1 Q.1. If you enter the lottery by choosing 4 different numbers from a set of 47 numbers, how many ways are there to choose your numbers? Answer: Use the C(n,r) formula. C(47,4)

More information

Final Exam, Math 6105

Final Exam, Math 6105 Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)

More information

Unit 5 Radical Functions & Combinatorics

Unit 5 Radical Functions & Combinatorics 1 Unit 5 Radical Functions & Combinatorics General Outcome: Develop algebraic and graphical reasoning through the study of relations. Develop algebraic and numeric reasoning that involves combinatorics.

More information

Discrete Mathematics. Spring 2017

Discrete Mathematics. Spring 2017 Discrete Mathematics Spring 2017 Previous Lecture Binomial Coefficients Pascal s Triangle The Pigeonhole Principle If a flock of 20 pigeons roosts in a set of 19 pigeonholes, one of the pigeonholes must

More information

Combinatorics. PIE and Binomial Coefficients. Misha Lavrov. ARML Practice 10/20/2013

Combinatorics. PIE and Binomial Coefficients. Misha Lavrov. ARML Practice 10/20/2013 Combinatorics PIE and Binomial Coefficients Misha Lavrov ARML Practice 10/20/2013 Warm-up Po-Shen Loh, 2013. If the letters of the word DOCUMENT are randomly rearranged, what is the probability that all

More information

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n

More information

CPCS 222 Discrete Structures I Counting

CPCS 222 Discrete Structures I Counting King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222 Discrete Structures I Counting Dr. Eng. Farag Elnagahy farahelnagahy@hotmail.com Office Phone: 67967 The Basics of counting

More information

Intermediate Mathematics League of Eastern Massachusetts

Intermediate Mathematics League of Eastern Massachusetts Meet #5 March 2009 Intermediate Mathematics League of Eastern Massachusetts Meet #5 March 2009 Category 1 Mystery 1. Sam told Mike to pick any number, then double it, then add 5 to the new value, then

More information

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices?

6. In how many different ways can you answer 10 multiple-choice questions if each question has five choices? Pre-Calculus Section 4.1 Multiplication, Addition, and Complement 1. Evaluate each of the following: a. 5! b. 6! c. 7! d. 0! 2. Evaluate each of the following: a. 10! b. 20! 9! 18! 3. In how many different

More information

Modular Arithmetic. Kieran Cooney - February 18, 2016

Modular Arithmetic. Kieran Cooney - February 18, 2016 Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.

More information

Distribution of Aces Among Dealt Hands

Distribution of Aces Among Dealt Hands Distribution of Aces Among Dealt Hands Brian Alspach 3 March 05 Abstract We provide details of the computations for the distribution of aces among nine and ten hold em hands. There are 4 aces and non-aces

More information

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7

CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7 CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a

More information

The Four Numbers Game

The Four Numbers Game University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2007 The Four Numbers Game Tina Thompson University

More information

Problem Set 8 Solutions R Y G R R G

Problem Set 8 Solutions R Y G R R G 6.04/18.06J Mathematics for Computer Science April 5, 005 Srini Devadas and Eric Lehman Problem Set 8 Solutions Due: Monday, April 11 at 9 PM in Room 3-044 Problem 1. An electronic toy displays a 4 4 grid

More information

Introduction to Counting and Probability

Introduction to Counting and Probability Randolph High School Math League 2013-2014 Page 1 If chance will have me king, why, chance may crown me. Shakespeare, Macbeth, Act I, Scene 3 1 Introduction Introduction to Counting and Probability Counting

More information

THE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin

THE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin THE PIGEONHOLE PRINCIPLE MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin The Pigeonhole Principle: If n + 1 objects are placed into n boxes, then some box contains

More information

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00 18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?

More information

BMT 2018 Combinatorics Test Solutions March 18, 2018

BMT 2018 Combinatorics Test Solutions March 18, 2018 . Bob has 3 different fountain pens and different ink colors. How many ways can he fill his fountain pens with ink if he can only put one ink in each pen? Answer: 0 Solution: He has options to fill his

More information

5.8 Problems (last update 30 May 2018)

5.8 Problems (last update 30 May 2018) 5.8 Problems (last update 30 May 2018) 1.The lineup or batting order for a baseball team is a list of the nine players on the team indicating the order in which they will bat during the game. a) How many

More information

About Permutations and Combinations: Examples

About Permutations and Combinations: Examples About Permutations and Combinations: Examples TABLE OF CONTENTS Basics... 1 Product Rule...1-2 Sum Rule...2 Permutations... 2-3 Combinations... 3-4 Pascal s Triangle... 4 Binomial Theorem.. 4 Pascal s

More information

Mathematics. Programming

Mathematics. Programming Mathematics for the Digital Age and Programming in Python >>> Second Edition: with Python 3 Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing

More information

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the

More information

Permutations and Combinations. Quantitative Aptitude & Business Statistics

Permutations and Combinations. Quantitative Aptitude & Business Statistics Permutations and Combinations Statistics The Fundamental Principle of If there are Multiplication n 1 ways of doing one operation, n 2 ways of doing a second operation, n 3 ways of doing a third operation,

More information

Jim and Nim. Japheth Wood New York Math Circle. August 6, 2011

Jim and Nim. Japheth Wood New York Math Circle. August 6, 2011 Jim and Nim Japheth Wood New York Math Circle August 6, 2011 Outline 1. Games Outline 1. Games 2. Nim Outline 1. Games 2. Nim 3. Strategies Outline 1. Games 2. Nim 3. Strategies 4. Jim Outline 1. Games

More information

Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C

More information

Math 166: Topics in Contemporary Mathematics II

Math 166: Topics in Contemporary Mathematics II Math 166: Topics in Contemporary Mathematics II Xin Ma Texas A&M University September 30, 2017 Xin Ma (TAMU) Math 166 September 30, 2017 1 / 11 Last Time Factorials For any natural number n, we define

More information

3 The multiplication rule/miscellaneous counting problems

3 The multiplication rule/miscellaneous counting problems Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1 Suppose P (A 0, P (B 05 (a If A and B are independent, what is P (A B? What is P (A B? (b If A and B are disjoint, what is

More information

Lecture 18 - Counting

Lecture 18 - Counting Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program

More information

Classwork Example 1: Exploring Subtraction with the Integer Game

Classwork Example 1: Exploring Subtraction with the Integer Game 7.2.5 Lesson Date Understanding Subtraction of Integers Student Objectives I can justify the rule for subtraction: Subtracting a number is the same as adding its opposite. I can relate the rule for subtraction

More information

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse

More information

Fundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.

Fundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:. 12.1 The Fundamental Counting Principle and Permutations Objectives 1. Use the fundamental counting principle to count the number of ways an event can happen. 2. Use the permutations to count the number

More information

6.4 Permutations and Combinations

6.4 Permutations and Combinations Math 141: Business Mathematics I Fall 2015 6.4 Permutations and Combinations Instructor: Yeong-Chyuan Chung Outline Factorial notation Permutations - arranging objects Combinations - selecting objects

More information

Permutation group and determinants. (Dated: September 19, 2018)

Permutation group and determinants. (Dated: September 19, 2018) Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter

More information

Combinatorics problems

Combinatorics problems Combinatorics problems Sections 6.1-6.4 Math 245, Spring 2011 1 How to solve it There are four main strategies for solving counting problems that we will look at: Multiplication principle: A man s wardrobe

More information

Math 365 Wednesday 2/20/19 Section 6.1: Basic counting

Math 365 Wednesday 2/20/19 Section 6.1: Basic counting Math 365 Wednesday 2/20/19 Section 6.1: Basic counting Exercise 19. For each of the following, use some combination of the sum and product rules to find your answer. Give an un-simplified numerical answer

More information

Math 454 Summer 2005 Due Wednesday 7/13/05 Homework #2. Counting problems:

Math 454 Summer 2005 Due Wednesday 7/13/05 Homework #2. Counting problems: Homewor #2 Counting problems: 1 How many permutations of {1, 2, 3,..., 12} are there that don t begin with 2? Solution: (100%) I thin the easiest way is by subtracting off the bad permutations: 12! = total

More information

An Elementary Solution to the Ménage Problem

An Elementary Solution to the Ménage Problem An Elementary Solution to the Ménage Problem Amanda F Passmore April 14, 2005 1 Introduction The ménage problem asks for the number of ways to seat n husbands and n wives at a circular table with alternating

More information

MA 524 Midterm Solutions October 16, 2018

MA 524 Midterm Solutions October 16, 2018 MA 524 Midterm Solutions October 16, 2018 1. (a) Let a n be the number of ordered tuples (a, b, c, d) of integers satisfying 0 a < b c < d n. Find a closed formula for a n, as well as its ordinary generating

More information

CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)

CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) CS1802 Discrete Structures Recitation Fall 2018 September 25-26, 2018 CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) Permutations and Combinations i. Evaluate the following expressions. 1. P(10, 4)

More information

Solutions for Exam I, Math 10120, Fall 2016

Solutions for Exam I, Math 10120, Fall 2016 Solutions for Exam I, Math 10120, Fall 2016 1. Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10} A = {1, 2, 3} B = {2, 4, 6, 8, 10}. C = {4, 5, 6, 7, 8}. Which of the following sets is equal to (A B) C? {1, 2, 3,

More information

Solutions to the 2004 CMO written March 31, 2004

Solutions to the 2004 CMO written March 31, 2004 Solutions to the 004 CMO written March 31, 004 1. Find all ordered triples (x, y, z) of real numbers which satisfy the following system of equations: xy = z x y xz = y x z yz = x y z Solution 1 Subtracting

More information

Review I. October 14, 2008

Review I. October 14, 2008 Review I October 14, 008 If you put n + 1 pigeons in n pigeonholes then at least one hole would have more than one pigeon. If n(r 1 + 1 objects are put into n boxes, then at least one of the boxes contains

More information

16 Alternating Groups

16 Alternating Groups 16 Alternating Groups In this paragraph, we examine an important subgroup of S n, called the alternating group on n letters. We begin with a definition that will play an important role throughout this

More information

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION

Unit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION Name: Period: Date: NON-CALCULATOR SECTION Vocabulary: Define each word and give an example. 1. discrete mathematics 2. dependent outcomes 3. series Short Answer: 4. Describe when to use a combination.

More information

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. More 9.-9.3 Practice Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Answer the question. ) In how many ways can you answer the questions on

More information