Combinations A combination is a grouping of things ORDER DOES NOT MATTER.

Slides:

Advertisements

Similar presentations

Combinations Examples

Advertisements

5.3 Permutations and Combinations

Geometry Mini-Lesson AB = 4, DE = 4, m BAC = m EDF

Quantitative Methods Session – Permutation & Combination Pranjoy Arup Das.

Permutations and Combinations

Quit Permutations Combinations Pascal’s triangle Binomial Theorem.

1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.

1 Counting Rules. 2 The probability of a specific event or outcome is a fraction. In the numerator we have the number of ways the specific event can occur.

Chapter 7 - Part Two Counting Techniques Wednesday, March 18, 2009.

Chapter 5 Section 5 Permutations and Combinations.

Combinations Combinations are very similar to permutations with one key difference: Order does not matter.

Unit 7: Probability Lesson 2 Tree Diagrams, fundamental counting principle, sample space lists and tables, permutation, combination, factorials.

Elementary Counting Techniques & Combinatorics Martina Litschmannová K210.

Elementary Counting Techniques & Combinatorics

Math 2 Honors - Santowski

Chapter 5 Possibilities and Probability Counting Permutations Combinations Probability.

P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.

Page 53, Chapter Summary: Concepts and Procedures After studying this CHAPTER, you should be able to Recognize points, lines, segments, rays, angles,

Chapter 11: Counting Methods

3.8 Counting Techniques: Combinations. If you are dealt a hand in poker (5 cards), does it matter in which order the cards are dealt to you? A  K  J.

6.1 Probability exercises. Def Def: If S is a finite sample space of equally likely outcomes, and E is an event, that is, a subset of S, then the probability.

Lesson 1.9 Probability Objective: Solve probability problems.

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.

Sara Beberman Olivia DeFlumeri Olivia Huynh Amanda Okaka.

Chapter 10: Counting Methods

Mathematics. Permutation & Combination - 2 Session.

Elementary Combinatorics Combinatorics  Deals with enumeration (counting) techniques and related algebra.  Basis of counting XSet |X|No. of elements.

15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.

CSE 221: Algorithms and Data Structures Lecture #10 Counting: Easy as 1, 2, C(3,1) Steve Wolfman 2009W1 1.

© The McGraw-Hill Companies, Inc., Chapter 4 Counting Techniques.

Probability Chapter 2 A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes. The world is.

0 0 Correction: Problem 18 Alice and Bob have 2n+1 FAIR coins, each with probability of a head equal to 1/2.

The local Family Restaurant has a daily breakfast special in which the customer may choose one item from each of the following groups: Breakfast Sandwich.

Honors Precalculus Counting and Probability Section 12.2: Permutations and Combinations IBTWW: 10/23/2015.

1 Block 3 Discrete Systems Lesson 9 – Methods of Discrete Counting You can count on this presentation. Narrator: Charles Ebeling.

Permutations and Combinations

Counting CSC-2259 Discrete Structures Konstantin Busch - LSU1.

Objective: You should be able to solve problems involving permutations and combinations.

Probability. Basic Concepts of Probability What you should learn: How to identify the sample space of a probability experiment and to identify simple.

Discrete Mathematics Lecture # 25 Permutation & Combination.

15.3 Permutations and Combinations OBJ:  To solve problems involving permutations and combinations.

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

Combinations & Permutations Permutation => Order is important Combination => Order doesn’t matter Examples: Your Locker “Combination” The lunch line (might.

Permutations and Combinations PSSA Unit. Permutations A permutation of the letters abc is all of their possible arrangements: abc acb bac bca cab cba.

Permutations and Combinations

Warm Up Find the number of possible outcomes. 1. bagels: plain, egg, wheat, onion meat: turkey, ham, roast beef, tuna 2. eggs: scrambled, over easy, hard.

Unit 3 Seminar: Probability and Counting Techniques.

Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.

Permutations. Permutation: The number of ways in which a subset of objects can be selected from a given set of objects, where order is important. Given.

Permutations and Combinations

9 Deductive Geometry 9.1 Introduction to Deductive Reasoning and Proofs 9.2 Deductive Proofs Related to Lines and Triangles 9.3 Deductive Proofs Related.

11.3 Notes Combinations.

CSE 221: Algorithms and Data Structures Lecture #10 Counting: Easy as 1, 2, C(3,1) Steve Wolfman 2010W2.

Elementary Counting Techniques & Combinatorics

CSC-2259 Discrete Structures

Counting Principals, Permutations, and Combinations

Counting, Permutations, & Combinations

Calculating Probability, Combinations and Permutations

Warm-Up #4 Monday, 2/8/2016 Simplify 19! 13!

Warm Up Problem of the Day Lesson Presentation Lesson Quizzes.

Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.

Lesson 11-1 Permutations and Combinations

104- Ch. 11 part 1; 260- Ch. 5 pt. 2 master_prob_pc.pptx

Section 6.2 Permutations with Repeated Objects and Combinations

Permutations and Combinations

Probability Warm Up page 12- write the question you have 10 mins to complete it. See coaching on page 85.

Presentation transcript:

Combinations A combination is a grouping of things ORDER DOES NOT MATTER

How many arrangements of the letters a, b, c and d can we make using 3 letters at a time if order does not matter? We know there are 4! = 24 permutations. Listed out they are: abc acb bac bca cab cba = 1 combination abd adb bad bda dab dba = 1 combination acd adc cad cda dac dca = 1 combination bcd bdc cbd cdb dbc dcb = 1 combination = 4 combinations, total

Each of the above combinations had 3 letters, so there were 3! ways to change the order around (3! permutations). If order doesnt matter we will divide by that number. Each of the above combinations had 3 letters, so there were 3! ways to change the order around (3! permutations). If order doesnt matter we will divide by that number. The number of ways of choosing r objects from a set of n without regard to order is: This is commonly read as n choose r

Two examples to show the difference between permutations and combinations: How many seating arrangements of 6 students can be made from a class of 30? (order matters – a permutation) How many seating arrangements of 6 students can be made from a class of 30? (order matters – a permutation)

How many ways are there of choosing 6 students for a class project in a class of 30? (order does not matter – just that 6 students are picked – a combination)

How many different 6 number lottery tickets can be issued? A purchaser picks 6 numbers from 00 – 99 and it does not matter which order they are in. How many different 6 number lottery tickets can be issued? A purchaser picks 6 numbers from 00 – 99 and it does not matter which order they are in.

100 numbers to pick from Want the 6 that are correct Picking 6 correct lottery numbers...

How many different 5-card poker hands are there?

52 cards to pick from Want 5 cards total Different 5-card poker hands...

How many different 5-card hands can there be if all cards must be clubs (a flush in clubs)?

13 clubs to pick from Want 5 cards total A flush in clubs...

How many different 5-card hands can there be if all cards must be the same suit (a flush in any suit)?

A flush in ANY suit... 4 cases that are the same - the 4 cases are from the 4 suits: hearts, spades, clubs or diamonds. Same as the previous example

How many different 5-card hands can there be that contain exactly 3 Aces?

# ways to get 3 Aces * # ways to get other 2 cards 5 cards with exactly 3 aces...

How many different 5-card hands can there be that contain at least 3 Aces?

# ways to get 3 Aces (from previous example) + # ways to get 4 Aces 5 cards with at least 3 aces... = = 4560 ways

How many different 5-card hands can there be that contain exactly 2 Hearts?

# ways to get 2 Hearts * # ways to get other 3 cards 5 cards with exactly 2 hearts...