MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there?

Slides:



Advertisements
Similar presentations
1 Applications of Optimization to Logic Testing Gary Kaminski and Paul Ammann ICST 2010 CSTVA Workshop.
Advertisements

1 Press Ctrl-A ©G Dear2009 – Not to be sold/Free to use Tree Diagrams Stage 6 - Year 12 General Mathematic (HSC)
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
Counting Chapter 13 sec 1. Break up into groups One method of counting is using the tree diagram. ◦ It is useful to keep track of counting. ◦ Order of.
1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.
Introduction to Software Testing Chapter 8.2
Probability – Compound Events. What is a Compound Event? It is the probability of two or more things happening at once.
Homework 3.
1 Algorithms CSCI 235, Fall 2012 Lecture 9 Probability.
Warm-up  Would it be fair to give a report card grade based on 1 test? or 1 assignment?  Would it be accurate to conclude that a coin will always come.
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Holt CA Course Sample Spaces Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson PresentationPreview.
Chapter 3 Section 3.2 Basic Terms of Probability.
14/6/1435 lecture 10 Lecture 9. The probability distribution for the discrete variable Satify the following conditions P(x)>= 0 for all x.
Introduction to Counting Methods MATH 102 Contemporary Math S. Rook.
S.CP.A.1 Probability Basics. Probability - The chance of an event occurring Experiment: Outcome: Sample Space: Event: The process of measuring or observing.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Two way tables and tree diagrams
Money Counting By: Aleela Bovell 2 nd Grade Math LETS BEGIN!
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
Lecture 1 Sec
Name the United States Coins Count the Pennies 10 ¢
Holt CA Course Sample Spaces Warm Up Warm Up California Standards California Standards Lesson Presentation Lesson PresentationPreview.
Chapter 7 Logic, Sets, and Counting
Holt CA Course Sample Spaces Warm Up Warm Up California Standards Lesson Presentation Preview.
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
CS520: Steinberg 1 Lecture 16 CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg Lecture 16: Uncertainty.
Counting Theory (Permutation and combination)
Probability Distributions
Boolean Logic.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
The Outwood Grange Family of Schools Let Me Count The Ways (teacher notes): 1. Obviously an important skill in problem solving is to be able to count the.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
12.1/12.2 Probability Quick Vocab: Random experiment: “random” act, no way of knowing ahead of time Outcome: results of a random experiment Event: a.
Discrete Math Section 16.3 Use the Binomial Probability theorem to find the probability of a given outcome on repeated independent trials. Flip a coin.
Math 145 September 18, Terminologies in Probability  Experiment – Any process that produces an outcome that cannot be predicted with certainty.
9.3 Experimental Probability. 9.3 Ten students each have a penny. If student 1 tosses the penny, what is the probability that it will land on heads? If.
Binomial Probability Theorem In a rainy season, there is 60% chance that it will rain on a particular day. What is the probability that there will exactly.
6.20 I will describe and determine probability In an experiment where a pair of dice (one red, one green) is thrown and the number facing up on each die.
Pencil, highlighter, GP notebook, textbook, calculator Start working on IC – 1 from your textbook. Suppose that you were going to flip three coins: a penny,
Test #2 Practice MGF 1106 Summer 2011.
Introduction to Software Testing Chapter 8.2
Section 5.1 Day 2.
Terminologies in Probability
2.3 Probability and Odds Objective: Given a description an event, find the probability and/or the odds of the event happening (including replacement and.
first, we get a grasp of these darn coins!
Copyright © 2016, 2013, and 2010, Pearson Education, Inc.
Introduction to Software Testing Syntactic Logic Coverage Criteria
Math 145 September 25, 2006.
Counting Techniuqes.
Probability.
Chapter 9 Section 1 Probability Review.
Warm Up Which of the following are combinations?
Terminologies in Probability
Lesson 10.1 Sample Spaces and Probability
Name the United States Coins
Terminologies in Probability
Terminologies in Probability
Tree diagrams Tree diagrams are used to display the sample space for the experiment or game. The tree branches out once for every stage of the experiment.
Terminologies in Probability
©G Dear 2009 – Not to be sold/Free to use
Fun… Tree Diagrams… Probability.
Math 145 June 26, 2007.
Terminologies in Probability
Math 145 February 12, 2008.
Terminologies in Probability
Presentation transcript:

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there?

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime.

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime There are 8 different arrangements of Heads and Tails.

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime …beginning with the penny …then the nickel …finally, the dime There are 8 different arrangements of Heads and Tails. HHH HHT HTH HTT THH THT TTH TTT

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there? Suppose I flip 3 coins, a penny, a nickel and a dime The structure that we used to count the number of outcomes is called a TREE DIAGRAM. …beginning with the penny …then the nickel …finally, the dime There are 8 different arrangements of Heads and Tails. HHH HHT HTH HTT THH THT TTH TTT

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting FT There are 2 ways (T or F) to answer Question 1

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting FT If Q1 is answered T, Q2 can be answered either T or F. There are 2 ways (T or F) to answer Question 1

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TF FT If Q1 is answered T, Q2 can be answered either T or F There are 2 ways (T or F) to answer Question 1

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TF FT If Q1 is answered T, Q2 can be answered either T or F There are 2 ways (T or F) to answer Question 1

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TF FT There are 2 ways (T or F) to answer Question 1 If Q1 is answered F, Q2 can be answered either T or F If Q1 is answered T, Q2 can be answered either T or F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TF FT There are 2 ways (T or F) to answer Question 1 If Q1 is answered F, Q2 can be answered either T or F TF If Q1 is answered T, Q2 can be answered either T or F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT There are 2 ways (T or F) to answer Question 1 If Q1 is answered F, Q2 can be answered either T or F If Q1 is answered T, Q2 can be answered either T or F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Similarly, each possible answer to Q2 leads to 2 possible answers for Q3. Q3

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF And each possible answer to Q3 leads to 2 possible answers for Q4. Q4

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T

If you are taking a 4 question T/F quiz: MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. How many different ways are there to answer all 4 questions?

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF TF TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT

F If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TFTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT, FTFF F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT, FTFF, FFTT F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT, FTFF, FFTT, FFTF F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT, FTFF, FFTT, FFTF, FFFT F F

If you are taking a 4 question T/F quiz: How many different ways are there to answer all 4 questions? MATH 110 Sec 12-1 Lecture: Intro to Counting TTF FT Q1 Q2 Q3 TF T TF TF Q4 F T F T F T F T F T F T F T F T There are 16 different ways to answer all 4 questions. You can list all 16 ways by going down each of the 16 branches of the tree. { TTTT, TTTF, TTFT, TTFF, TFTT, TFTF, TFFT, TFFF, FTTT, FTTF, FTFT, FTFF, FFTT, FFTF, FFFT, FFFF} F F

MATH 110 Sec 12-1 Lecture: Intro to Counting

Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed. A BCDE

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed. A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE A BCDE 5 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE A BCDE 5 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE If B is the first letter chosen, any of the 5 could still be chosen second. A BCDE 5 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If B is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If B is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed A BCDE 5 ways …and because AB and BA are considered to be different.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If B is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed A BCDE 5 ways …and because AB and BA are considered to be different. A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE 5 ways Similarly, if C is the first letter chosen, any of the 5 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE 5 ways Similarly, if C is the first letter chosen, any of the 5 could still be chosen second. C A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE A BCDE 5 ways The same logic holds for D and E being selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE A BCDE 5 ways The same logic holds for D and E being selected first. A BCDE A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE A BCDE A BCDE A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE A BCDE A BCDE A BCDE A BCDE So, there are 25 ways that this can be done. 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting

Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the other 4 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A can’t be used again because repetition is not allowed. If A is the first letter chosen, any of the other 4 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE BCDE If A is the first letter chosen, any of the other 4 could still be chosen second. This is because repetition is not allowedA can’t be used again because repetition is not allowed.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE BCDE 4 ways If A is the first letter chosen, any of the other 4 could still be chosen second. A can’t be used again because repetition is not allowed.

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE BCDE 4 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE If B is the first letter chosen, any of the other 4 could still be chosen second. A BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE This is because repetition is not allowed BCDE 4 ways If B is the first letter chosen, any of the other 4 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE …and because AB and BA are considered to be different. BCDE 4 ways If B is the first letter chosen, any of the other 4 could still be chosen second. This is because repetition is not allowed

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE …and because AB and BA are considered to be different. ACDEBCDE 4 ways If B is the first letter chosen, any of the other 4 could still be chosen second. This is because repetition is not allowed

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE ACDEBCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE Similarly, if C is the first letter chosen, any of the other 4 could still be chosen second. ACDEBCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDEC ACDEBCDE 4 ways ABDE Similarly, if C is the first letter chosen, any of the other 4 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE ACDEBCDE 4 ways ABDE

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE The same logic holds for D and E being selected first. ACDEBCDE 4 ways ABDE

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE The same logic holds for D and E being selected first. ACDEBCDE 4 ways ABDE ABCE ABCD

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE ACDEBCDE 4 ways ABDE ABCE ABCD

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE So, there are 20 ways that this can be done. ACDEBCDE 4 ways ABDE ABCE ABCD

MATH 110 Sec 12-1 Lecture: Intro to Counting

Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE Any of the 5 letters could be selected first.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed. A BCDE

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE If A is the first letter chosen, any of the 5 could still be chosen second. This is because repetition is allowed. A BCDE 5 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE A BCDE 5 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting BCDE If B is the first letter chosen, any of the 4 remaining letters (any but A) could still be chosen second. A BCDE 5 ways A

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE This is because although repetition is allowed A BCDE 5 ways If B is the first letter chosen, any of the 4 remaining letters (any but A) could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE 5 ways …AB and BA are NOT considered to be different. This is because although repetition is allowed If B is the first letter chosen, any of the 4 remaining letters (any but A) could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE 5 ways BCDE This is because although repetition is allowed …AB and BA are NOT considered to be different. 4 ways If B is the first letter chosen, any of the 4 remaining letters (any but A) could still be chosen second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE Similarly, if C is the first letter chosen, any of the 3 remaining letters (any but A or B) could still be chosen. second. A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDEC CDE 3 ways A BCDE 5 ways BCDE 4 ways Similarly, if C is the first letter chosen, any of the 3 remaining letters (any but A or B) could still be chosen. second.

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE CDE 3 ways A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE The same logic holds for D and E being selected first. CDE 3 ways A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE The same logic holds for D and E being selected first. DEE 2 ways1 way CDE 3 ways A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting A BCDE DEE 2 ways1 way CDE 3 ways A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting So, there are 15 ways that this can be done. A BCDE DEE 2 ways1 way CDE 3 ways A BCDE 5 ways BCDE 4 ways

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible?

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible? Although a tree diagram will work, let's try something else.

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible? Although a tree diagram will work, let's try something else.

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible? Although a tree diagram will work, let's try something else.

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible? Although a tree diagram will work, let's try something else. There are 6 x 6 = 36 entries in this table.

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. How many different rolls are possible? Although a tree diagram will work, let's try something else. Each entry in this table represents a different roll so there are 36 different possible rolls. There are 6 x 6 = 36 entries in this table.

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. In how many ways can you roll a sum of 9?

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. In how many ways can you roll a sum of 9?

MATH 110 Sec 12-1 Lecture: Intro to Counting Suppose you roll 2 dice. The first is red & the second is green. In how many ways can you roll a sum of 9? So there are 4 ways to roll a sum of 9.