Combinations & Permutations (4.3.1)

Slides:

Advertisements

Similar presentations

Counting and Factorial. Factorial Written n!, the product of all positive integers less than and equal to n. Ex: Evaluate.

Advertisements

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.

Statistics Review. Box-and-Whisker Plots The Parts of a Box and Whisker Plot Name the parts of a Box-and-Whisker Plot MedianUpper Quartile Lower.

How many possible outcomes can you make with the accessories?

Combinations We should use permutation where order matters

Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.

6-7 Permutations & Combinations M11.E.3.2.1: Determine the number of permutations and/or combinations or apply the fundamental counting principle.

Permutations and Combinations

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

6.2 Find Probability Using Permutations. Vocabulary n factorial: product of integers from 1 to n, written as n! 0! = 1 Permutation: arrangement of objects.

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

Transparency 3 Click the mouse button or press the Space Bar to display the answers.

Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.

Slide Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.

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

Basic Probability Permutations and Combinations: -Combinations: -The number of different packages of data taken r at time from a data set containing n.

Elements of Combinatorics (Continuation) 1. Pigeonhole Principle Theorem. If pigeons are placed into pigeonholes and there are more pigeons than pigeonholes,

CCM 4300 Lecture 1 Computer Networks: Wireless and Mobile Communication Systems. Permutations and Combinations Dr E. Ever School of Engineering and Information.

Chapter 7 Logic, Sets, and Counting Section 4 Permutations and Combinations.

Copyright © 1998, Triola, Elementary Statistics Addison Wesley Longman 1 M ARIO F. T RIOLA E IGHTH E DITION E LEMENTARY S TATISTICS Section 3-6 Counting.

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

2.2 Permutations (Textbook Section 4.6). Recall Factorial Notation  The number of ways to arrange n objects into n spots is n! (read “!” a “factorial”)

Find permutations using permutation notation and using technology.

Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 7.4 Permutations and Combinations The student will be able to set up and.

Permutations and Combinations

Permutations and Combinations. Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish permutations.

Counting Principles Multiplication rule Permutations Combinations.

THE NATURE OF COUNTING Copyright © Cengage Learning. All rights reserved. 12.

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

Lesson 0.4 (Counting Techniques)

37. Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.

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

Permutations and Combinations

COUNTING Permutations and Combinations. 2Barnett/Ziegler/Byleen College Mathematics 12e Learning Objectives for Permutations and Combinations  The student.

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.

Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:

Chapter 12.6 Notes. O A positive integer n is the product of the positive integers less than or equal to n. 0! Is defined to be 1. n! = n ● (n -1) ● (n.

Probability and Counting Rules 4-4: Counting Rules.

Permutations and Combinations AII Objectives:  apply fundamental counting principle  compute permutations  compute combinations  distinguish.

Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.

Permutations and Combinations

Permutations and Combinations

Counting Methods and Probability Theory

Happy Pi Day! Find x. 15 If you still have x

12.2 Permutations and Combinations

6.7 – Permutations and Combinations

Permutations and Combinations

4 Probability Lesson 4.8 Combinations and Probability.

Chapter 7 Logic, Sets, and Counting

Permutations and Combinations

Permutations and Combinations

Lesson 11-1 Permutations and Combinations

Permutations and Combinations

Permutations and Combinations

6-7 Permutations and Combinations

Choose the best answer for each problem.

Permutations and Combinations

Counting Methods and Probability Theory

Counting Principle.

Bellwork Practice Packet 10.3 B side #3.

Permutations and Combinations

Standard DA-5.2 Objective: Apply permutations and combinations to find the number of possibilities of an outcome.

Permutations and Combinations

Chapter 11: Further Topics in Algebra

Lecture 7: Permutations and Combinations

Permutations and Combinations

MATH 2311 Section 2.1.

Presentation transcript:

Combinations & Permutations (4.3.1) March 9th, 2017

Vocabulary and Notation *A combination is a subset of objects taken from a larger group where the order of the objects does not matter and the objects may be repeated. The combination of r objects chosen out of a larger group of n objects is given by *A permutation is an arrangement of some or all of the objects in a group where the order of the objects matters and the objects may or may not be repeated. The number of permutations of n objects in r positions, without repeating any objects, is given by

*A factorial is the product of an integer and all of its preceding positive integers, represented by the ! symbol. Thus, 5!=(5)(4)(3)(2)(1). To find the number of permutations of r objects by themselves, just use r! since if there are r choices for the first object, there will only be r-1 choices for the second object, and r-2 choices for the third object…

Ex. 1: (a)Jeremiah is taking a multiple-choice quiz with 10 questions that can each be answered A, B, C, or D. How many different answer variations are there for the quiz? (b) Now assume he is taking a 10 question quiz with 10 possible answer choices, but each answer may only be used once. How many different answer variations are there for the new quiz?

Ex. 2: Mrs. MT is choosing 8 students from her class of 35 students to create a group presentation about statistics. How many possible groups can be selected?