# NOTES ON COUNTING KARL PETERSEN

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 NOTES ON COUNTING KARL PETERSEN It is important to be able to count exactly the number of elements in any finite set. We will see many applications of counting as we proceed (number of Enigma plugboard arrangements, computer passwords of a certain form, telephone area codes, automobile license plates, binary strings of a certain length needed to encode uniquely each possible English message of a certain length, etc.). In this section we list some of the basic techniques that are helpful for counting even in complicated situations. Notation. If A is any set, we denote by A the number of elements in A. (If A is infinite, we write A =.) N = {1, 2,...} denotes the set of natural numbers. Remark. Thus A = n N if and only if A can be put in one-to-one correspondence with {1,..., n}, i.e., counted. In the foundations of mathematics, following Georg Cantor, one defines the concept of cardinal number as follows. Two sets A and B are said to have the same cardinal number if they can be put in one-to-one correspondence, i.e., if there is a one-to-one onto function f : A B. Then even some infinite sets can be seen to have the same or different cardinal numbers. For example, the set N = {1, 2,...} of natural numbers, the set Z = {..., 2, 1, 0, 1, 2, 3,...} of integers, and the set Q of rational numbers all have the same cardinal number they are all countable while the set R has a different (in fact larger) cardinal number than N and so is uncountable. A cardinal number is then an equivalence class under this concept of sameness. For example, 2 is the set of all sets that can be put in one-to-one correspondence with the set {, { }}. 1. Disjoint sets If A and B are disjoint sets, i.e., A B =, then A B = A + B. Example 1.1. If A = {2, 4, 8} and B = {1, 5, 11, 12}, then A B = = 7. 1

2 2 KARL PETERSEN Example 1.2. Here s a useful everyday example: If you have 8 shirts in the laundry and 2 in the drawer, then you have at least 10 shirts. 2. Cartesian products Recall that the Cartesian product A B of two sets A and B is the set of all ordered pairs with the first element from A and the second element from B: (1) A B = {(a,b) : a A,b B}. By repeating this construction we can build up the Cartesian product of n sets for any n 2: (2) Proposition 2.1. (3) A 1 A 2 A n = {(a 1,a 2,...a n ) : a 1 A 1,a 2 A 2,...a n A N }. A B = A B A 1 A 2 A n = A 1 A 2... A n. Example 2.1. How many words (arbitrary strings) are there on the 26 letters of the English alphabet consisting of a vowel followed by a consonant? Answer: 5 21 = 105. Example 2.2. A (cheap) combination lock has three independently turning wheels, each of which can be set in any one of 8 different positions. How many possible combinations are there? Answer: = 512. Example 2.3. How many license plate numbers can be made of three English letters followed by three digits? Answer: = 17, 576, 000. It is easy to see why Formula (2) is correct. Imagine n wheels on a spindle, like a combination lock, with n i possible settings for wheel number i,i = 1,...,n. For each of the n 1 settings of the first wheel, there are n 2 settings of the second, thus n 1 n 2 ways to set the first pair of wheels. For each of these settings of the first two wheels, there are n 3 ways to set the third wheel, hence n 1 n 2 n 3 ways to set the third, and so on.

3 NOTES ON COUNTING 3 Exercise 2.1. Let L denote the number of license plate numbers that can be made of three English letters followed by four digits, and let N denote the number that can be made of four English letters followed by three digits. Find L/N without first computing L or N. Exercise 2.2. How many binary strings (words on the alphabet {0, 1}) are there of length 7? How many are there of length less than or equal to 7 (counting the empty word, which has length 0)? Exercise 2.3. A student shows up unprepared for a multiple-choice exam that has 10 questions with 4 possible answers for each one. The student takes random guesses on all the questions but gets a perfect score. How surprised should the student be? Exercise 2.4. How many functions are there from a set with 4 elements to a set with 7 elements? 3. Permutations A permutation of a set A = {a 1,...,a n } is an ordering of that set. Remark 3.1. Note that by definition the elements of any set are distinct. Thus there is no such set as {1, 1, 2}. Note also that the the set {1, 2, 3} is the same as the set {2, 3, 1}. Example 3.1. If A = {a,b,c}, then abc and bac are two different permutations of A. Example 3.2. Permutations of {1,...,n} correspond to one-to-one onto functions π : {1,...,n} {1,...,n}. To any such function π let correspond the ordering π(1)...π(n). And given a permutation i 1...i n of {1,...,n}, for each j = 1,...,n define π(j) = i j. Proposition 3.1. The number of permutations of any set with n elements is n! = n(n 1) 2 1. (1! = 1, 0! = 1.) Proof. There are n choices for the first element in the ordering, and for each choice of the first element there are n 1 choices for the second, hence there are n(n 1) ways to choose the first two elements. Then for each of the choices of the first two elements, there are n 2 ways to choose the third, and so on. Example 3.3. The three (different) scramblers of an Enigma machine can be placed into their three slots in 3! = = 6 ways. The 6 arrangements are:

4 4 KARL PETERSEN An n-set is any set with n elements. Definition 3.1. An r-permutation of an n-set (n,r N, 0 r n) is an ordering of an r-element subset of the n-set. Example 3.4. Let A = {1, 2, 3} be a set with n = 3 elements, and let r = 2. Then the 2-permutations of A are Proposition 3.2. The number of r-permutations of an n-set is (4) P(n,r) = n(n 1) (n r + 1). Proof. The proof is the same as for Proposition 3.1. Example 3.5. The senior class wants to choose a president, vice president, and secretary from among its 4000 members. How many ways are there to do this (assuming no person can serve simultaneously in two positions)? Answer: ways. Exercise 3.1. A weekly bridge group decides it should get organized by having each member serve either as scheduler, food provider, treasurer, or scorekeeper, and that in order to even out the workloads they should have a new arrangement every month. How long can this four-member group keep this up without repeating an arrangement? Exercise 3.2. How many 4-letter words (arbitrary strings) are there on the 26 letters of the English alphabet? How many are there which use 4 different letters? Exercise 3.3. A baseball team has 17 players. How many ways are there to choose a starting lineup of 9 players plus determine the order in which they will bat? How many ways are there to do this and in addition assign to each player one of the 9 defensive positions (catcher, pitcher, first base, etc.)? 4. Subsets (Combinations) By an r-subset of a set A we mean any set B A such that B = r, i.e., B has r elements. Notice that the elements of any r-subset are unordered, as they are for any set. Proposition 4.1. Let n,r N with 0 r n. The number of r-subsets of a set with n elements is ( ) n n! (5) C(n,r) = = r r!(n r)!.

5 NOTES ON COUNTING 5 Proof. We sneak up on the result counting the r-subsets of a set A with n elements by counting instead, in a different way than before, the number P(n,r) of r-permutations of A. We know already that P(n,r) = n(n 1) (n r + 1). But each r-permutation of A is formed by first selecting an r-subset of A (there are C(n,r) ways to make this choice) and then ordering that particular r-element subset (there are r! ways to do this). Therefore (6) P(n,r) = C(n,r) r!, and hence (7) C(n,r) = n! r!(n r)!. Example 4.1. The number of 2-subsets of a 4-set is 4!/(2!2!) = 6. If the 4-set is A = {1, 2, 3, 4}, then these 2-subsets are {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}. Note that each of them can be ordered in r! = 2 ways, leading to 6 2 = P(4, 2) = permutations of A. C(n,r) = ( n r) is sometimes read n choose r, since it gives the number of ways to choose an unordered set of r objects from a pool of n. These numbers are also known as binomial coefficients, because of the following Proposition. Proposition 4.2. For any n N and any a, b R, n (8) (a + b) n = C(n,r)a r b n r. r=0 The binomial coefficients have many fascinating properties, the most basic of which is the Pascal Identity: Proposition 4.3. Let n,k N with k n. Then (9) C(n + 1,k) = C(n,k 1) + C(n,k). Proof. This equation can be checked easily by calculation, using the definition of C(n,k) as a quotient of factorials. But the following combinatorial proof can give more insight into the idea behind the identity.

6 6 KARL PETERSEN Let A be a set with n + 1 elements, fix a particular a A, and let B = A \ {a}, so that B consists of all elements of A except a, and B = n. We want to count the k-element subsets of A. These fall into two disjoint classes, the ones that contain a and the ones that don t contain a. The ones that contain a are obtained by choosing a (k 1)-element subset of B there are C(n,k 1) ways to do this and then adding a to it. The ones that do not contain a are obtained by choosing a k-element subset of B and there are C(n,k) ways to do this. This relation leads to the familiar and fascinating Pascal Triangle, in which each entry is the sum of the two immediately above it and the n th row lists the coefficients in the expansion of (a + b) n : Exercise 4.1. From a basketball team consisting of 12 players, how many ways are there to select a starting lineup consisting of five players? How many ways are there to select a starting lineup of five, if each player is assigned a different position center, power forward, small forward, shooting guard, or point guard? Exercise 4.2. How many binary strings of length seven have exactly three 0 s? Exercise 4.3. An intramural basketball team consists of four women and six men. The games are four on four. How many ways are there to pick a starting lineup that includes at least one man and at least one woman? Exercise 4.4. An Enigma machine plugboard joins up 6 different pairs of the 26 letters. (For example a is joined to x, k to r, m to t, o to v, q to y, and s to z.) How many different plugboard settings are there? Exercise 4.5. How many license plates that have three letters followed by three digits use no letter or digit twice?

7 NOTES ON COUNTING 7 Exercise 4.6. From a Congressional committee consisting of 13 Republicans and 12 Democrats it is necessary to choose a subcommittee of 4 Republicans and 3 Democrats. How many possibilities are there? Exercise 4.7. Construct a combinatorial argument to prove that if k,r,n N with k r n, then C(n,r)C(r,k) = C(n,k)C(n k,r k). 5. A Few More Counting Principles 5.1. Inclusion-Exclusion. (10) A 1 A 2 = A 1 + A 2 A 1 A 2. This is because when we add A 1 and A 2, the elements that are in both sets, i.e. in A 1 A 2, are counted in twice. (11) A 1 A 2 A 3 = A 1 + A 2 + A 3 ( A 1 A 2 + A 1 A 3 + A 2 A 3 ) + A 1 A 2 A 3. This is because in forming A 1 + A 2 + A 3 the elements that are in more than one of the sets A i are counted in either twice, if they are in exactly two of these sets, or three times if they are in all three sets. Subtracting off A 1 A 2 + A 1 A 3 + A 2 A 3 ) accomplishes the correction for elements that are in exactly two of the sets, since it subtracts off the extra 1 for each of them. But this term subtracts off 3 for each element that is in all 3 sets, so the cardinality of A 1 A 2 A 3 has to be added back in. A similar formula applies to the cardinality of the union of n sets for any n N. Example 5.1. Let s determine how many words (arbitrary strings) of length 6 on the 26 English letters either start with a or end with ed. The number starting with a is the number of arbitrary 5-letter words which can be appended to the initial a, namely The number that end with ed is And the number that start with a and end with ed is So the answer is Exercise 5.1. How many functions are there from {1, 2,...,n} to {0, 1} which assign 0 to either 1 or n?

8 8 KARL PETERSEN 5.2. Counting the complement. Sometimes it is easier to count the number of elements that are not in a set A and then subtract from the total number to find out how many are in A. Example 5.2. How many binary strings of length 10 contain at least one 1? Well, there are 2 10 binary strings of length 10 and only one (all 0 s) that does not contain any 1 s, so the answer is Exercise 5.2. How many strings of 3 decimal digits do not contain the same digit 3 times? Exercise 5.3. How many strings of 8 decimal digits contain a repeated digit? 5.3. The Pigeonhole Principle. This principle is so obvious that it hardly seems worth talking about: Pigeonhole Principle. If n + 1 objects are placed into n boxes (or pigeonholes see the array next to the elevator on the third floor of Phillips Hall), then at least one of the boxes has to contain at least two of the objects. Example 5.3. How many strings of 12 decimal digits contain a repeated digit? Answer: All of them. Think of each of the 12 places in the string as an object which is placed into one of the boxes 0,1,2,3,4,5,6,7,8,9 according to the entry in the string at that place. Since 12 > 10, at least two of the 12 objects have to end up in the same box. Exercise 5.4. Early one morning you are groping in the dark in a drawer full of unpaired blue and black socks. How many do you have to pull out in order to be certain that you have two that match? Exercise 5.5. Six people are stranded on an island. Each pair of the six consists either of two allies or two enemies. Show that there must exist either a clique of three mutual allies or a set of three mutual enemies. Exercise 5.6. For each real number x, denote by x the greatest integer less than or equal to x, by (x) = x x the fractional part of x, and by d(x, Z) the distance from x to the nearest integer. Let N N, and let α be any irrational number. Show that there is q N with q N such that d(qα, Z) < 1/N. Hint: Consider the objects 0, (α), (2α),...(Nα) and the boxes {x : i/n x < (i + 1)/N},i = 0, 1,...,N 1.

### Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting

Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Colin Stirling Informatics Slides originally by Kousha Etessami Colin Stirling (Informatics) Discrete Mathematics (Chapter 6) Today 1 /

### 94 Counting Solutions for Chapter 3. Section 3.2

94 Counting 3.11 Solutions for Chapter 3 Section 3.2 1. Consider lists made from the letters T, H, E, O, R, Y, with repetition allowed. (a How many length-4 lists are there? Answer: 6 6 6 6 = 1296. (b

### Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Combinatorial Proofs

Combinatorial Proofs Two Counting Principles Some proofs concerning finite sets involve counting the number of elements of the sets, so we will look at the basics of counting. Addition Principle: If A

### It is not immediately obvious that this should even give an integer. Since 1 < 1 5

Math 163 - Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some

### Discrete Mathematics Lecture 5. Harper Langston New York University

Discrete Mathematics Lecture 5 Harper Langston New York University Empty Set S = {x R, x 2 = -1} X = {1, 3}, Y = {2, 4}, C = X Y (X and Y are disjoint) Empty set has no elements Empty set is a subset of

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 20

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Module 6: Basic Counting

Module 6: Basic Counting Theme 1: Basic Counting Principle We start with two basic counting principles, namely, the sum rule and the multiplication rule. The Sum Rule: If there are n 1 different objects

### Sets and Subsets. Countable and Uncountable

Sets and Subsets Countable and Uncountable Reading Appendix A Section A.6.8 Pages 788-792 BIG IDEAS Themes 1. There exist functions that cannot be computed in Java or any other computer language. 2. There

### If f is a 1-1 correspondence between A and B then it has an inverse, and f 1 isa 1-1 correspondence between B and A.

Chapter 5 Cardinality of sets 51 1-1 Correspondences A 1-1 correspondence between sets A and B is another name for a function f : A B that is 1-1 and onto If f is a 1-1 correspondence between A and B,

### Introductory Problems

Introductory Problems Today we will solve problems that involve counting and probability. Below are problems which introduce some of the concepts we will discuss.. At one of George Washington s parties,

### 1 Introduction. 2 Basic Principles. 2.1 Multiplication Rule. [Ch 9] Counting Methods. 400 lecture note #9

400 lecture note #9 [Ch 9] Counting Methods 1 Introduction In many discrete problems, we are confronted with the problem of counting. Here we develop tools which help us counting. Examples: o [9.1.2 (p.

### Solution, Assignment #6, CSE 191 Fall, 2014

Solution, Assignment #6, CSE 191 Fall, 2014 General Guidelines: This assignment will NOT be collected, nor graded. However, you should carefully complete it as if it were to be graded. There will be a

### SOLUTIONS, Homework 6

SOLUTIONS, Homework 6 1. Testing out the identities from Section 6.4. (a) Write out the numbers in the first nine rows of Pascal s triangle. 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1 1 6 15 20 15 6 1

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### 1.1 Logical Form and Logical Equivalence 1

Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic

### SECTION 10-5 Multiplication Principle, Permutations, and Combinations

10-5 Multiplication Principle, Permutations, and Combinations 761 54. Can you guess what the next two rows in Pascal s triangle, shown at right, are? Compare the numbers in the triangle with the binomial

### Discrete Mathematics: Homework 6 Due:

Discrete Mathematics: Homework 6 Due: 2011.05.20 1. (3%) How many bit strings are there of length six or less? We use the sum rule, adding the number of bit strings of each length to 6. If we include the

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### This chapter describes set theory, a mathematical theory that underlies all of modern mathematics.

Appendix A Set Theory This chapter describes set theory, a mathematical theory that underlies all of modern mathematics. A.1 Basic Definitions Definition A.1.1. A set is an unordered collection of elements.

### Discrete Mathematics and its Applications Counting (2) Xiaocong ZHOU

Discrete Mathematics and its Applications Counting (2) Xiaocong ZHOU Department of Computer Science Sun Yat-sen University Feb. 2016 http://www.cs.sysu.edu.cn/ zxc isszxc@mail.sysu.edu.cn Xiaocong ZHOU

### Section Summary. The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams

Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and Combinations Generating Permutations

### Math 408, Actuarial Statistics I, Spring 2008. Solutions to combinatorial problems

, Spring 2008 Word counting problems 1. Find the number of possible character passwords under the following restrictions: Note there are 26 letters in the alphabet. a All characters must be lower case

### Math 421: Probability and Statistics I Note Set 2

Math 421: Probability and Statistics I Note Set 2 Marcus Pendergrass September 13, 2013 4 Discrete Probability Discrete probability is concerned with situations in which you can essentially list all the

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### Discrete Structures for Computer Science: Counting, Recursion, and Probability

Discrete Structures for Computer Science: Counting, Recursion, and Probability Michiel Smid School of Computer Science Carleton University Ottawa, Ontario Canada michiel@scs.carleton.ca December 15, 2016

### 2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

### 1 Algebra - Partial Fractions

1 Algebra - Partial Fractions Definition 1.1 A polynomial P (x) in x is a function that may be written in the form P (x) a n x n + a n 1 x n 1 +... + a 1 x + a 0. a n 0 and n is the degree of the polynomial,

### Finite and Infinite Sets

Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following

### Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

### Arithmetic and Geometric Sequences

Arithmetic and Geometric Sequences Felix Lazebnik This collection of problems is for those who wish to learn about arithmetic and geometric sequences, or to those who wish to improve their understanding

### A1. Basic Reviews PERMUTATIONS and COMBINATIONS... or HOW TO COUNT

A1. Basic Reviews Appendix / A1. Basic Reviews / Perms & Combos-1 PERMUTATIONS and COMBINATIONS... or HOW TO COUNT Question 1: Suppose we wish to arrange n 5 people {a, b, c, d, e}, standing side by side,

### Sets and functions. {x R : x > 0}.

Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.

### A set is a Many that allows itself to be thought of as a One. (Georg Cantor)

Chapter 4 Set Theory A set is a Many that allows itself to be thought of as a One. (Georg Cantor) In the previous chapters, we have often encountered sets, for example, prime numbers form a set, domains

### OPERATIONS AND PROPERTIES

CHAPTER OPERATIONS AND PROPERTIES Jesse is fascinated by number relationships and often tries to find special mathematical properties of the five-digit number displayed on the odometer of his car. Today

Some Definitions about Sets Definition: Two sets are equal if they contain the same elements. I.e., sets A and B are equal if x[x A x B]. Notation: A = B. Recall: Sets are unordered and we do not distinguish

### SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

### ICS141: Discrete Mathematics for Computer Science I

ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by

### Lecture 2 : Basics of Probability Theory

Lecture 2 : Basics of Probability Theory When an experiment is performed, the realization of the experiment is an outcome in the sample space. If the experiment is performed a number of times, different

### Sets. A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object.

Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: real numbers, complex numbers, C integers, All students in

### 1 Introduction to Counting

1 Introduction to Counting 1.1 Introduction In this chapter you will learn the fundamentals of enumerative combinatorics, the branch of mathematics concerned with counting. While enumeration problems can

### Math/CSE 1019: Discrete Mathematics for Computer Science Fall Suprakash Datta

Math/CSE 1019: Discrete Mathematics for Computer Science Fall 2011 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/1019 1

### Calculus for Middle School Teachers. Problems and Notes for MTHT 466

Calculus for Middle School Teachers Problems and Notes for MTHT 466 Bonnie Saunders Fall 2010 1 I Infinity Week 1 How big is Infinity? Problem of the Week: The Chess Board Problem There once was a humble

### Basics of Counting. The product rule. Product rule example. 22C:19, Chapter 6 Hantao Zhang. Sample question. Total is 18 * 325 = 5850

Basics of Counting 22C:19, Chapter 6 Hantao Zhang 1 The product rule Also called the multiplication rule If there are n 1 ways to do task 1, and n 2 ways to do task 2 Then there are n 1 n 2 ways to do

### Worksheet A2 : Fundamental Counting Principle, Factorials, Permutations Intro

Worksheet A2 : Fundamental Counting Principle, Factorials, Permutations Intro 1. A restaurant offers four sizes of pizza, two types of crust, and eight toppings. How many possible combinations of pizza

### Assigning Probabilities

What is a Probability? Probabilities are numbers between 0 and 1 that indicate the likelihood of an event. Generally, the statement that the probability of hitting a target- that is being fired at- is

### MATHEMATICS 117/E-217, SPRING 2012 PROBABILITY AND RANDOM PROCESSES WITH ECONOMIC APPLICATIONS Module #5 (Borel Field and Measurable Functions )

MATHEMATICS 117/E-217, SPRING 2012 PROBABILITY AND RANDOM PROCESSES WITH ECONOMIC APPLICATIONS Module #5 (Borel Field and Measurable Functions ) Last modified: May 1, 2012 Reading Dineen, pages 57-67 Proof

### 2.1.1 Examples of Sets and their Elements

Chapter 2 Set Theory 2.1 Sets The most basic object in Mathematics is called a set. As rudimentary as it is, the exact, formal definition of a set is highly complex. For our purposes, we will simply define

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### 0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.

SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive

### NOTES ON ELEMENTARY PROBABILITY

NOTES ON ELEMENTARY PROBABILITY KARL PETERSEN 1. Probability spaces Probability theory is an attempt to work mathematically with the relative uncertainties of random events. In order to get started, we

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Basics of Probability

Basics of Probability August 27 and September 1, 2009 1 Introduction A phenomena is called random if the exact outcome is uncertain. The mathematical study of randomness is called the theory of probability.

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### MA3059 Combinatorics and Graph Theory

MA3059 Combinatorics and Graph Theory Martin Stynes Department of Mathematics, UCC January 23, 2007 Abstract These notes are designed to accompany the textbook A first course in discrete mathematics by

### Continued fractions and good approximations.

Continued fractions and good approximations We will study how to find good approximations for important real life constants A good approximation must be both accurate and easy to use For instance, our

### Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures

### Discrete Mathematics. Some related courses. Assessed work. Motivation: functions. Motivation: sets. Exercise. Motivation: relations

Discrete Mathematics Philippa Gardner This course is based on previous lecture notes by Iain Phillips. K.H. Rosen. Discrete Mathematics and its Applications, McGraw Hill 1995. J.L. Gersting. Mathematical

### LECTURE 4. Conditional Probability and Bayes Theorem

LECTURE 4 Conditional Probability and Bayes Theorem 1 The conditional sample space Physical motivation for the formal mathematical theory 1. Roll a fair die once so the sample space S is given by S {1,

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University

Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University 1 Chapter 1 Probability 1.1 Basic Concepts In the study of statistics, we consider experiments

### MTH6109: Combinatorics. Professor R. A. Wilson

MTH6109: Combinatorics Professor R. A. Wilson Autumn Semester 2011 2 Lecture 1, 26/09/11 Combinatorics is the branch of mathematics that looks at combining objects according to certain rules (for example:

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Math 320 Course Notes. Chapter 7: Countable and Uncountable Sets

Math 320 Course Notes Magnhild Lien Chapter 7: Countable and Uncountable Sets Hilbert s Motel: Imagine a motel with in nitely many rooms numbered 1; 2; 3; 4 ; n; : One evening an "in nite" bus full with

### The Basics of Counting. Niloufar Shafiei

The Basics of Counting Niloufar Shafiei Counting applications Counting has many applications in computer science and mathematics. For example, Counting the number of operations used by an algorithm to

### Logic & Discrete Math in Software Engineering (CAS 701) Dr. Borzoo Bonakdarpour

Logic & Discrete Math in Software Engineering (CAS 701) Background Dr. Borzoo Bonakdarpour Department of Computing and Software McMaster University Dr. Borzoo Bonakdarpour Logic & Discrete Math in SE (CAS

### WHERE DOES THE 10% CONDITION COME FROM?

1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay

### MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties

Lecture 1 (Review of High School Math: Functions and Models) Introduction: Numbers and their properties Addition: (1) (Associative law) If a, b, and c are any numbers, then ( ) ( ) (2) (Existence of an

### INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS

INTRODUCTION TO PROOFS: HOMEWORK SOLUTIONS STEVEN HEILMAN Contents 1. Homework 1 1 2. Homework 2 6 3. Homework 3 10 4. Homework 4 16 5. Homework 5 19 6. Homework 6 21 7. Homework 7 25 8. Homework 8 28

### List of Standard Counting Problems

List of Standard Counting Problems Advanced Problem Solving This list is stolen from Daniel Marcus Combinatorics a Problem Oriented Approach (MAA, 998). This is not a mathematical standard list, just a

### Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way

Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

### Definition 14 A set is an unordered collection of elements or objects.

Chapter 4 Set Theory Definition 14 A set is an unordered collection of elements or objects. Primitive Notation EXAMPLE {1, 2, 3} is a set containing 3 elements: 1, 2, and 3. EXAMPLE {1, 2, 3} = {3, 2,

### Sequences and Summations. Niloufar Shafiei

Sequences and Summations Niloufar Shafiei Sequences A sequence is a discrete structure used to represent an ordered list. 1 Sequences A sequence is a function from a subset of the set integers (usually

### Proof: A logical argument establishing the truth of the theorem given the truth of the axioms and any previously proven theorems.

Math 232 - Discrete Math 2.1 Direct Proofs and Counterexamples Notes Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the

### Online Materials: Counting Rules The Poisson Distribution

Chapter 6 The Poisson Distribution Counting Rules When the outcomes of a chance experiment are equally likely, one way to determine the probability of some event E is to calculate number of outcomes for

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

### Combinatorics: The Fine Art of Counting

Combinatorics: The Fine Art of Counting Week 7 Lecture Notes Discrete Probability Continued Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. The Bernoulli

### not to be republishe NCERT SETS Chapter Introduction 1.2 Sets and their Representations

SETS Chapter 1 In these days of conflict between ancient and modern studies; there must surely be something to be said for a study which did not begin with Pythagoras and will not end with Einstein; but

### 5 The Beginning of Transcendental Numbers

5 The Beginning of Transcendental Numbers We have defined a transcendental number (see Definition 3 of the Introduction), but so far we have only established that certain numbers are irrational. We now

### STRAND B: Number Theory. UNIT B2 Number Classification and Bases: Text * * * * * Contents. Section. B2.1 Number Classification. B2.

STRAND B: Number Theory B2 Number Classification and Bases Text Contents * * * * * Section B2. Number Classification B2.2 Binary Numbers B2.3 Adding and Subtracting Binary Numbers B2.4 Multiplying Binary

### Sets, Venn Diagrams & Counting

MT 142 College Mathematics Sets, Venn Diagrams & Counting Module SC Terri Miller revised January 5, 2011 What is a set? Sets set is a collection of objects. The objects in the set are called elements of

### The Pigeonhole Principle

The Pigeonhole Principle 1 Pigeonhole Principle: Simple form Theorem 1.1. If n + 1 objects are put into n boxes, then at least one box contains two or more objects. Proof. Trivial. Example 1.1. Among 13

### MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS

MATH 321 EQUIVALENCE RELATIONS, WELL-DEFINEDNESS, MODULAR ARITHMETIC, AND THE RATIONAL NUMBERS ALLAN YASHINSKI Abstract. We explore the notion of well-definedness when defining functions whose domain is

### The Geometric Series

The Geometric Series Professor Jeff Stuart Pacific Lutheran University c 8 The Geometric Series Finite Number of Summands The geometric series is a sum in which each summand is obtained as a common multiple

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

### Announcements. CompSci 230 Discrete Math for Computer Science. Test 1

CompSci 230 Discrete Math for Computer Science Sep 26, 2013 Announcements Exam 1 is Tuesday, Oct. 1 No class, Oct 3, No recitation Oct 4-7 Prof. Rodger is out Sep 30-Oct 4 There is Recitation: Sept 27-30.

### Jan 17 Homework Solutions Math 151, Winter 2012. Chapter 2 Problems (pages 50-54)

Jan 17 Homework Solutions Math 11, Winter 01 Chapter Problems (pages 0- Problem In an experiment, a die is rolled continually until a 6 appears, at which point the experiment stops. What is the sample

### MATHEMATICS (CLASSES XI XII)

MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)

### Appendix A: Numbers, Inequalities, and Absolute Values. Outline

Appendix A: Numbers, Inequalities, and Absolute Values Tom Lewis Fall Semester 2015 Outline Types of numbers Notation for intervals Inequalities Absolute value A hierarchy of numbers Whole numbers 1, 2,

### Discrete probability and the laws of chance

Chapter 8 Discrete probability and the laws of chance 8.1 Introduction In this chapter we lay the groundwork for calculations and rules governing simple discrete probabilities. These steps will be essential

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,