Solution: There are 30 choices for the first person to leave, 29 for the second, etc. Thus this exodus can occur in. = P (30, 8) ways.

Similar documents
Chapter 8 Sequences, Series, and Probability

Combinatorial Analysis

Probability, For the Enthusiastic Beginner (Exercises, Version 1, September 2016) David Morin,

1 The Basic Counting Principles

First Digit Tally Marks Final Count

Year 10 Mathematics Probability Practice Test 1

Senior Math Circles November 19, 2008 Probability II

DRAFT. M118 Exam Jam Concise. Contents. Chapter 2: Set Theory 2. Chapter 3: Combinatorics 3. Chapter 4: Probability 4. Chapter 5: Statistics 6

M118 Exam Jam. Contents. Chapter 2: Set Theory 2. Chapter 3: Combinatorics 5. Chapter 4: Probability 7. Chapter 5: Statistics 12

Probabilistic models

Chapter 2: Set Theory 2. Chapter 3: Combinatorics 3. Chapter 4: Probability 4. Chapter 5: Statistics 5

Algebra Terminology Part 1

Counting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

Probabilistic models

Module 8 Probability

Notes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006

10.1. Randomness and Probability. Investigation: Flip a Coin EXAMPLE A CONDENSED LESSON

With Question/Answer Animations. Chapter 7

Counting Review R 1. R 3 receiver. sender R 4 R 2

CSC Discrete Math I, Spring Discrete Probability

Chapter 2 PROBABILITY SAMPLE SPACE

Lesson One Hundred and Sixty-One Normal Distribution for some Resolution

Counting. Math 301. November 24, Dr. Nahid Sultana

What is the probability of getting a heads when flipping a coin

Updated Jan SESSION 4 Permutations Combinations Polynomials

MATH PRIZE FOR GIRLS. Test Version A

Monty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch

Chapter 5 : Probability. Exercise Sheet. SHilal. 1 P a g e

Chapter Summary. 7.1 Discrete Probability 7.2 Probability Theory 7.3 Bayes Theorem 7.4 Expected value and Variance

Lecture 3: Probability

REVIEW Chapter 1 The Real Number System

{ 0! = 1 n! = n(n 1)!, n 1. n! =

Math & Literacy Centers

Introduction to Probability, Fall 2013

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics, Spring 2004 Homework 4 Sample Solutions

Intermediate Math Circles November 8, 2017 Probability II

Discrete Structures for Computer Science

Topic 5: Probability. 5.4 Combined Events and Conditional Probability Paper 1

MATHEMATICS. 61. If letters of the word KUBER are written in all possible orders and arranged as in a dictionary, then rank of the word KUBER will be:

Number Bases: Dr Olga Maleva

12.1. Randomness and Probability

Math Review. for the Quantitative Reasoning measure of the GRE General Test

4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space

Lecture 4: Counting, Pigeonhole Principle, Permutations, Combinations Lecturer: Lale Özkahya

Homework every week. Keep up to date or you risk falling behind. Quizzes and Final exam are based on homework questions.

Computations - Show all your work. (30 pts)

students all of the same gender. (Total 6 marks)

Discrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each:

MATH STUDENT BOOK. 12th Grade Unit 9

1 Combinatorial Analysis

Math Fall Final Exam. Friday, 14 December Show all work for full credit. The problems are worth 6 points each.

Ciphering MU ALPHA THETA STATE 2008 ROUND

Instructions. Do not open your test until instructed to do so!

Permutations and Combinations

Mathathon Round 1 (2 points each)

Name: Teacher: DO NOT OPEN THE EXAMINATION PAPER UNTIL YOU ARE TOLD BY THE SUPERVISOR TO BEGIN. Mathematics 3201 PRE-PUBLIC EXAMINATION JUNE 2014

Introduction to Decision Sciences Lecture 11

Instructions. Do not open your test until instructed to do so!

1 Adda247 No. 1 APP for Banking & SSC Preparation Website: bankersadda.com sscadda.com store.adda247.com

The Advantage Testing Foundation Solutions

Permutation. Permutation. Permutation. Permutation. Permutation

Discrete Probability

Each trial has only two possible outcomes success and failure. The possible outcomes are exactly the same for each trial.

Data Handling TEXTBOOK QUESTIONS SOLVED. Learn and Remember. Exercise 3.1 (Page No )

Binomial Probability. Permutations and Combinations. Review. History Note. Discuss Quizzes/Answer Questions. 9.0 Lesson Plan

S.CP.A.2: Probability of Compound Events 1a

1 Preliminaries Sample Space and Events Interpretation of Probability... 13


1. Consider a random independent sample of size 712 from a distribution with the following pdf. c 1+x. f(x) =

9. DISCRETE PROBABILITY DISTRIBUTIONS

Probability Theory. 1 Review Questions in Combinatorics. Exercises

GRE. Advanced GRE Math Questions

BmMT 2016 Team Test Solutions November 13, 2016

Combinatorics. But there are some standard techniques. That s what we ll be studying.

Discrete Probability

Probability. Part 1 - Basic Counting Principles. 1. References. (1) R. Durrett, The Essentials of Probability, Duxbury.

Introduction to Negative Numbers and Computing with Signed Numbers

Name: Teacher: DO NOT OPEN THE EXAMINATION PAPER UNTIL YOU ARE TOLD BY THE SUPERVISOR TO BEGIN. Mathematics 3201 PRE-PUBLIC EXAMINATION JUNE 2014

Introduction to Probability, Fall 2009

Math & Literacy Centers

The Alberta High School Mathematics Competition Solution to Part I, November 2015.

CHAPTER 8: Polar 1. Convert to polar.

CISC-102 Fall 2017 Week 1 David Rappaport Goodwin G-532 Office Hours: Tuesday 1:30-3:30

SERIES

Math , Fall 2012: HW 5 Solutions

Math 30 1: Chapter 11 Review Holy Cross Collegiate. Mrs. Connor

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

Conditional Probability

Notes for Math 324, Part 17

Math.3336: Discrete Mathematics. Combinatorics: Basics of Counting

Logic. Facts (with proofs) CHAPTER 1. Definitions

Discrete Mathematics (CS503)

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

Some Basic Concepts of Probability and Information Theory: Pt. 1

Equations and Inequalities

Name: Harry Potter (pothar31) Discrete Math HW#6 Solutions March 9, Added: Chapter 6 Summary/Review: 17(a), 8, 15, 29, 42 and Q1 and Q2 below

MATHEMATICS IN EVERYDAY LIFE 8

Binomial Coefficient Identities/Complements

An Introduction to Combinatorics

Transcription:

Math-2320 Assignment 7 Solutions Problem 1: (Section 7.1 Exercise 4) There are 30 people in a class learning about permutations. One after another, eight people gradually slip out the back door. In how many ways can this exodus occur? There are 30 choices for the first person to leave, 29 for the second, etc. Thus this exodus can occur in 30 29 28 23 = 30! 22! Problem 2: (Section 7.1 Exercise 7) = P (30, 8) ways. (a.) In how many ways can ten boys and four girls sit in a row? (b.) In how many ways can they sit in a row if the boys are to sit together and the girls are to sit together? (c.) In how many ways can they sit in a row if the girls are to sit together? (d.) In how many ways can they sit in a row if just the girls are to sit together? (a.) 14!, which is the permutation of 14 people. (b.) 10! 4! 2 (c.) 4! 11! (treat the girls as one unit and count their possible permutations) (d.) 4! 11! 10! 4! 2 = 9 4! 10! (just girls sit together is the answer in (c.) minus the answer in (b.)). Problem 3: (Section 7.1 Exercise 17) (a.) In how many numbers with seven distinct digits do only the digits 1 9 appear? (b.) How many of the numbers in (a.) contain a 3 and a 6? (c.) In how many of the numbers in (a.) do 3 and 6 occur consecutivelt(in either order)? (d.) How many of the numbers in (a.) contain neither a 3 nor a 6? (e.) How many of the numbers in (a.) contain a 3 but not a 6? (f.) In how many of the numbers in (a.) do exactly one of the numbers 3, 6 appear? (g.) In how many of the numbers in (a.) do neither of the consecutive pairs 36 and 63 appear? (a.) P (9, 7) which is 9! 2! = 9 8 7 3 = 181, 440 (b.) There are seven positions for 3, six positions for 6 and five positions for the remaining seven digits. Therefore, there are 7 6 P (7, 5) = 105, 840 numbers which contain a 3

and a 6 in the numbers in (a.). (c.) Treat 36 as a block. There are 6 positions for 36 and five positions for the remaining seven digits. Then all these for 63, which are 6 P (7, 5) 2 = 30240. (d.) P (7, 7) = 5040 (seven digits to be placed in seven positions.) (e.) There are 7 positions for 3 and 6 positions for remaining 7 digits. Which gives, 7 P (7, 5) = 35, 280 (f.) Answer in (e.) times 2, which gives 70560. (g.) Answer in (a.) minus answer in (c.), which is 181, 440 30, 240 = 151, 200. Problem 4: (Section 7.2 Exercise 2) In how many ways can 12 players be divided into two teams of six for a game of street hockey? C(12, 6) = 924 Problem 5: (Section 7.2 Exercise 7) In a popular lottery known as Lotto 6/49, a player marks a card with six different numbers from the integers 1 49 and wins if his or her numbers match six randomly selected such numbers. (a.) In how many ways can a player complete a game card? (b.) How many cards should you complete in order to have at least one chance in a million of winning? (c.) In how many ways complete a game card so that no number matches any of the six selected? (d.) In how many ways can a player complete a game card so that at least one number matches one of the six selected? (a.) C(49, 6) = 13, 983, 816 (b.) n = 1. Therefore, n = 13.9 = 14 13,983,816 1,000,000 (c.) C(49 6, 6) = C(43, 6) = 6, 096, 454 (d.) Answer in (a.) minus the answer in (c.), which gives = 13, 983, 816 6, 096, 454 = 7, 887, 362 Problem 6: (Section 7.2 Exercise 16) The Head of the Department of Mathematical Scieneces at a certain university has 12 mathematicians, seven computer scientists, and three

statisticians in his employ. He wishes to appoint some committees from among these 22 people. (a.) How many five-member committees can he appoint? (b.) How many five-member committees, each containing at least one statistician, can he appoint? (c.) A certain professor of mathematics, Dr.G, and a certain colleague, Dr.P, refuse to serve together on the same committee. How many five-member committees can be formed so as not to contain both Dr.G and Dr.P? (d.) How many five-member committees can be formed so that the number of mathematicians is greater than the number of computer scientists and the number of computer scientists is greater than the number of statisticians? (a.) C(22, 5) = 26, 334 (b.) The number of committees with no statisticians is C(22 3, 5) = C(19, 5). Therefore, at least one statisician is in C(22, 5) C(19, 5) = 14, 706 (c.) C(22, 5) C(20, 3) = 25, 194. Which is the total number of committees minus number of committees in which both Dr.G and Dr.P are participants. (d.) The total members is 5 thus it must be 3 mathematicians, 2 computer science, no statisticians. OR 4 mathematicians, 1 computer science and no statisticians. C(12, 3) C(7, 2)+C(12, 4) C(7, 1) = 8085 Problem 7: (Section 7.3 Exercise 15(b),(d)) Find the number of arrangements of the letters of each of the following words: (b.) SASKATOON (d.) CINCINNATI 9! (b.) = 45, 360 (Letters S, A, O are presented twice). 2! 2! 2! (d.) 10! 2! 3! 3! = 50, 400 (Letter C appears twice, I, N appears 3 times) Problem 8: (Section 7.3 Exercise 18) (a.) Show that there is a one-to-one correspondence between the number of ways to put ten identical marbles into three boxes and the number of ordered triples (x, y, z) of nonnegative integers which satisfy x + y + z = 10

(b.) How many triples (x, y, z) of nonnegative integers satisfy x + y + z = 10? (c.) How many 5-tuples (x, y, z, u, v) of nonnegative integers satisfy x+y +z +u+v = 19? (a.) x is the number of marbles in box 1 y is the number of marbles in box 2 z is the number of marbles in box 3 Then x + y + z = 10, x 0, y 0, z 0 each such triple represents a way to put 10 marbles in 3 boxes. (b.) There are C(10+2, 2) = 66 triples of nonnegative integers which satisfy x+y+z = 10. (c.) There are C(19 + 4, 4) = 8855 ways to put 19 identical marbles into 5 boxes. Problem 9: (Section 7.5 Exercise 3(c)) For each of the following, expand using the Binomial Theorem and simplify. (c.) (2x 3 1 y 2 ) 8 Using the Binomial Theorem you obtain the following: (2x 3 1 x 2 )8 = C(8, 0) (2x 3 ) 8 + +C(8, 1)(2x 3 ) 7 ( 1 x ) + C(8, 2 2)(2x3 ) 6 ( 1 2) + C(8, 3)(2x 3 ) 5 ( 1 x 2 x 2 )3 + C(8, 4)(2x 3 ) 4 ( 1 x 2 )4 + +C(8, 3)(2x 3 ) 3 ( 1 x 2 )5 + C(8, 2)(2x 3 ) 2 ( 1 x 2 )6 + C(8, 1)(2x 3 )( 1 x 2 )7 + C(8, 8)( 1 x 2 )8 = = 256x 24 1024x 19 + 1729x 14 1792x 9 + 1120x 4 448 x + 112 x 6 16 x 11 + 1 x 16 Problem 10: (Section 7.5 Exercise 5) Consider the binomial expansion of (x + y) 20. (a.) What are the first three terms? (b.) What are the last three terms? (c.) What is the seventh term? The fifteenth term? (d.) What is the coefficient of x 1 3y 7?

(a.) The first 3 terms are: x 20, 20x 19 y, 190x 18 y 2. (b.) The last 3 terms are: 190x 2 y 18, 20xy 19, y 20. (c.) The seventh term is: C(20, 6)x 14 y 6. The fifteenth term is: C(20, 14)x 6 y 14. (d.) C(20, 7) = C(20, 13) = 77, 520 Problem 11: (Section 7.5 Exercise 12) Find the coefficient of x 25 in the binomial expansion of (2x 3 x 2 ) 58 General term of the expansion is C(58, k) (2x) 58 k ( 3 x 2 )k = C(58, k) 2 58 k ( 3) k x 58 k 2k Therefore, we set 58 3k = 25, so k = 11. So the coefficient is C(58, 11) (2) 47 ( 3) 11. Problem 12: (Section 5.3 Exercise 2) Solve the recurrence relation a n = 6a n 1 +7a n 2, n 2, given a 0 = 32, a 1 = 17. The characteristic equation is x 2 + 6x 7. Therefore roots are: x 1 = 7 and x 2 = 1 a n = C 1 ( 7) n + C 2 (1 n ) a 0 = C 1 + C 2 = 32 a 1 = C 1 ( 7) + C 2 = 17 Therefore, C 1 = 49 8, C 2 = 207 8 and a n = 49 8 ( 7)n + 207 8 (1)n Problem 13: (Section 5.3 Exercise 4) Solve the recurrence relation a n+1 = 7a n 10a n 1, n 2, given a 1 = 10, a 2 = 29. The characteristic equation is x 2 7x + 10. Therefore roots are: x 1 = 2 and x 2 = 5 a n = C 1 (2) n + C 2 (5) n a 1 = C 1 2 + C 2 5 = 10 a 2 = C 1 4 + C 2 25 = 29

Therefore, C 1 = 7 2, C 2 = 3 5 and a n = 7 2 n 1 + 3 5 n 1 Problem 14: (Section 5.3 Exercise 8) Solve the recurrence relation a n = 2a n 1 a n 2, n 2, given a 0 = 40, a 1 = 37. The characteristic equation is x 2 2x + 1. Therefore roots are: x = 1 (double root) a n = C 1 (1) n + n C 2 (1) n a 0 = C 1 = 40 Therefore, a n = 40 3n. a 1 = C 1 + C 2 = 37