LAMC Junior Circle February 3, Oleg Gleizer. Warm-up

Similar documents
JIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers.

Section 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?

Week 1: Probability models and counting

Honors Precalculus Chapter 9 Summary Basic Combinatorics

The study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability

Lecture 1. Permutations and combinations, Pascal s triangle, learning to count

Statistics 1040 Summer 2009 Exam III

Finite Mathematics MAT 141: Chapter 8 Notes

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

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.

1. More on Binomial Distributions

Math 102 Practice for Test 3

Name: Unit 7 Study Guide 1. Use the spinner to name the color that fits each of the following statements.

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

Poker: Probabilities of the Various Hands

Geometric Distribution

LAMC Beginners Circle April 27, Oleg Gleizer. Warm-up

Combinatorial Proofs

LAMC Intermediate I & II December 14, Oleg Gleizer. Math Wrangle

November 6, Chapter 8: Probability: The Mathematics of Chance

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

Probability Distributions. Probability Distributions. J. Boulton. May 08, 2013 MDM 4U1. Where are we?

A Probability Work Sheet

CSE 312 Midterm Exam May 7, 2014

Counting Methods and Probability

Discrete Structures for Computer Science

Name: Class: Date: Probability/Counting Multiple Choice Pre-Test

Section The Multiplication Principle and Permutations

Poker: Probabilities of the Various Hands

Name: Exam 1. September 14, 2017

7.1 Chance Surprises, 7.2 Predicting the Future in an Uncertain World, 7.4 Down for the Count

Poker: Further Issues in Probability. Poker I 1/29

Math 447 Test 1 February 25, Spring 2016

1. How many subsets are there for the set of cards in a standard playing card deck? How many subsets are there of size 8?

23 Applications of Probability to Combinatorics

= = 0.1%. On the other hand, if there are three winning tickets, then the probability of winning one of these winning tickets must be 3 (1)

In how many ways can a team of three snow sculptors be chosen to represent Amir s school from the nine students who have volunteered?

4.1 What is Probability?

Discrete Structures Lecture Permutations and Combinations

2. How many bit strings of length 10 begin with 1101? a b. 2 6 c. 2 4 d. None of the above.

Grade 7/8 Math Circles February 25/26, Probability

Algebra II- Chapter 12- Test Review

November 11, Chapter 8: Probability: The Mathematics of Chance

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

Introductory Probability

18.S34 (FALL, 2007) PROBLEMS ON PROBABILITY

1. Counting. 2. Tree 3. Rules of Counting 4. Sample with/without replacement where order does/doesn t matter.

INDIAN STATISTICAL INSTITUTE

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Heads Up! A c t i v i t y 5. The Problem. Name Date

Probability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37

6) A) both; happy B) neither; not happy C) one; happy D) one; not happy

POKER (AN INTRODUCTION TO COUNTING)

Intermediate Math Circles November 1, 2017 Probability I

Lecture 14. What s to come? Probability. A bag contains:

Unit 6: Probability. Marius Ionescu 10/06/2011. Marius Ionescu () Unit 6: Probability 10/06/ / 22

Chapter 1. Probability

MAT 155. Key Concept. Notation. Fundamental Counting. February 09, S4.7_3 Counting. Chapter 4 Probability

Probability Warm-Up 2

CRACKING THE 15 PUZZLE - PART 1: PERMUTATIONS

Probability Quiz Review Sections

4.3 Rules of Probability

WEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)

Unit 5 Radical Functions & Combinatorics

CIS 2033 Lecture 6, Spring 2017

Unit 6: Probability. Marius Ionescu 10/06/2011. Marius Ionescu () Unit 6: Probability 10/06/ / 22

Probability. March 06, J. Boulton MDM 4U1. P(A) = n(a) n(s) Introductory Probability

4.1 Sample Spaces and Events

Probability. The MEnTe Program Math Enrichment through Technology. Title V East Los Angeles College

Math 12 - Unit 4 Review

CSE 21 Practice Final Exam Winter 2016

Probability of Independent and Dependent Events

CISC 1400 Discrete Structures

The game of poker. Gambling and probability. Poker probability: royal flush. Poker probability: four of a kind

= (2 3 ) = c LAMC Beginners Circle September 29, Oleg Gleizer. Warm-up

CSC/MTH 231 Discrete Structures II Spring, Homework 5

SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question.

Dependence. Math Circle. October 15, 2016

Math 1313 Section 6.2 Definition of Probability

The probability set-up

Combinatorics and Intuitive Probability

Compound Probability. Set Theory. Basic Definitions

Chapter 1. Probability

Week in Review #5 ( , 3.1)

13.3 Permutations and Combinations

MATH 2420 Discrete Mathematics Lecture notes

Math 3012 Applied Combinatorics Lecture 2

Mathematical Foundations HW 5 By 11:59pm, 12 Dec, 2015

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

LC OL Probability. ARNMaths.weebly.com. As part of Leaving Certificate Ordinary Level Math you should be able to complete the following.

LAMC Junior Circle January 22, Oleg Gleizer. The Hanoi Tower. Part 2

MAT 17: Introduction to Mathematics Final Exam Review Packet. B. Use the following definitions to write the indicated set for each exercise below:

Combinatorics: The Fine Art of Counting

[Independent Probability, Conditional Probability, Tree Diagrams]

Discrete probability and the laws of chance

FALL 2012 MATH 1324 REVIEW EXAM 4

Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations

More Probability: Poker Hands and some issues in Counting

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

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Transcription:

LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator and one hundred to the denominator? 1

Problem 3 Cut the board below into four equal parts so that each part contains one of the four digits. 4 3 2 1 Problem 4 A student has read 138 pages which is 23% of the book she is reading. How many pages are there in the book? 2

Recall that the numbers N {1, 2, 3,...} are called natural. A natural number greater than one is called prime if it is divisible only by itself and by one. For example, 3 is a prime number. A natural number that is not prime is called composite. For example, 6 is a composite number as 6 2 3. You may find the following facts useful for the problem that follows. 203 7 29, 209 11 19, 211 is prime Problem 5 Mary plays the following game. Starting with 1, she adds a natural number to the list if it can be obtained by increasing any of the numbers already in the list by any % from 1 through 100. For example, Mary adds 2 to the list because 2 is the 100% increase of 1. Mary adds 3 to the list as a 50% increase of 2. Mary adds 4 to the list as a 100% increase of 2. Mary adds 5 to the list as a 25% increase of 4, and so on. 1 100% 2 2 50% 3 2 100% 4 3

4 25% 5 3 100% 6 4 75% 7... What is the smallest natural number that will not appear in Mary s list? 4

Problem 6 There are 11 people in a soccer team. How many ways are there to elect a captain and his second? Problem 7 How many ways are there to put two rooks on a chess board so that they cannot take each other... a.... if the rooks are of different colors? b.... if the rooks are of the same color? 5

Some basic enumerative combinatorics Problem 8 How many ways are there to put three marbles of different colors in a row? Definition 1 The product of all the natural numbers from 1 through n is called n factorial. n! 1 2 3... n For example, 3! 6. It is a useful convention to set 0! 1. Problem 9 Compute the following numbers. a. 5! b. 6! Problem 10 How many ways are there to put n + 1 marbles of different colors in a row? Problem 11 Compute the following numbers. a. 5! 4! b. 100! 98! 6

Problem 12 There are 10 marbles of different colors in a box. How many ways are there to put 6 of them in a row? Write down the answer using the n! notation. Problem 13 Let k and n be natural numbers such that k n. There are n marbles of different colors in a box. How many ways are there to put k of them in a row? Definition 2 A way to choose k objects out of n so that the order of the chosen objects matters is called a permutation. As proven in Problem 13, the number of permutations is given by the following formula. P (n, k) n! (n k)! Definition 3 A way to choose k objects out of n so that the order of the chosen objects does not matter is called a combination. 7 (1)

Example 1 A poker hand is any combination of 5 cards out of the deck of 52. Let us compute the number of the possible poker hands. First, there are P (52, 5) 52! (52 5)! 48 49 50 51 311, 875, 200 ways to put 5 cards out of 52 in a row. However, the order of the cards in a hand does not matter. There are 5! ways to order 5 cards. (Why?) Dividing the above number by 5! gives us the number of the possible poker hands. C(52, 5) P (52, 5) 5! 52! (52 5)! 5! 2, 598, 960 A more modern, but less convenient, notation for the number of combinations is given on the left-hand side of the following formula. ( ) n n! C(n, k) (2) k (n k)! k! The above reads as n choose k. For the reason that will become clear in Problem 23, the formula is also known as a binomial coefficient. Problem 14 Compute the following numbers. a. ( ) 5 0 8

b. ( ) 5 1 c. d. ( ) 10 3 ( ) 10 7 Problem 15 Prove the following property of the binomial coefficients. ( ) ( ) n n (3) k n k 9

Problem 16 Prove the following formulae. ( ) ( ) ( ) 4 4 5 a. + 2 3 3 b. ( ) 5 + 3 ( ) 5 4 ( ) 6 4 Problem 17 Prove that the following formula holds for any n N and for any k 0, 1, 2,..., n. ( ) ( ) ( ) n n 1 n 1 + (4) k k 1 k 10

Formula 4 explains why it is possible to arrange the binomial coefficients in the following table known as Pascal s triangle. n 0: 1 n 1: 1 1 n 2: 1 2 1 n 3: 1 3 3 1 n 4: 1 4 6 4 1 n 5: 1 5 10 10 5 1 n 6: n 7: Problem 18 In the table above, fill in the entries of the Pascal s triangle for n 6 and 7. The upper-case Greek letter Σ (Sigma) is used in math as a notation for a sum. For example, n a k x k a 0 + a 1 x + a 2 x 2 +... + a n x n. k0 Problem 19 Expand the following formula. 3 k0 ( ) 3 x 3 k y k k 11

Problem 20 Expand and simplify the following. (x + y) 3 Compare your result to that in Problem 19. Problem 21 Expand the following formula. 4 k0 ( ) 4 x 4 k y k k Problem 22 Use the answer to Problem 20 to expand and simplify the following. (x + y) 4 Compare your result to that in Problem 21. 12

Problem 23 Prove the following statement known as the binomial formula. n ( ) n (x + y) n x n k y k k k0 (5) x n + nx n 1 y + ( ) n 2 x n 2 y 2 + ( ) n 3 x n 3 y 3 +... + y n Note that the corresponding line of the Pascal s triangle gives you all the binomial coefficients for the binomial of power n. Problem 24 Use the binomial formula to expand the following polynomial. (x + 1) 5 13

Problem 25 Use the Pascal triangle to find the sum of all the binomial coefficients for the following n. n 0 : n 1 : n 2 : n 3 : n 4 : n 5 : Can you guess the general pattern? Problem 26 Prove the following formula. n ( ) n 2 n (6) k k0 14

Back to probability Problem 27 We toss a coin 4 times. How many ways are there to get the following outcomes? 0 heads: 1 head: 2 heads: 3 heads: 4 heads: Compare the above numbers to the Pascal s triangle line for n 4. Can you explain what you see? 15

Suppose that the coin you toss is not necessarily fair. every toss, the chance to get a head is p. At Problem 28 What is the chance to get a tail? Problem 29 You toss the above coin 7 times. chance that you get 3 heads? What is the Problem 30 You toss the above coin 7 times. chance that you get no more than 3 heads? What is the Problem 31 Assume that the coin in Problem 30 was a fair one. What is the probability that you get no more than 3 heads? 16

Problem 32 You toss a fair coin 12 times. What is the chance that you get 5 tails? Problem 33 To win a jackpot in the Mega Millions lottery, you have to guess right 5 numbers from a pool of numbers from 1 to 56 and an additional Mega Ball number from a second pool of numbers from 1 to 46. What is a chance to hit the jackpot, if you purchase one lottery ticket? Problem 34 The price of one lottery ticket for the Mega Millions lottery is $1. How much money do you need to invest to have a 0.5 chance of winning the jackpot? 17