Discrete Mathematics with Applications MATH236

Size: px
Start display at page:

Download "Discrete Mathematics with Applications MATH236"

Transcription

1 Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet (UKZN MATH236 Semester 1, / 27

2 Table of contents 1 Permutations 2 Counting permutations 3 Combinations Tong-Viet (UKZN MATH236 Semester 1, / 27

3 Permutations Inverses of Permutations To find the inverse of a permutation interchange the top and bottom rows of the matrix Re-order (if necessary the elements in the new first row The inverse of ( is Tong-Viet (UKZN MATH236 Semester 1, / 27

4 Permutations Inverses of permutation ( Reordering the top row into ascending order, we obtain: ( Tong-Viet (UKZN MATH236 Semester 1, / 27

5 Permutations Multiplication of permutations Let and Then g f is f = g = g f = ( ( ( Tong-Viet (UKZN MATH236 Semester 1, / 27

6 Power of permutations Permutations Let Then f 2 = f f is ( f f = f = ( ( = ( A nontrivial permutation f is called an involution if f = f 1 or equivalently f 2 = 1 Tong-Viet (UKZN MATH236 Semester 1, / 27

7 Counting permutations Counting permutations We consider how to count permutations and similar mathematical objects How many permutations of the set S = {a, b, c} are there? Tong-Viet (UKZN MATH236 Semester 1, / 27

8 Counting permutations Counting permutations (cont. Think of each permutation on S as a 3-tuple (f (a, f (b, f (c The question then becomes: How many such 3-tuples are there? Notice that all the values f (a, f (b and f (c are pairwise disjoint since f is one-to-one First of all, f (a can take any values on {a, b, c} For each choice of f (a, there are only two choices left for f (b Finally, for each choice of f (b, there is only one possibility for f (c By the Multiplication Principle, the total number of such 3-tuples is = 6 Tong-Viet (UKZN MATH236 Semester 1, / 27

9 Counting permutations Factorial Definition Let n be a positive integer. The n factorial function is the function with the rule 0! = 1 and for n 1, n! = (n 1 n Tong-Viet (UKZN MATH236 Semester 1, / 27

10 Counting permutations How many permutations of an n-set are there? An n-set is a set containing n elements Suppose that the elements of the n-set are x 1, x 2,, x n We consider each permutation to be an n-tuple (f (x 1, f (x 2,, f (x n We have n choices for f (x 1 Once we re chosen f (x 1, there are (n 1 possible choices for f (x 2 there are (n 2 choices for f (x 3 and so on. So, the number of permutations of an n-set is n(n 1(n = n! Tong-Viet (UKZN MATH236 Semester 1, / 27

11 Counting permutations The number of k-tuples How many k-tuples can be chosen from an n-set if repetition of elements is not allowed? We consider the k-tuple (x 1, x 2,, x k There are n possible choices for the first position Once we ve chosen x 1, there are n 1 choices for x 2 Once we ve chosen x 2, there are (n 2 choices for x 3 When we reach the kth position, there are n (k 1 = n k + 1 possibilities By the Multiplication Principle, the number of such k-tuples is thus n(n 1(n 2 (n k + 2(n k + 1 Tong-Viet (UKZN MATH236 Semester 1, / 27

12 Counting permutations There are = tuples from a set of 6-elements Definition Let n and k be positive integers with 1 k n. The expression (n k = n(n 1(n 2 (n k + 1 = The quantity (n k is called a falling factorial n! (n k! Tong-Viet (UKZN MATH236 Semester 1, / 27

13 Counting permutations Number of words How many six-letter words can be formed from the letters a, b, c, d, e, f, g, h, i, where each letter can be used only once? Each word corresponds to a 6-tuple The question becomes: How many 6-tuples can be formed from a set of 9 elements The answer is (9 6 = 9! (9 6! = Tong-Viet (UKZN MATH236 Semester 1, / 27

14 Counting permutations In how many ways can a President, Vice President and Secretary be elected from a group of 15 peple? We need to know how many 3-tuples of the form (President, Vice-President, Secretary there are The answer is (15 3 = 15! (15 3! = 2730 Tong-Viet (UKZN MATH236 Semester 1, / 27

15 Counting permutations In how many different ways can the 26 letters of the alphabet be arranged so that no two of the vowels a, e, i, o, u occur in consecutive positions? There are 21 consonants Firstly, ignoring all the vowels There are 21! ways of arranging the consonants Tong-Viet (UKZN MATH236 Semester 1, / 27

16 Counting permutations Once we re arranged the consonants, we must place the vowels in the 22 holes between, before and after the consonants Also, whichever hole we place one vowel in, we cannot place any of the others in the same hole Thus, once the consonants have been arranged, there are (22 5 ways of distributing the vowels. By the Multiplication Principle, the number of ways of arranging all the letters is 21!(22 5 = 21! 22! 17! Tong-Viet (UKZN MATH236 Semester 1, / 27

17 Combinations Combinations Definition Let n, k be nonnegative integers with k n. We define n choose k to be the quantity ( n = k n! (n k!k! = (n k k! The quantity ( n k is also called a binomial coefficient. ( 6 = 4 6! (6 4!4! = 15 Tong-Viet (UKZN MATH236 Semester 1, / 27

18 Combinations ( n 0 = n! n!0! ( = 1 n 1 = n! (n 1!1! = n = n! ( n 2 ( n n 1 ( n n (n 2!2! = n(n 1 2 = n! 1!(n 1! = n = n! 0!n! = 1 Tong-Viet (UKZN MATH236 Semester 1, / 27

19 Binomial equality Combinations Theorem Let n, k be nonnegative integers with k n. Then ( ( n n = k n k Proof. ( n = k = n! (n k!k! = n! n! (n (n k!(n k! = (n k!(n (n k! ( n n k Tong-Viet (UKZN MATH236 Semester 1, / 27

20 Combinations Binomial Binomial coefficients play several important roles in mathematics Recall that a k-subset is a subset of cardinality k Let T (n, k be the set of all k-tuples chosen from the set {1, 2,, n} Let S(n, k be the set of all k-subsets of {1, 2,, n} Define the function f : T (n, k S(n, k by f ((x 1, x 2,, x k = {x 1, x 2,, x k } Tong-Viet (UKZN MATH236 Semester 1, / 27

21 Combinations The number of k subsets of an n-set Theorem Let n, k be nonnegative integers with k n. The number of k-subsets of an n-set is ( n k. Proof. Notice that for each k-subet S of S(n, k, there are exactly k! k-tuples T with f (T = S It follows that We know that T (n, k = (n k The result follows. T (n, k = k! S(n, k Tong-Viet (UKZN MATH236 Semester 1, / 27

22 Combinations In how many different ways can three representatives be chosen from a group of 15 people? As the 3-tuple (Paul, Tom, Adam is the same as (Tom, Adam, Paul The three representatives are unordered and thus this is a subset rather than a tuple Thus the answer is ( 15 3 = 455. Tong-Viet (UKZN MATH236 Semester 1, / 27

23 Pascal s Identity Combinations Theorem Let n, k be positive integers with k n 1. Then ( ( ( n n 1 n 1 = +. k k 1 k Proof. We use a combinatorial proof Let N be the number of k-subsets of of the set S = {1, 2,, n}. We know from previous theorem that N = ( n k Tong-Viet (UKZN MATH236 Semester 1, / 27

24 Pascal s Identity (cont Combinations Proof. We now count the number of k-subsets of S in a different way Let N 1 be the number of k-subsets of S that always contain the number 1 Let N 2 be the number of k-subsets of S that always do not contain the number 1 Clearly N = N 1 + N 2 Now each set that contributes to N 1 contains the number 1 and k 1 other elements chosen from the (n 1-set {2, 3,, n} Hence N 1 = ( n 1 k 1 Tong-Viet (UKZN MATH236 Semester 1, / 27

25 Pascal s Identity (cont. Combinations Proof. Each subset that contributes to N 2 does not contain 1, so it is a set of k-elements chosen from the (n 1-set {2, 3,, n}. Thus, N 2 = ( n 1 k Therefore, ( ( n 1 n 1 N = + k 1 k Tong-Viet (UKZN MATH236 Semester 1, / 27

26 Combinations The number of subsets of a set Theorem Let n be a nonnegative integer. Then ( ( ( n n n = 2 n. 0 1 n Proof. If n = 0, then both sides equal 1, so we assume that n 1. We use a combinatorial proof again. Consider the set S = {1, 2,, n} Let N be the number of subsets of S. Tong-Viet (UKZN MATH236 Semester 1, / 27

27 Proof Combinations Proof. We know that N = 2 n We now determine N in a different way For each k {0, 1, 2,, n} denote by N k the number of k-subsets of S N = N 0 + N N n We know that N k = S(n, k = ( n k Thus ( ( n n N = ( n n Tong-Viet (UKZN MATH236 Semester 1, / 27

Math236 Discrete Maths with Applications

Math236 Discrete Maths with Applications Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,

More information

Week 3-4: Permutations and Combinations

Week 3-4: Permutations and Combinations Week 3-4: Permutations and Combinations February 20, 2017 1 Two Counting Principles Addition Principle. Let S 1, S 2,..., S m be disjoint subsets of a finite set S. If S = S 1 S 2 S m, then S = S 1 + S

More information

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n

The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n ways to do the first task and n Chapter 5 Chapter Summary 5.1 The Basics of Counting 5.2 The Pigeonhole Principle 5.3 Permutations and Combinations 5.5 Generalized Permutations and Combinations Section 5.1 The Product Rule The Product

More information

Section Summary. Permutations Combinations Combinatorial Proofs

Section Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement

More information

Permutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014

Permutations and Combinations. MATH 107: Finite Mathematics University of Louisville. March 3, 2014 Permutations and Combinations MATH 107: Finite Mathematics University of Louisville March 3, 2014 Multiplicative review Non-replacement counting questions 2 / 15 Building strings without repetition A familiar

More information

Permutations and Combinations

Permutations and Combinations Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;

More information

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1:

Block 1 - Sets and Basic Combinatorics. Main Topics in Block 1: Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.

More information

DISCRETE STRUCTURES COUNTING

DISCRETE STRUCTURES COUNTING DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the

More information

Mathematical Foundations of Computer Science Lecture Outline August 30, 2018

Mathematical Foundations of Computer Science Lecture Outline August 30, 2018 Mathematical Foundations of omputer Science Lecture Outline ugust 30, 2018 ounting ounting is a part of combinatorics, an area of mathematics which is concerned with the arrangement of objects of a set

More information

Sec$on Summary. Permutations Combinations Combinatorial Proofs

Sec$on Summary. Permutations Combinations Combinatorial Proofs Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?

More information

Jong C. Park Computer Science Division, KAIST

Jong C. Park Computer Science Division, KAIST Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients

More information

Topics to be covered

Topics to be covered Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle

More information

Counting. Chapter 6. With Question/Answer Animations

Counting. Chapter 6. With Question/Answer Animations . All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter

More information

Reading 14 : Counting

Reading 14 : Counting CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality

More information

Introductory Probability

Introductory Probability Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts

More information

Discrete Structures Lecture Permutations and Combinations

Discrete Structures Lecture Permutations and Combinations Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these

More information

MAT 115: Finite Math for Computer Science Problem Set 5

MAT 115: Finite Math for Computer Science Problem Set 5 MAT 115: Finite Math for Computer Science Problem Set 5 Out: 04/10/2017 Due: 04/17/2017 Instructions: I leave plenty of space on each page for your computation. If you need more sheet, please attach your

More information

7.4 Permutations and Combinations

7.4 Permutations and Combinations 7.4 Permutations and Combinations The multiplication principle discussed in the preceding section can be used to develop two additional counting devices that are extremely useful in more complicated counting

More information

Chapter 6.1. Cycles in Permutations

Chapter 6.1. Cycles in Permutations Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line

More information

Math 3012 Applied Combinatorics Lecture 2

Math 3012 Applied Combinatorics Lecture 2 August 20, 2015 Math 3012 Applied Combinatorics Lecture 2 William T. Trotter trotter@math.gatech.edu The Road Ahead Alert The next two to three lectures will be an integrated approach to material from

More information

Elementary Combinatorics

Elementary Combinatorics 184 DISCRETE MATHEMATICAL STRUCTURES 7 Elementary Combinatorics 7.1 INTRODUCTION Combinatorics deals with counting and enumeration of specified objects, patterns or designs. Techniques of counting are

More information

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017

MAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017 MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa

More information

With Question/Answer Animations. Chapter 6

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

More information

Math 42, Discrete Mathematics

Math 42, Discrete Mathematics c Fall 2018 last updated 10/29/2018 at 18:22:13 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,

More information

MA 524 Midterm Solutions October 16, 2018

MA 524 Midterm Solutions October 16, 2018 MA 524 Midterm Solutions October 16, 2018 1. (a) Let a n be the number of ordered tuples (a, b, c, d) of integers satisfying 0 a < b c < d n. Find a closed formula for a n, as well as its ordinary generating

More information

Sec 5.1 The Basics of Counting

Sec 5.1 The Basics of Counting 1 Sec 5.1 The Basics of Counting Combinatorics, the study of arrangements of objects, is an important part of discrete mathematics. In this chapter, we will learn basic techniques of counting which has

More information

JIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers.

JIGSAW ACTIVITY, TASK # Make sure your answer in written in the correct order. Highest powers of x should come first, down to the lowest powers. JIGSAW ACTIVITY, TASK #1 Your job is to multiply and find all the terms in ( 1) Recall that this means ( + 1)( + 1)( + 1)( + 1) Start by multiplying: ( + 1)( + 1) x x x x. x. + 4 x x. Write your answer

More information

Some Fine Combinatorics

Some Fine Combinatorics Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion

More information

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Math 22 Fall 2017 Homework 2 Drew Armstrong Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Section 1.2, Exercises 5, 7, 13, 16. Section 1.3, Exercises,

More information

Mat 344F challenge set #2 Solutions

Mat 344F challenge set #2 Solutions Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This

More information

50 Counting Questions

50 Counting Questions 50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,

More information

Counting and Probability Math 2320

Counting and Probability Math 2320 Counting and Probability Math 2320 For a finite set A, the number of elements of A is denoted by A. We have two important rules for counting. 1. Union rule: Let A and B be two finite sets. Then A B = A

More information

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b

11.3B Warmup. 1. Expand: 2x. 2. Express the expansion of 2x. using combinations. 3. Simplify: a 2b a 2b 11.3 Warmup 1. Expand: 2x y 4 2. Express the expansion of 2x y 4 using combinations. 3 3 3. Simplify: a 2b a 2b 4. How many terms are there in the expansion of 2x y 15? 5. What would the 10 th term in

More information

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza

Probability Theory. Mohamed I. Riffi. Islamic University of Gaza Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)

More information

Lecture 1. Permutations and combinations, Pascal s triangle, learning to count

Lecture 1. Permutations and combinations, Pascal s triangle, learning to count 18.440: Lecture 1 Permutations and combinations, Pascal s triangle, learning to count Scott Sheffield MIT 1 Outline Remark, just for fun Permutations Counting tricks Binomial coefficients Problems 2 Outline

More information

Combinatorics and Intuitive Probability

Combinatorics and Intuitive Probability Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the

More information

November 6, Chapter 8: Probability: The Mathematics of Chance

November 6, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern

More information

X = {1, 2,...,n} n 1f 2f 3f... nf

X = {1, 2,...,n} n 1f 2f 3f... nf Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.

More information

Mathematics. (www.tiwariacademy.com) (Chapter 7) (Permutations and Combinations) (Class XI) Exercise 7.3

Mathematics. (www.tiwariacademy.com) (Chapter 7) (Permutations and Combinations) (Class XI) Exercise 7.3 Question 1: Mathematics () Exercise 7.3 How many 3-digit numbers can be formed by using the digits 1 to 9 if no digit is repeated? Answer 1: 3-digit numbers have to be formed using the digits 1 to 9. Here,

More information

Finite Math - Fall 2016

Finite Math - Fall 2016 Finite Math - Fall 206 Lecture Notes - /28/206 Section 7.4 - Permutations and Combinations There are often situations in which we have to multiply many consecutive numbers together, for example, in examples

More information

Chapter 2. Permutations and Combinations

Chapter 2. Permutations and Combinations 2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find

More information

Lecture 18 - Counting

Lecture 18 - Counting Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program

More information

COUNTING AND PROBABILITY

COUNTING AND PROBABILITY CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility

More information

Lecture 2: Sum rule, partition method, difference method, bijection method, product rules

Lecture 2: Sum rule, partition method, difference method, bijection method, product rules Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers

More information

Lecture 14. What s to come? Probability. A bag contains:

Lecture 14. What s to come? Probability. A bag contains: Lecture 14 What s to come? Probability. A bag contains: What is the chance that a ball taken from the bag is blue? Count blue. Count total. Divide. Today: Counting! Later: Probability. Professor Walrand.

More information

Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting

Discrete Mathematics: Logic. Discrete Mathematics: Lecture 15: Counting Discrete Mathematics: Logic Discrete Mathematics: Lecture 15: Counting counting combinatorics: the study of the number of ways to put things together into various combinations basic counting principles

More information

An Elementary Solution to the Ménage Problem

An Elementary Solution to the Ménage Problem An Elementary Solution to the Ménage Problem Amanda F Passmore April 14, 2005 1 Introduction The ménage problem asks for the number of ways to seat n husbands and n wives at a circular table with alternating

More information

With Question/Answer Animations. Chapter 6

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

More information

Counting in Algorithms

Counting in Algorithms Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different

More information

Multiple Choice Questions for Review

Multiple Choice Questions for Review Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send

More information

Lecture 2.3: Symmetric and alternating groups

Lecture 2.3: Symmetric and alternating groups Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

More information

Dyck paths, standard Young tableaux, and pattern avoiding permutations

Dyck paths, standard Young tableaux, and pattern avoiding permutations PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:

More information

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University

More information

Week 1: Probability models and counting

Week 1: Probability models and counting Week 1: Probability models and counting Part 1: Probability model Probability theory is the mathematical toolbox to describe phenomena or experiments where randomness occur. To have a probability model

More information

Week 6: Advance applications of the PIE. 17 and 19 of October, 2018

Week 6: Advance applications of the PIE. 17 and 19 of October, 2018 (1/22) MA284 : Discrete Mathematics Week 6: Advance applications of the PIE http://www.maths.nuigalway.ie/ niall/ma284 17 and 19 of October, 2018 1 Stars and bars 2 Non-negative integer inequalities 3

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6 CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3

More information

Inversions on Permutations Avoiding Consecutive Patterns

Inversions on Permutations Avoiding Consecutive Patterns Inversions on Permutations Avoiding Consecutive Patterns Naiomi Cameron* 1 Kendra Killpatrick 2 12th International Permutation Patterns Conference 1 Lewis & Clark College 2 Pepperdine University July 11,

More information

Principle of Inclusion-Exclusion Notes

Principle of Inclusion-Exclusion Notes Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.

More information

Permutations. = f 1 f = I A

Permutations. = f 1 f = I A Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has

More information

CSCI FOUNDATIONS OF COMPUTER SCIENCE

CSCI FOUNDATIONS OF COMPUTER SCIENCE 1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 April 2, 2015 2 Announcements Homework 6 is due next Monday, April 6 at 10am in class. Homework 6 ClarificaMon In Problem 2C, where you need to

More information

The Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University

The Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University The Art of Counting Bijections, Double Counting Peng Shi Department of Mathematics Duke University September 16, 2009 What we focus on in this talk? Enumerative combinatorics is a huge branch of mathematics,

More information

CSE 21 Math for Algorithms and Systems Analysis. Lecture 2 Lists Without Repe>>on

CSE 21 Math for Algorithms and Systems Analysis. Lecture 2 Lists Without Repe>>on CSE 21 Math for Algorithms and Systems Analysis Lecture 2 Lists Without Repe>>on Review of Last Lecture Sets and Lists Sets are unordered collec>on Lists are ordered collec>ons Rule of product # of lists

More information

CS70: Lecture Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion

CS70: Lecture Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion CS70: Lecture 18. 1. Review. 2. Stars/Bars. 3. Balls in Bins. 4. Addition Rules. 5. Combinatorial Proofs. 6. Inclusion/Exclusion The rules! First rule: n 1 n 2 n 3. Product Rule. k Samples with replacement

More information

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r.

10-1. Combinations. Vocabulary. Lesson. Mental Math. able to compute the number of subsets of size r. Chapter 10 Lesson 10-1 Combinations BIG IDEA With a set of n elements, it is often useful to be able to compute the number of subsets of size r Vocabulary combination number of combinations of n things

More information

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations

More information

CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)

CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) CS1802 Discrete Structures Recitation Fall 2018 September 25-26, 2018 CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) Permutations and Combinations i. Evaluate the following expressions. 1. P(10, 4)

More information

Name: Exam I. February 5, 2015

Name: Exam I. February 5, 2015 Department of Mathematics University of Notre Dame Math 10120 Finite Math Spring 201 Name: Instructors: Garbett & Migliore Exam I February, 201 This exam is in two parts on 10 pages and contains 1 problems

More information

Generating indecomposable permutations

Generating indecomposable permutations Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received

More information

A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs

A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs Journal of Combinatorial Theory, Series A 90, 293303 (2000) doi:10.1006jcta.1999.3040, available online at http:www.idealibrary.com on A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations

More information

Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set

Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) Gazihan Alankuş (Based on original slides by Brahim Hnich

More information

Strings. A string is a list of symbols in a particular order.

Strings. A string is a list of symbols in a particular order. Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a

More information

Mathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170

Mathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170 2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag

More information

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)

2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC) 2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are

More information

Combinatorics in the group of parity alternating permutations

Combinatorics in the group of parity alternating permutations Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of

More information

n! = n(n 1)(n 2) 3 2 1

n! = n(n 1)(n 2) 3 2 1 A Counting A.1 First principles If the sample space Ω is finite and the outomes are equally likely, then the probability measure is given by P(E) = E / Ω where E denotes the number of outcomes in the event

More information

There are three types of mathematicians. Those who can count and those who can t.

There are three types of mathematicians. Those who can count and those who can t. 1 Counting There are three types of mathematicians. Those who can count and those who can t. 1.1 Orderings The details of the question always matter. So always take a second look at what is being asked

More information

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}?

Exercises Exercises. 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? Exercises Exercises 1. List all the permutations of {a, b, c}. 2. How many different permutations are there of the set {a, b, c, d, e, f, g}? 3. How many permutations of {a, b, c, d, e, f, g} end with

More information

Axiomatic Probability

Axiomatic Probability Axiomatic Probability The objective of probability is to assign to each event A a number P(A), called the probability of the event A, which will give a precise measure of the chance thtat A will occur.

More information

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined

More information

CSE 21 Mathematics for Algorithm and System Analysis

CSE 21 Mathematics for Algorithm and System Analysis CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on

More information

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 3 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 3 Notes Goal for today: CL Section 3 Subsets,

More information

Permutations (Part A)

Permutations (Part A) Permutations (Part A) A permutation problem involves counting the number of ways to select some objects out of a group. 1 There are THREE requirements for a permutation. 2 Permutation Requirements 1. The

More information

Permutations and Combinations

Permutations and Combinations Motivating question Permutations and Combinations A) Rosen, Chapter 5.3 B) C) D) Permutations A permutation of a set of distinct objects is an ordered arrangement of these objects. : (1, 3, 2, 4) is a

More information

Slide 1 Math 1520, Lecture 13

Slide 1 Math 1520, Lecture 13 Slide 1 Math 1520, Lecture 13 In chapter 7, we discuss background leading up to probability. Probability is one of the most commonly used pieces of mathematics in the world. Understanding the basic concepts

More information

Unit 5 Radical Functions & Combinatorics

Unit 5 Radical Functions & Combinatorics 1 Graph of y Unit 5 Radical Functions & Combinatorics x: Characteristics: Ex) Use your knowledge of the graph of y x and transformations to sketch the graph of each of the following. a) y x 5 3 b) f (

More information

Lesson1.notebook July 07, 2013

Lesson1.notebook July 07, 2013 Lesson1.notebook July 07, 2013 Topic: Counting Principles Today's Learning goal: I can use tree diagrams, Fundamental counting principle and indirect methods to determine the number of outcomes. Tree Diagram

More information

PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES

PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed

More information

POKER (AN INTRODUCTION TO COUNTING)

POKER (AN INTRODUCTION TO COUNTING) POKER (AN INTRODUCTION TO COUNTING) LAMC INTERMEDIATE GROUP - 10/27/13 If you want to be a succesful poker player the first thing you need to do is learn combinatorics! Today we are going to count poker

More information

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12

Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are

More information

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining

More information

Counting Snakes, Differentiating the Tangent Function, and Investigating the Bernoulli-Euler Triangle by Harold Reiter

Counting Snakes, Differentiating the Tangent Function, and Investigating the Bernoulli-Euler Triangle by Harold Reiter Counting Snakes, Differentiating the Tangent Function, and Investigating the Bernoulli-Euler Triangle by Harold Reiter In this paper we will examine three apparently unrelated mathematical objects One

More information

Compound Probability. Set Theory. Basic Definitions

Compound Probability. Set Theory. Basic Definitions Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic

More information

Generalized Permutations and The Multinomial Theorem

Generalized Permutations and The Multinomial Theorem Generalized Permutations and The Multinomial Theorem 1 / 19 Overview The Binomial Theorem Generalized Permutations The Multinomial Theorem Circular and Ring Permutations 2 / 19 Outline The Binomial Theorem

More information

Discrete mathematics

Discrete mathematics Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many

More information

ACTIVITY 6.7 Selecting and Rearranging Things

ACTIVITY 6.7 Selecting and Rearranging Things ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize

More information

Permutation group and determinants. (Dated: September 19, 2018)

Permutation group and determinants. (Dated: September 19, 2018) Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter

More information

Chapter 1. Probability

Chapter 1. Probability Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.

More information

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As

More information

Pattern Avoidance in Unimodal and V-unimodal Permutations

Pattern Avoidance in Unimodal and V-unimodal Permutations Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is

More information