 To apply some rule and product rule in solving problems.  To apply the principles of counting in solving problems.

Slides:

Advertisements

Similar presentations

4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.

Advertisements

Counting Basics: Be careful of the boundary conditions Try to come up with a general rule.

Warm-Up Problem Can you predict which offers more choices for license plates? Choice A: a plate with three different letters of the alphabet in any order.

Topic 3: Counting Techniques CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.

Combinations We should use permutation where order matters

1 More Counting Techniques Possibility trees Multiplication rule Permutations Combinations.

Probability Using Permutations and Combinations

Warm Up Evaluate  4  3  2   6  5  4  3  2  Permutations and Combinations.

4. Counting 4.1 The Basic of Counting Basic Counting Principles Example 1 suppose that either a member of the faculty or a student in the department is.

Chapter The Basics of Counting 5.2 The Pigeonhole Principle

Counting Unit Review Sheet. 1. There are five choices of ice cream AND three choices of cookies. a)How many different desserts are there if you have one.

1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.

Permutations Lesson 10 – 4. Vocabulary Permutation – an arrangement or listing of objects in which order is important. Example: the first three classes.

7 Further Topics in Algebra © 2008 Pearson Addison-Wesley. All rights reserved Sections 7.4–7.7.

Advanced Mathematics Counting Techniques. Addition Rule Events (tasks) A and B are mutually exclusive (no common elements/outcomes) and n(A) = a, n(B)

Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.

Discrete Mathematical Structures (Counting Principles)

Chapter 10: Counting Methods

Chapter 6 With Question/Answer Animations 1. Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients.

Chapter 11 Counting Methods © 2008 Pearson Addison-Wesley. All rights reserved.

10.3 – Using Permutations and Combinations Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where.

13-1 Permutations and Combinations

Methods of Counting Outcomes BUSA 2100, Section 4.1.

NO ONE CAN PREDICT TO WHAT HEIGHTS YOU CAN SOAR

Warm Up Evaluate  4  3  2   6  5  4  3  2 

At the local deli you can add two toppings to your sandwich. Draw a tree diagram to show how many ways you can select two different toppings for your sandwich.

Lesson 9-4 Pages Permutations Lesson Check 9-3.

ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.

Lesson Counting Techniques. Objectives Solve counting problems using the Multiplication Rule Solve counting problems using permutations Solve counting.

Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.

Counting for Quest 2 Do Now Class Examples Suppose you take 4 different routes to Trenton, the 3 different routes to Philadelphia. How many different.

Thinking Mathematically

Discrete Mathematics Lecture # 25 Permutation & Combination.

Counting Principles Multiplication rule Permutations Combinations.

11.1A Fundamental Counting Principal and Factorial Notation 11.1A Fundamental Counting Principal If a task is made up of multiple operations (activities.

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 11 Counting Methods and Probability Theory.

Mr. Mark Anthony Garcia, M.S. Mathematics Department De La Salle University.

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.

Chance of winning Unit 6 Probability. Multiplication Property of Counting  If one event can occur in m ways and another event can occur in n ways, then.

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.

CS 104: Discrete Mathematics

Permutations and Combinations. Fundamental Counting Principle If there are r ways of performing one operation, s ways of performing a second operation,

ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.

1 2.3 Counting Sample Points (6)(6)(6)= 216 Example: How many outcome sequences are possible when a die is rolled three times?

The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.

COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.

The Multiplication Rule

Chapter 10 Counting Methods.

4-1 Chapter 4 Counting Techniques.

Permutations and Combinations

Copyright © 2016, 2013, and 2010, Pearson Education, Inc.

Counting Methods and Probability Theory

Section 8.1 When Does Order Matter?

1. In how many ways can six people sit in a six-passenger car?

Permutations 10.5 Notes.

Chapter 0.4 Counting Techniques.

4-1 Chapter 4 Counting Techniques.

Chapter 10: Counting Methods

One, two, three, we’re… Counting.

4-1 Chapter 4 Counting Techniques.

Warm Up Permutations and Combinations Evaluate  4  3  2  1

Counting arrangements - Permutations

10.4 Permutations and Combinations

Counting Methods and Probability Theory

Chapter 10 Counting Methods.

4-1 Chapter 4 Counting Techniques.

Using Permutations and Combinations

Chapter 10 Counting Methods 2012 Pearson Education, Inc.

1. How many matchsticks would be used to make figure 10?

10.3 – Using Permutations and Combinations

Presentation transcript:

 To apply some rule and product rule in solving problems.  To apply the principles of counting in solving problems.

How many triangle can you draw using the 9 dots below as vertices?

Everyday, there are 2 trains routine, 5 express bus routine, and 4 flight routine from Malaysia to Singapore. How many different ways can a passenger travel from Malaysia to Singapore? Train 2 Bus 5 Flight 4 Total different ways 11

… Task

Example: A student wants to borrow a book from library. He can choose the book from 3 business books, 5 computer science books, and 2 mathematics books. How many different ways he can borrow the book from library? * = 10 different ways to borrow a books.

* If John travel from town A to town C via town B. There are 3 routes from town A to town B and 2 routes from town B to town C. In how many ways can John travel from town A to town C?

… Task

Each of five cards contain digit 0, 1, 2, 3, 4 respectively. 1. In how many ways these cards can be arranged to get an odd number? 2. In how many ways these cards can be arranged to obtain a number that is greater than 30, In how many ways these cards can be arranged to obtain an odd number that is greater than 30,000?

Exercise: 1. In how many ways can the word “Computing” can be arranged? 2. In how many ways can 3 persons be seated in an empty bus that has 44 seats.

Assume that A, B, C are 3 students. 2 students are selected to take a photo. In how many ways we can arrange the 2 students? Is AB and BA be considered as the same photo? No. Is AB and BA considered as the same team? Yes. When the order is important, the arrangement is called Permutation. When the order is not important, the selection is called Combination. ABACCB BACABC

How many triangle can you draw using the 9 dots below as vertices?

1.A person buying a personal computer system is offered a choice of three models of the basic unit, two models of keyboard, and two models of printer. How many distinct systems can be purchased? 2.Suppose that a code consists of five characters, two letters followed by three digits. Find the number of: a)codes; b)codes with distinct letter. 3.Consider all positive integers with three digits. (Note that zero cannot be the first digit.) Find the number of them which are: a)greater than 700; b)odd; c)divisible by 5.