Chapter 7 Logic, Sets, and Counting

Slides:



Advertisements
Similar presentations
1 Learning Objectives for Section 7.3 Basic Counting Principles After this lesson, you should be able to apply and use the addition principle. draw and.
Advertisements

Recursively Defined Functions
Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.
Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Multiplication Principle and Addition Principle 1.Multiplication Principle: Suppose a task is accomplished by n steps and each step requires a choice from.
COUNTING AND PROBABILITY
COUNTING TECHNIQUES PERMUTATIONS AND COMBINATIONS.
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
6.3 Basic Counting Principles In this section, we will see how set operations play an important role in counting techniques.
Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
1 Section 4.1 Basics of Counting. 2 Basic Counting Principles: Sum Rule Suppose you have two tasks to perform: –The first task can be done in n 1 ways;
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Unit 10 – Logic and Venn Diagrams
Sets and Venn Diagrams By Amber K. Wozniak.
Operations on Sets – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Operations on Sets Reading: Kolman, Section 1.2.
Introduction to Venn Diagrams SP This is a Venn diagram for two terms. We can conceive of every element of S as being within the boundary of the S circle.
Sets and subsets D. K. Bhattacharya. Set It is just things grouped together with a certain property in common. Formally it is defined as a collection.
College Algebra Fifth Edition
DP SL Studies Chapter 7 Sets and Venn Diagrams. DP Studies Chapter 7 Homework Section A: 1, 2, 4, 5, 7, 9 Section B: 2, 4 Section C: 1, 2, 4, 5 Section.
Chapter 5 Section 5 Counting Techniques.
5.5 Counting Techniques. More Challenging Stuff  The classical method, when all outcomes are equally likely, involves counting the number of ways something.
Copyright © Cengage Learning. All rights reserved. CHAPTER 9 COUNTING AND PROBABILITY.
Formulas and Principles. Math I Unit 4 If one event can occur in m ways and another event can occur in n ways, then the number of ways that both events.
7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.
Number of Elements in a Finite Set. Notation : The number of the elements of the set A will be denoted by n(A) Examples (1): Let: Let: A = {a,b,c,d} B.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ Basic Counting Principles 6.3 Basic Counting.
1 Binomial Coefficients CS 202 Epp, section ??? Aaron Bloomfield.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
The Basics of Counting Section 6.1.
Section Section Summary The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams.
1 CHAPTERS 14 AND 15 (Intro Stats – 3 edition) PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY.
Shade the Venn diagram to represent the set A' U (A ∩ B)
Copyright © Cengage Learning. All rights reserved.
Chapter 2 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.
1 CHAPTER 7 PROBABILITY, PROBABILITY RULES, AND CONDITIONAL PROBABILITY.
1 Basics of Counting CS/APMA 202 Rosen section 4.1 Aaron Bloomfield.
Discrete Structures Counting (Ch. 6)
Learning Objectives for Section 7.3 Basic Counting Principles
Section 1.1, Slide 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 12.2, Slide 1 12 Counting Just How Many Are There?
1 Section 6.5 Inclusion/Exclusion. 2 Finding the number of elements in the union of 2 sets From set theory, we know that the number of elements in the.
Counting The Fundamental Counting Principle. Fundamental Counting Principle If a series of “n” decisions must be made, and if the first decision can be.
Introduction to Discrete Probability Epp, section 6.x CS 202.
Monday, January 25, 2016 Practice Quiz Counting Probability.
Lesson 0.4 (Counting Techniques)
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.3 Venn Diagrams and Set Operations.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Union and Intersection of Sets. Definition - intersection The intersection of two sets A and B is the set containing those elements which are and elements.
Venn Diagrams.
1 What Is Probability?. 2 To discuss probability, let’s begin by defining some terms. An experiment is a process, such as tossing a coin, that gives definite.
Chapter 2 Sets and Functions.
G2.4 – Set Operations There are some operations that we can do on sets. Some of them will look very similar to operations from algebra. August 2006 Copyright.
COCS DISCRETE STRUCTURES
Recursively Defined Functions
One, two, three, we’re… Counting.
2 Chapter Introduction to Logic and Sets
Chapter 7 Logic, Sets, and Counting
Representations of Integers
Counting Methods and Probability Theory
Counting Methods and Probability Theory
Presentation transcript:

Chapter 7 Logic, Sets, and Counting Section 3 Basic Counting Principles

7.3 Basic Counting Principles In this section, we will see how set operations play an important role in counting techniques.

Opening Example To see how sets play a role in counting, consider the following example: In a certain class, there are 23 majors in Psychology, 16 majors in English and 7 students who are majoring in both Psychology and English. If there are 50 students in the class, how many students are majoring in neither of these subjects? How many students are majoring in Psychology alone?

Solution We introduce the following principle of counting that can be illustrated using a Venn diagram. This statement says that the number of elements in the union of two sets A and B is the number of elements of A plus the number of elements of B minus the number of elements that are in both A and B (because we counted those twice).

Solution (continued) 23 + 16 – 7 = 32 7 students in this region Both Psych and English 23 + 16 – 7 = 32 Do you see how the numbers of each region are obtained from the given information in the problem? We start with the region represented by the intersection of Psych and English majors (7). Then, because there are 23 Psych majors, there must be 16 Psych majors remaining in the rest of the set. A similar argument will convince you that there are 9 students who are majoring in English alone. 9 students in this region 16 students here

A Second Problem A survey of 100 college faculty who exercise regularly found that 45 jog, 30 swim, 20 cycle, 6 jog and swim, 1 jogs and cycles, 5 swim and cycle, and 1 does all three. How many of the faculty members do not do any of these three activities? How many just jog? We will solve this problem using a three-circle Venn Diagram in the accompanying slides.

Solution We will start with the intersection of all three circles. This region represents the number of faculty who do all three activities (one). Then, we will proceed to determine the number of elements in each intersection of exactly two sets. 1 does all 3

Solution (continued) Starting with the intersection of all three circles, we place a 1 in that region (1 does all three). Then we know that since 6 jog and swim so 5 faculty remain in the region representing those who just jog and swim. Five swim and cycle, so 4 faculty just swim and cycle but do not do all three. Since 1 faculty is in the intersection region of joggers and cyclists, and we already have one that does all three activities, there must be no faculty who just jog and cycle. Since the sum of the numbers of these disjoint regions is 84, there must be 16 faculty who do none of these activities.

Multiplication Principle An Example To illustrate this principle, let’s start with an example. Suppose you have 4 pairs of trousers in your closet, 3 different shirts and 2 pairs of shoes. Assuming that you must wear trousers (we hope so!), a shirt and shoes, how many different ways can you get dressed?

Multiplication Principle Example Solution Let’s assume the colors of your pants are black, grey, rust, olive. You have four choices here. The shirt colors are green, marine blue and dark blue. For each pair of pants chosen (4) you have (3) options for shirts. You have 12 = 4  3 options for wearing a pair of trousers and a shirt. Now, each of these twelve options, you have two pair of shoes to choose from (Black or brown). Thus, you have a total of 4  3  2 = 24 options to get dressed.

Generalized Multiplication Principle Suppose that a task can be performed using two or more consecutive operations. If the first operation can be accomplished in m ways and the second operation can be done in n ways, the third operation in p ways and so on, then the complete task can be performed in m·n·p … ways.

Another Problem How many different ways can a team consisting of 28 players select a captain and an assistant captain?

Another Problem How many different ways can a team consisting of 28 players select a captain and an assistant captain? Solution: Operation 1: Select the captain. If all team members are eligible to be a captain, there are 28 ways this can be done. Operation 2: Select the assistant captain. Assuming that a player cannot be both a captain and assistant captain, there are 27 ways this can be done, since there are 27 team members left who are eligible to be the assistant captain. Using the multiplication principle, there are (28)(27) = 756 ways to select both a captain and an assistant captain.

Final Example A sportswriter is asked to rank 8 teams in the NBA from first to last. How many rankings are possible?

Final Example A sportswriter is asked to rank 8 teams in the NBA from first to last. How many rankings are possible? Solution: There are 8 choices that can be made for the first place team since all teams are eligible. That leaves 7 choices for the second place team. The third place team is determined from the 6 remaining choices and so on. Total is the product of 8(7)…1 = 40,320.