Counting and Probability

Slides:



Advertisements
Similar presentations
Permutations and Combinations
Advertisements

COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
The Basis of Counting. Imagine you go out for lunch, and as a 1st course you can have soup or pate (but not both) you can have chicken soup or carrot.
T HE F UNDAMENTAL C OUNTING P RINCIPLE & P ERMUTATIONS.
MATHPOWER TM 12, WESTERN EDITION Chapter 7 Combinatorics.
Chapter 5 Section 1 Sets Basics Set –Definition: Collection of objects –Specified by listing the elements of the set inside a pair of braces. –Denoted.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
SETS A = {1, 3, 2, 5} n(A) = | A | = 4 Sets use “curly” brackets The number of elements in Set A is 4 Sets are denoted by Capital letters 3 is an element.
Bell Work Three-course dinners can be made from the menu shown. Find the sample space for a dinner consisting of an appetizer, entrée, and dessert. Hint:
6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.
Counting Principles and Probability Digital Lesson.
Counting and Probability Sets and Counting Permutations & Combinations Probability.
Lesson 7-1. Warm-up You are at a restaurant with a special for $10. You have the option to get: a) an appetizer and an entree or b) an entree and a dessert.
Probability.
9.3 Addition Rule. The basic rule underlying the calculation of the number of elements in a union or difference or intersection is the addition rule.
Advanced Precalculus Advanced Precalculus Notes 12.2 Permutations and Combinations.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Sets Prof. Richard Beigel Math C067 September 18, 2006 Revised September 20, 2006.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
Zero elements. One element.Two elements.Three elements. { a } { b } { c } { a, b } { b, c } { a, c } { a, b, c } 8 subsets.
UNIT VOCABULARY Functions. Closed Form of a Sequence (This is also known as the explicit form of a sequence.) For an arithmetic sequence, use a n = a.
Algebra 2/TrigonometryName: __________________________ 12.1, 12.2 Counting Principles NotesDate: ___________________________ Example 1: You are buying.
9.6 The Fundamental Counting Principal & Permutations.
DAY 6: FUNDAMENTAL COUNTING PRINCIPLE Classwork: pptx examples in class Discrete Pre- Test (not a grade in HAC) Unit 2 Project- Due day 13 Homework (day.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
2.1 Factorial Notation (Textbook Section 4.6). Warm – Up Question  How many four-digit numbers can be made using the numbers 1, 2, 3, & 4?  (all numbers.
College Algebra: Section 8.1 Sets and Counting Objectives of this Section Find All the Subsets of a Set Find All the Subsets of a Set Find the Intersection.
Chapter 7 Sets and Probability Section 7.1 Sets What is a Set? A set is a well-defined collection of objects in which it is possible to determine whether.
Sullivan Algebra and Trigonometry: Section 14.1 Objectives of this Section Find All the Subsets of a Set Find the Intersection and Union of Sets Find the.
Unions and Intersections of Sets Chapter 3 Section 8.
A Π B = all elements in both sets A and B
Math 1320 Chapter 6: Sets and Counting 6.2 Cardinality.
Counting Techniques Section 5.5. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.
MAT 2720 Discrete Mathematics
Sets Page 746.
Chapter two Theory of sets
Sets Finite 7-1.
11.6 SETS AND COUNTING.
addition and multiplication
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
12.2 Permutations and Combinations
Topic: Probability Aim: How do we find the probability of compound events? Do Now: Three-course dinners can be made from the menu shown. (a) Find the sample.
The Basic Concepts of Set Theory
Counting and Probability Section 12.1: Sets and Counting IBTWW…
One, two, three, we’re… Counting.
Counting Principles and Tree Diagrams
12.1 The Fundamental Counting Principle & Permutations
Set Operations Section 2.2.
Algebra 1 Section 1.1.
Homework Review.
The Basic Concepts of Set Theory
Set-Builder Notation.
Chapter 3 Probability.
Relationships Between Sets
Permutations and Combinations
COUNTING AND PROBABILITY
SETS Sets are denoted by Capital letters Sets use “curly” brackets
The Basis of Counting.
Section 2.7 Prime Factorization
Sets A set is simply any collection of objects
Number Talk What is a Number Talk?
Chapter 10 Counting Methods.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
12.1 The Fundamental Counting Principle and Permutations
Set Concepts & Subsets Sections 2.1 & 2.2.
Chapter 11: Further Topics in Algebra
Tree Diagrams Section 5.
{ a } { a, b } { a, b, c } { a, c } { b } 8 subsets. { b, c } { c }
Presentation transcript:

Counting and Probability Chapter 13 Counting and Probability

Section 1 Counting

A set is a well-defined collection of distinct elements A set is a well-defined collection of distinct elements. If a set has no elements, it is called the empty set or null set {ø}

If A and B are sets: The intersection A ∩ B = a set consisting of elements that A AND B have in common The union A U B = a set consisting of elements that belong to either A OR B A ⊂ B means everything in A is also in B, but B may not necessarily all be in A If you are given a universal set and A is a subset of the universal: Then the compliment of A, Ā, is the set consisting of all the elements in the universal set that are NOT in A. If A is a set with n elements, then A has exactly 2n subsets.

Counting Formula: n(A U B) = n(A) + n(B) – n(A ∩ B) (# of elements in A union B) = (# in A) + (# in B) – (# that A & B have in common) Addition Principle of Counting: If A & B have no common elements (i.e. - A ∩ B = ø), then n(A U B) = n(A) + n(B) Multiplication Principle of Counting: If a task consists of a sequence of choices in which there are p selections for 1st, q selections for 2nd, and r selections for 3rd and so on, then the task of doing them can be done in p x q x r x … different ways

Example 2: In a survey of 100 college students, 35 were registered in College Algebra, 52 were registered in Computer Science I, and 18 were registered in both courses. a) How many students were registered in College Algebra OR Computer Science I? b) How many were registered in neither course?

Example 3: (see page 852 for table) In 2004, U.S. universities awarded 42,155 doctoral degrees. Table 1 lists the number of doctorates conferred by broad fields of study. a) How many doctorates were awarded by U.S. universities in physical sciences OR life sciences? b) How many doctorates were awarded by U.S. universities in physical sciences, life sciences, OR engineering?

Example 4: (see page 853) The fixed-price dinner at Mabenka Restaurant provides the following choices: Appetizer: soup or salad Entrée: baked chicken, broiled beef patty, baby beef liver, roast beef au jus Dessert: ice cream or cheese cake How many different meals can be ordered?

Example 5: How many two-symbol code words can be formed if the first symbol is a letter and the second symbol is a digit?

EXIT SLIP