L2 Supplementary Notes Page 1 09-02-2010: Recap l General Product Principle n For counting list l Counting Functions n Functions are lists l Function concepts.

Slides:



Advertisements
Similar presentations
3.7: Counting Objective: To find the counts of various combinations and permutations, as well as their corresponding probabilities CHS Statistics.
Advertisements

Jessie Zhao Course page: 1.
RELATIONRELATIONAA Age (years)Weight (kg) Consider the relationship between the weight of five students and their ages as shown.
Counting Andreas Klappenecker. Counting k = 0; for(int i=1; i
Main Menu Main Menu (Click on the topics below) Combinations Example Theorem Click on the picture.
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.
Fall 2002CMSC Discrete Structures1 Permutations How many ways are there to pick a set of 3 people from a group of 6? There are 6 choices for the.
Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =
PERMUTATIONS & COMBINATIONS 1. Permutation and combination both are the process of arrangements. Permutation is the different arrangements of things from.
Functions Section 2.3 of Rosen Fall 2008
Today Today: Reading: –Read Chapter 1 by next Tuesday –Suggested problems (not to be handed in): 1.1, 1.2, 1.8, 1.10, 1.16, 1.20, 1.24, 1.28.
L1 Supplementary Notes Page 1 Selection Sort Comparison Counting.
Combinations We should use permutation where order matters
L2 Supplementary Notes Page : Recap l Sum Principle n Applied to selection sort l Product Principle n Applied to matrix multiplication and.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Logic and Introduction to Sets Chapter 6 Dr.Hayk Melikyan/ Department of Mathematics and CS/ For more complicated problems, we will.
College Algebra Fifth Edition
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
P ERMUTATIONS AND C OMBINATIONS Homework: Permutation and Combinations WS.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Introductory Statistics Lesson 3.4 A Objective: SSBAT determine the number of permutations. Standards: M11.E
Math Duels Competition of Scholars. Rules  The class must be split into 2 groups.  Each group must select a team captain and they must do Rock-Paper-Scissors.
Finding Probability Using Tree Diagrams and Outcome Tables
Counting Principles. What you will learn: Solve simple counting problems Use the Fundamental Counting Principle to solve counting problems Use permutations.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Methods of Counting Outcomes BUSA 2100, Section 4.1.
ELEC 303, Koushanfar, Fall’09 ELEC 303 – Random Signals Lecture 4 – Counting Farinaz Koushanfar ECE Dept., Rice University Sept 3, 2009.
THE NATURE OF COUNTING Copyright © Cengage Learning. All rights reserved. 12.
COMP 170 L2 Page 1 Review for Midterm 1 l Part I: Counting n L01-L03 l Part II: Number Theory and Cryptography n L04, L05.
1 CSC 321: Data Structures Fall 2013 Counting and problem solving  mappings, bijection rule  sequences, product rule, sum rule  generalized product.
Simple Arrangements & Selections. Combinations & Permutations A permutation of n distinct objects is an arrangement, or ordering, of the n objects. An.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Chapter 7 Review Important Terms, Symbols, Concepts 7.1. Logic A proposition is a statement (not a question.
Sullivan Algebra and Trigonometry: Section 14.2 Objectives of this Section Solve Counting Problems Using the Multiplication Principle Solve Counting Problems.
Counting Principle FACTORIAL, PERMUTATION, COMBINATION FACTORIAL, PERMUTATION, COMBINATION.
Section 11.2 Combinations Math in Our World Learning Objectives  Distinguish between combinations and permutations.  Find the number of combinations.
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”)
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
Type your question here. Type Answer Type your question here. Type Answer.
MAT 2720 Discrete Mathematics Section 3.1 Functions
Permutations and Combinations Section 2.2 & 2.3 Finite Math.
Arrangements How many ways can I arrange the following candles?
Counting Principles Multiplication rule Permutations Combinations.
THE NATURE OF COUNTING Copyright © Cengage Learning. All rights reserved. 12.
How many ways can we arrange 3 objects A, B, and C: Using just two How many ways can we arrange 4 objects, A, B, C, & D: Using only two Using only three.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Counting Techniques. Multiplication Principle (also called the Fundamental Counting Principle) Combinations Permutations Number of subsets of a given.
3.2 Combinations.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Quiz 3 Counting: 4.3, 4.4.
The Tennis Club Problem Supplementary Notes  A tennis club has 2n members.  We want to pair up the members (by twos) to play singles matches  Question:
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.
Permutations and Combinations
Algebra 2 Tuesday Today, we will be able to… Use combinations and permutations to find probability Create and use graphs of probability distribution.
Answers 1.3/10 2.1/ / / /35 6.7/15.
CS Lecture 6 How To Count Without Counting.
MATHPOWER TM 12, WESTERN EDITION Chapter 8 Probability
The Fundamental Counting Principle and Permutations 18.0 Students use fundamental counting principles to compute combinations and permutations Students.
Permutations and Combinations. Fundamental Counting Principle Fundamental Counting Principle states that if an event has m possible outcomes and another.
Counting Principle part 2 I. Math symbols and formulas for Counting Principles. A) Basic Counting Principle = m x n where you have m things and n things.
Sequences Lecture 11. L62 Sequences Sequences are a way of ordering lists of objects. Java arrays are a type of sequence of finite size. Usually, mathematical.
11.1 Factorial & Fundamental Counting Principles.
Discrete Math Section 15.2 Apply the multiplication, addition, and complement principles My wardrobe consists of two pairs of pants and four shirts. How.
Unit 8 Probability.
Probability and Combinatorics
9. Counting and Probability 1 Summary
8.3 Counting Apply the fundamental counting principle
Counting arrangements - Permutations
Combinatorics.
PERMUTATIONS.
Presentation transcript:

L2 Supplementary Notes Page : Recap l General Product Principle n For counting list l Counting Functions n Functions are lists l Function concepts n Injection, surjection, and bijection l Bijiection Principle

L2 Supplementary Notes Page : Product Principle

L2 Supplementary Notes Page : Recap/Counting Functions

L2 Supplementary Notes Page : Injection and Surjection

L2 Supplementary Notes Page : Bijection

L2 Supplementary Notes Page : Bijection Principle

L2 Supplementary Notes Page : Today

L2 Supplementary Notes Page 8 Increasing Triples l Can we count using general product principle? n # of possible values for i?  n-2 n # of possible values for j?  Depends on value of i!  Violates condition of general product principle

L2 Supplementary Notes Page 9 Use Bijection Principle l n=4 l All increasing triples listed. l Do we have all the subsets? How about subset {2, 1, 3}? n It is the same as {1, 2, 3}

L2 Supplementary Notes Page 10 Increasing Triples

L2 Supplementary Notes Page 11 Increasing Triples

L2 Supplementary Notes Page 12 Increasing Triples l Same as n The number of 3-element subsets from {1, 2, …, n} n What is this number? l First consider another number n The number of 3-element permutations from {1, 2, …, n}

L2 Supplementary Notes Page 13 l Order matters, not required to be increasing l 3-element permutations from {1, 2, 3, 4}

L2 Supplementary Notes Page 14 l General product principle can be applied here although cannot for increasing triples. Why?

L2 Supplementary Notes Page 15 3-element subsets/3-element permutations

L2 Supplementary Notes Page 16 3-element subsets/Increasing triples l Same as n The number of 3-element subsets from {1, 2, …, n}

L2 Supplementary Notes Page 17

L2 Supplementary Notes Page 18 Permutations l Number of k-element permutations l Number of permutations of a set of size n

L2 Supplementary Notes Page 19 K-th falling factorial

L2 Supplementary Notes Page 20

L2 Supplementary Notes Page 21 k-element subsets/k-elemen permutations

L2 Supplementary Notes Page 22 k-element subsets/k-elemen permutations

L2 Supplementary Notes Page 23

L2 Supplementary Notes Page 24 Summary l Number of increasing triples: l Number of 3-element subsets l Number of 3-element permutations l Number of k-element subsets l Number of k-element permutations

L2 Supplementary Notes Page 25 Assignment 2: Problem 9 l Exco Members: Year 1: 4; Year 2: 5; Year 3: 3 l Total number of members: 12 l Choose 6 from 12

L2 Supplementary Notes Page 26 Assignment 2: Problem 9 l Exco Members: Year 1: 4; Year 2: 5; Year 3: 3 l Number of ways to choose Treasury Subcommittee n 12 choose 3 l Number of ways to choose Events Subcommittee n 9 choose 3

L2 Supplementary Notes Page 27 Assignment 2: Problem 9 l Exco Members: Year 1: 4; Year 2: 5; Year 3: 3 l Number of ways to choose Treasury Subcommittee l Number of ways to choose Events Subcommittee n 9 choose 3 l Answer

L2 Supplementary Notes Page 28 Assignment 2: Problem 9 l Exco Members: Year 1: 4; Year 2: 5; Year 3: 3 l “At least” makes things complex.

L2 Supplementary Notes

Wrong Answer l First choose 1 from each year l Then pick 3 from remaining 9 members l Answer

L2 Supplementary Notes Wrong Answer l First choose 1 from each year n Anthony (Y1), Mike (Y2), William (Y3) l Then pick 3 from remaining 9 members n Billy (Y1), Calvin(Y1), David (Y1), l Committee n Anthony (Y1), Billy (Y1), Calvin(Y1), David (Y1), Mike (Y2), William (Y3)

L2 Supplementary Notes Wrong Answer l First choose 1 from each year n Billy (Y1), Mike (Y2), William (Y3) l Then pick 3 from remaining 9 members n Anthony (Y1), Calvin(Y1), David (Y1), l Same Committee as before n Anthony (Y1), Billy (Y1), Calvin(Y1), David (Y1), Mike (Y2), William (Y3) l The same committee counted twice. n Not a bijection