Bell Work. List all the possible ways three different people can be standing in order.
|
|
- Marsha Wells
- 5 years ago
- Views:
Transcription
1 Bell Work List all the possible ways three different people can be standing in order. **If you still need to turn in your conic sections project, now would be a good time to do that.
2 Introduction List all the ways four different runners can finish a race.
3 Discrete vs. Continuous A point has no length/width but an interval of points does have length. Chapter 9 is a collection of topics included under the branch of mathematics called Discrete Mathematics.
4 9.1 Basic Combinatorics Scientific studies will usually manipulate one or more explanatory variables and observe the effect on one or more response variables. The key to understanding the significance of the effect is to know what is likely to occur by chance alone. Doing this can depend on counting.
5 The Multiplication Principle of Counting If a procedure P has a sequence of stages S 1,S 2, S n and if S 1 can occur in r 1 ways, S 2 can occur in r 2 ways, S n can occur in r n ways, Then the number of ways that procedure P can occur is the product r 1 r 2 r n.
6 Example You have 3 pairs of khaki pants and 5 polos. How many different outfit options do you have?
7 Example Say a license plate consists of three letters of the alphabet followed by three numerical digits (0-9). Find the number of different license plates that could be formed (a) If there is no restriction on the letters or digits that can be used (b) If no letter or digit can be repeated
8 Permutations One important application of the Multiplication Principle of Counting is to count the number of ways that a set of n objects (called an n-set) can be arranged in order. Each such ordering is called a permutation of the set.
9 Permutations If you have n objects There are n options for the first position There are n-1 options for the second position There are n-2 options for the third position The number of ways they can be ordered is n(n 1)(n 2) (2)(1).
10 Permutations There are n! permutations of an n-set.
11 Example Count the number of different 9-letter words that can be formed using the letters in each word. (a) DRAGONFLY
12 Example (b) BUTTERFLY (c) BUMBLEBEE
13 Distinguishable Permutations There are n! distinguishable permutations of a n-set containing n distinguishable objects. If an n-set contains n 1 objects of a first kind, n 2 objects of a second kind, and so on, with n 1 + n n k = n, then the number of distinguishable permutations of the n-set is n! n 1! n 2! n 3! n k!
14 Permutations of n objects taken r at a time Using n objects to fill r blanks in order. First blank has n options Second blank has (n 1) options Third blank has (n 2) options rth blank has n (r 1) options Ex. Count the number of ways 8 runners can finish 1 st, 2 nd, and 3 rd place.
15 Permutations of n objects taken r at a time By the multiplication principle the number of orders is n(n 1)(n 2) (n r + 1) This can be written as n! n r!
16 Permutation Counting Principle The number of permutations of n objects taken r at a time is denoted n P r and is given by np r = n! n r! for 0 r n. If r > n, then n P r = 0.
17 Example Evaluate without a calculator. Then confirm (a) and (b) with a calculator. (a) 6 P 4 (b) 11 P 3 (c) n P 3
18 Example Ten actors try out for roles as the two Von Trapp boys in the Sound of Music. Twenty actresses try out for roles as the five Von Trapp girls. In how many different ways can the director cast the seven roles?
Bell Work. Get out the two copies of your desmos picture, the one copy of your equations, and the construction paper you brought.
Bell Work Get out the two copies of your desmos picture, the one copy of your equations, and the construction paper you brought. Introduction 1. List all the ways three different people can be standing
More informationElementary Combinatorics
184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are
More informationPermutations and Combinations
Smart Notes.notebook Discrete Math is concerned with counting. Ted TV:How many ways can you arrange a deck of cards? Yannay Khaikin http://ed.ted.com/lessons/how many ways can you arrange a deck of cardsyannay
More informationHonors Precalculus Chapter 9 Summary Basic Combinatorics
Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each
More informationConcepts. Materials. Objective
. Activity 14 Let Us Count the Ways! Concepts Apply the multiplication counting principle Find the number of permutations in a data set Find the number of combinations in a data set Calculator Skills Factorial:
More informationChapter 4: Introduction to Probability
MTH 243 Chapter 4: Introduction to Probability Suppose that we found that one of our pieces of data was unusual. For example suppose our pack of M&M s only had 30 and that was 3.1 standard deviations below
More informationSTAT 430/510 Probability
STAT 430/510 Probability Hui Nie Lecture 1 May 26th, 2009 Introduction Probability is the study of randomness and uncertainty. In the early days, probability was associated with games of chance, such as
More informationCombinatorics 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 informationSTAT 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 informationIndependent Events. If we were to flip a coin, each time we flip that coin the chance of it landing on heads or tails will always remain the same.
Independent Events Independent events are events that you can do repeated trials and each trial doesn t have an effect on the outcome of the next trial. If we were to flip a coin, each time we flip that
More informationCPCS 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 informationMATH 2420 Discrete Mathematics Lecture notes
MATH 2420 Discrete Mathematics Lecture notes Series and Sequences Objectives: Introduction. Find the explicit formula for a sequence. 2. Be able to do calculations involving factorial, summation and product
More informationCONTENTS CONTENTS PAGES 11.0 CONCEPT MAP A. PERMUTATIONS a EXERCISE A B. COMBINATIONS a EXERCISE B PAST YEAR SPM
PROGRAM DIDIK CEMERLANG AKADEMIK SPM ADDITIONAL MATHEMATICS FORM 5 MODULE 11 PERMUTATIONS AND COMBINATIONS 0 CONTENTS CONTENTS PAGES 11.0 CONCEPT MAP 2 11.1 A. PERMUTATIONS 3 11.1a EXERCISE A.1 3 11.2
More informationDiscrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting
Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles
More informationSt at ist ic s Lec t ure 5
St at ist ic s 270 - Lec t ure 5 Last class: measures of spread and box-plots Last Day - Began Chapter 2 on probability. Section 2.1 These Notes more Chapter 2 Section 2.2 and 2.3 Assignment 2: 2.8, 2.12,
More informationSec 5.1 The Basics of Counting
1 Sec 5.1 The Basics of Counting Combinatorics, the study of arrangements of objects, is an important part of discrete mathematics. In this chapter, we will learn basic techniques of counting which has
More informationPermutations & 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 informationPermutations and Combinations Problems
Permutations and Combinations Problems Permutations and combinations are used to solve problems. Factorial Example 1: How many 3 digit numbers can you make using the digits 1, 2 and 3 without method (1)
More informationPermutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014
Permutations and Combinations MATH 107: Finite Mathematics University of Louisville March 3, 2014 Multiplicative review Non-replacement counting questions 2 / 15 Building strings without repetition A familiar
More informationChapter 2 Math
Chapter 2 Math 3201 1 Chapter 2: Counting Methods: Solving problems that involve the Fundamental Counting Principle Understanding and simplifying expressions involving factorial notation Solving problems
More informationJessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3. Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II
Jessica Fauser EDUC 352 October 21, 2011 Unit Lesson Plan #3 Lesson: Permutations and Combinations Length: 45 minutes Age/Grade Intended: Algebra II Academic Standard(s): A2.8.4 Use permutations, combinations,
More informationPermutations and Combinations Practice Test
Name: Class: Date: Permutations and Combinations Practice Test Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Suppose that license plates in the fictional
More informationPermutations and Combinations
Permutations and Combinations Reporting Category Topic Primary SOL Statistics Counting using permutations and combinations AII.12 The student will compute and distinguish between permutations and combinations
More informationPermutations 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 informationCS 237: Probability in Computing
CS 237: Probability in Computing Wayne Snyder Computer Science Department Boston University Lecture 5: o Independence reviewed; Bayes' Rule o Counting principles and combinatorics; o Counting considered
More informationChapter 7. Intro to Counting
Chapter 7. Intro to Counting 7.7 Counting by complement 7.8 Permutations with repetitions 7.9 Counting multisets 7.10 Assignment problems: Balls in bins 7.11 Inclusion-exclusion principle 7.12 Counting
More informationMATH STUDENT BOOK. 8th Grade Unit 10
MATH STUDENT BOOK 8th Grade Unit 10 Math 810 Probability Introduction 3 1. Outcomes 5 Tree Diagrams and the Counting Principle 5 Permutations 12 Combinations 17 Mixed Review of Outcomes 22 SELF TEST 1:
More informationTImath.com. Statistics. Too Many Choices!
Too Many Choices! ID: 11762 Time required 40 minutes Activity Overview In this activity, students will investigate the fundamental counting principle, permutations, and combinations. They will find the
More informationUnit 5, Activity 1, The Counting Principle
Unit 5, Activity 1, The Counting Principle Directions: With a partner find the answer to the following problems. 1. A person buys 3 different shirts (Green, Blue, and Red) and two different pants (Khaki
More informationFundamental Counting Principle
11 1 Permutations and Combinations You just bought three pairs of pants and two shirts. How many different outfits can you make with these items? Using a tree diagram, you can see that you can make six
More informationCSE 1400 Applied Discrete Mathematics Permutations
CSE 1400 Applied Discrete Mathematics Department of Computer Sciences College of Engineering Florida Tech Fall 2011 1 Cyclic Notation 2 Re-Order a Sequence 2 Stirling Numbers of the First Kind 2 Problems
More informationIntroduction. Firstly however we must look at the Fundamental Principle of Counting (sometimes referred to as the multiplication rule) which states:
Worksheet 4.11 Counting Section 1 Introduction When looking at situations involving counting it is often not practical to count things individually. Instead techniques have been developed to help us count
More informationQuestion No: 1 If you join all the vertices of a heptagon, how many quadrilaterals will you get?
Volume: 427 Questions Question No: 1 If you join all the vertices of a heptagon, how many quadrilaterals will you get? A. 72 B. 36 C. 25 D. 35 E. 120 Question No: 2 Four students have to be chosen 2 girls
More informationMATH 1324 (Finite Mathematics or Business Math I) Lecture Notes Author / Copyright: Kevin Pinegar
MATH 1324 Module 4 Notes: Sets, Counting and Probability 4.2 Basic Counting Techniques: Addition and Multiplication Principles What is probability? In layman s terms it is the act of assigning numerical
More information6.1 Basics of counting
6.1 Basics of counting CSE2023 Discrete Computational Structures Lecture 17 1 Combinatorics: they study of arrangements of objects Enumeration: the counting of objects with certain properties (an important
More informationMAT3707. 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 informationExercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?
Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with
More informationSec. 4.2: Introducing Permutations and Factorial notation
Sec. 4.2: Introducing Permutations and Factorial notation Permutations: The # of ways distinguishable objects can be arranged, where the order of the objects is important! **An arrangement of objects in
More informationProbability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37
Probability MAT230 Discrete Mathematics Fall 2018 MAT230 (Discrete Math) Probability Fall 2018 1 / 37 Outline 1 Discrete Probability 2 Sum and Product Rules for Probability 3 Expected Value MAT230 (Discrete
More informationMAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally
More informationProbability Theory. Mohamed I. Riffi. Islamic University of Gaza
Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)
More informationCS100: 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 information19.2 Permutations and Probability
Name Class Date 19.2 Permutations and Probability Essential Question: When are permutations useful in calculating probability? Resource Locker Explore Finding the Number of Permutations A permutation is
More informationSection The Multiplication Principle and Permutations
Section 2.1 - The Multiplication Principle and Permutations Example 1: A yogurt shop has 4 flavors (chocolate, vanilla, strawberry, and blueberry) and three sizes (small, medium, and large). How many different
More informationEECS 203 Spring 2016 Lecture 15 Page 1 of 6
EECS 203 Spring 2016 Lecture 15 Page 1 of 6 Counting We ve been working on counting for the last two lectures. We re going to continue on counting and probability for about 1.5 more lectures (including
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationa) 2, 4, 8, 14, 22, b) 1, 5, 6, 10, 11, c) 3, 9, 21, 39, 63, d) 3, 0, 6, 15, 27, e) 3, 8, 13, 18, 23,
Pre-alculus Midterm Exam Review Name:. Which of the following is an arithmetic sequence?,, 8,,, b),, 6, 0,, c), 9,, 9, 6, d), 0, 6,, 7, e), 8,, 8,,. What is a rule for the nth term of the arithmetic sequence
More informationSets, Venn Diagrams & Counting
MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised December 13, 2010 What is a set? Sets set is a collection of objects. The objects in the set are called elements
More information11.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 informationMath 7 Notes - Unit 11 Probability
Math 7 Notes - Unit 11 Probability Probability Syllabus Objective: (7.2)The student will determine the theoretical probability of an event. Syllabus Objective: (7.4)The student will compare theoretical
More informationCombinatorics. Chapter Permutations. Counting Problems
Chapter 3 Combinatorics 3.1 Permutations Many problems in probability theory require that we count the number of ways that a particular event can occur. For this, we study the topics of permutations and
More informationHomework #1-19: Use the Counting Principle to answer the following questions.
Section 4.3: Tree Diagrams and the Counting Principle Homework #1-19: Use the Counting Principle to answer the following questions. 1) If two dates are selected at random from the 365 days of the year
More informationMathematical Foundations of Computer Science Lecture Outline August 30, 2018
Mathematical Foundations of omputer Science Lecture Outline ugust 30, 2018 ounting ounting is a part of combinatorics, an area of mathematics which is concerned with the arrangement of objects of a set
More informationThe 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 informationMath 1111 Math Exam Study Guide
Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the
More informationPermutation and Combination
BANKERSWAY.COM Permutation and Combination Permutation implies arrangement where order of things is important. It includes various patterns like word formation, number formation, circular permutation etc.
More informationMath 3201 Notes Chapter 2: Counting Methods
Learning oals: See p. 63 text. Math 30 Notes Chapter : Counting Methods. Counting Principles ( classes) Outcomes:. Define the sample space. P. 66. Find the sample space by drawing a graphic organizer such
More informationSection 6.4 Permutations and Combinations: Part 1
Section 6.4 Permutations and Combinations: Part 1 Permutations 1. How many ways can you arrange three people in a line? 2. Five people are waiting to take a picture. How many ways can you arrange three
More informationACTIVITY 6.7 Selecting and Rearranging Things
ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize
More informationWeek 1: Probability models and counting
Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model
More information2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)
2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are
More informationNAME DATE PERIOD. Study Guide and Intervention
9-1 Section Title The probability of a simple event is a ratio that compares the number of favorable outcomes to the number of possible outcomes. Outcomes occur at random if each outcome occurs by chance.
More informationMath 1111 Math Exam Study Guide
Math 1111 Math Exam Study Guide The math exam will cover the mathematical concepts and techniques we ve explored this semester. The exam will not involve any codebreaking, although some questions on the
More informationTree Diagrams and the Fundamental Counting Principle
Objective: In this lesson, you will use permutations and combinations to compute probabilities of compound events and to solve problems. Read this knowledge article and answer the following: Tree Diagrams
More informationTHE PROBLEM OF TWO ACES. Carl E. Mungan Physics Department, U.S. Naval Academy
THE PROBLEM OF TWO ACES Carl E. Mungan Physics Department, U.S. Naval Academy CSAAPT at Loyola University Saturday 25 Oct 2014 Chapter 15: Probability & Statistics Section 4 Problem 8 on page 743 Two cards
More informationMath 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 informationCISC 1400 Discrete Structures
CISC 1400 Discrete Structures Chapter 6 Counting CISC1400 Yanjun Li 1 1 New York Lottery New York Mega-million Jackpot Pick 5 numbers from 1 56, plus a mega ball number from 1 46, you could win biggest
More information5.3 Problem Solving With Combinations
5.3 Problem Solving With Combinations In the last section, you considered the number of ways of choosing r items from a set of n distinct items. This section will examine situations where you want to know
More informationOrganized Counting 4.1
4.1 Organized Counting The techniques and mathematical logic for counting possible arrangements or outcomes are useful for a wide variety of applications. A computer programmer writing software for a game
More information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More informationCounting. 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 informationWeek 3 Classical Probability, Part I
Week 3 Classical Probability, Part I Week 3 Objectives Proper understanding of common statistical practices such as confidence intervals and hypothesis testing requires some familiarity with probability
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationWEEK 7 REVIEW. Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.1)
WEEK 7 REVIEW Multiplication Principle (6.3) Combinations and Permutations (6.4) Experiments, Sample Spaces and Events (7.) Definition of Probability (7.2) WEEK 8-7.3, 7.4 and Test Review THE MULTIPLICATION
More informationPERMUTATIONS 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 informationUnit 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 informationChapter 10A. a) How many labels for Product A are required? Solution: ABC ACB BCA BAC CAB CBA. There are 6 different possible labels.
Chapter 10A The Addition rule: If there are n ways of performing operation A and m ways of performing operation B, then there are n + m ways of performing A or B. Note: In this case or means to add. Eg.
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More informationProbability. Key Definitions
1 Probability Key Definitions Probability: The likelihood or chance of something happening (between 0 and 1). Law of Large Numbers: The more data you have, the more true to the probability of the outcome
More informationFinite Mathematics MAT 141: Chapter 8 Notes
Finite Mathematics MAT 4: Chapter 8 Notes Counting Principles; More David J. Gisch The Multiplication Principle; Permutations Multiplication Principle Multiplication Principle You can think of the multiplication
More informationMath 3012 Applied Combinatorics Lecture 2
August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from
More informationProbability Distributions. Probability Distributions. J. Boulton. May 08, 2013 MDM 4U1. Where are we?
May 08, 203 robability Distributions robability Distributions The Distribution Binomial Geometric Hypergeometric Using Ecel Advanced applications The Distribution Binomial Geometric Hypergeometric Using
More informationUsing a table: regular fine micro. red. green. The number of pens possible is the number of cells in the table: 3 2.
Counting Methods: Example: A pen has tip options of regular tip, fine tip, or micro tip, and it has ink color options of red ink or green ink. How many different pens are possible? Using a table: regular
More informationSolitaire Games. MATH 171 Freshman Seminar for Mathematics Majors. J. Robert Buchanan. Department of Mathematics. Fall 2010
Solitaire Games MATH 171 Freshman Seminar for Mathematics Majors J. Robert Buchanan Department of Mathematics Fall 2010 Standard Checkerboard Challenge 1 Suppose two diagonally opposite corners of the
More informationCHAPTER 7 Probability
CHAPTER 7 Probability 7.1. Sets A set is a well-defined collection of distinct objects. Welldefined means that we can determine whether an object is an element of a set or not. Distinct means that we can
More informationDetermine the number of permutations of n objects taken r at a time, where 0 # r # n. Holly Adams Bill Mathews Peter Prevc
4.3 Permutations When All Objects Are Distinguishable YOU WILL NEED calculator standard deck of playing cards EXPLORE How many three-letter permutations can you make with the letters in the word MATH?
More informationMath 1116 Probability Lecture Monday Wednesday 10:10 11:30
Math 1116 Probability Lecture Monday Wednesday 10:10 11:30 Course Web Page http://www.math.ohio state.edu/~maharry/ Chapter 15 Chances, Probabilities and Odds Objectives To describe an appropriate sample
More informationWeek 6: Advance applications of the PIE. 17 and 19 of October, 2018
(1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3
More informationThere are three types of mathematicians. Those who can count and those who can t.
1 Counting There are three types of mathematicians. Those who can count and those who can t. 1.1 Orderings The details of the question always matter. So always take a second look at what is being asked
More informationPermutations 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 information2. The figure shows the face of a spinner. The numbers are all equally likely to occur.
MYP IB Review 9 Probability Name: Date: 1. For a carnival game, a jar contains 20 blue marbles and 80 red marbles. 1. Children take turns randomly selecting a marble from the jar. If a blue marble is chosen,
More informationMath 2311 Bekki George Office Hours: MW 11am to 12:45pm in 639 PGH Online Thursdays 4-5:30pm And by appointment
Math 2311 Bekki George bekki@math.uh.edu Office Hours: MW 11am to 12:45pm in 639 PGH Online Thursdays 4-5:30pm And by appointment Class webpage: http://www.math.uh.edu/~bekki/math2311.html Math 2311 Class
More informationNovember 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
More informationCOUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen
COUNTING TECHNIQUES Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen COMBINATORICS the study of arrangements of objects, is an important part of discrete mathematics. Counting Introduction
More informationFinite Math B, Chapter 8 Test Review Name
Finite Math B, Chapter 8 Test Review Name Evaluate the factorial. 1) 6! A) 720 B) 120 C) 360 D) 1440 Evaluate the permutation. 2) P( 10, 5) A) 10 B) 30,240 C) 1 D) 720 3) P( 12, 8) A) 19,958,400 B) C)
More informationWith 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 informationCounting Methods. Mathematics 3201
Mathematics 3201 Unit 2 2.1 - COUNTING PRINCIPLES Goal: Determine the Fundamental Counting Principle and use it to solve problems. Example 1: Hannah plays on her school soccer team. The soccer uniform
More information4.4: The Counting Rules
4.4: The Counting Rules The counting rules can be used to discover the number of possible for a sequence of events. Fundamental Counting Rule In a sequence of n events in which the first one has k 1 possibilities
More informationDate Topic Notes Questions 4-8
These Combinatorics NOTES Belong to: Date Topic Notes Questions 1. Chapter Summary 2,3 2. Fundamental Counting Principle 4-8 3. Permutations 9-13 4. Permutations 14-17 5. Combinations 18-22 6. Combinations
More information