Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule

Similar documents
Basic Counting Principles: The Product Rule

Counting Product Rule

Discrete Structures Lecture The Basics of Counting

Counting: Basics. Rosen, Chapter 6.1

CS228 - Basic Counting and the Pigeonhole Principle

Counting: Basics. A simple counting problem. Counting: the product rule. Relation to Cartesian products. Relation to Cartesian products

Discrete Structures for Computer Science

CSCI FOUNDATIONS OF COMPUTER SCIENCE

Counting. Rosen, Chapter 6 Walls and Mirrors, Chapter 3

Discrete Structures. Fall Homework3

Section 6.3: Further Rules for Counting Sets

Counting. Andreas Klappenecker

Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore

1. (15 points) Solve the decanting problem for containers of sizes 199 and 179; that is find integers x and y satisfying.

Solution : a) C(18, 1)C(325, 1) = 5850 b) C(18, 1) + C(325, 1) = 343

Introduction. CS243: Discrete Structures. Combinatorics. Product Rule. Basic Counting Rules. Example 2. Example 1

2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2

LESSON 1: INTRODUCTION TO COUNTING

Packet #6: Counting & Graph Theory. Applied Discrete Mathematics

Section Sets and Set Operations

Lecture 25 : Counting DRAFT

The strong chromatic number of a graph

11 Sets II Operations

It is important that you show your work. There are 134 points available on this test.

Finite State Machines

2 Review of Set Theory

Generell Topologi. Richard Williamson. May 6, 2013

Math 110 FOUNDATIONS OF THE REAL NUMBER SYSTEM FOR ELEMENTARY AND MIDDLE SCHOOL TEACHERS

Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.

Section 13. Basis for a Topology

1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall

Student Outcomes. Lesson Notes. Classwork. Example 2 (3 minutes)

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets

Discrete Mathematics Exam File Fall Exam #1

On the packing chromatic number of some lattices

Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Sets Fall / 31

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

Student Outcomes. Lesson Notes. Classwork. Discussion (4 minutes)

Chapter 8 Patterns. Examples: a, b, c,, x, y, z

MTH-129 Review for Test 4 Luczak

USA Mathematical Talent Search Round 2 Solutions Year 23 Academic Year

Notes for Recitation 13

13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Automata Theory EUR solutions

c) the set of students at your school who either are sophomores or are taking discrete mathematics

Math 776 Graph Theory Lecture Note 1 Basic concepts

CPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60

Introduction to Sets and Logic (MATH 1190)

Section 8.2 Graph Terminology. Undirected Graphs. Definition: Two vertices u, v in V are adjacent or neighbors if there is an edge e between u and v.

396 6 / Counting 6.1. Exercises

COUNTING AND PROBABILITY

Extremal Graph Theory: Turán s Theorem

Formatting for TLM - Part I

REGULAR GRAPHS OF GIVEN GIRTH. Contents

Symmetric Product Graphs

Exponential Notation

CSE 20 DISCRETE MATH. Winter

CS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation

mcs 2015/5/18 1:43 page 551 #559

Counting. Chapter Basic Counting. The Sum Principle. We begin with an example that illustrates a fundamental principle.

1.1 - Introduction to Sets

Figure 1: From Left to Right, General Venn Diagrams for One, Two, and Three Sets

Equations and Problem Solving with Fractions. Variable. Expression. Equation. A variable is a letter used to represent a number.

Midterm 2 Solutions. CS70 Discrete Mathematics and Probability Theory, Spring 2009

How to Do Word Problems. Building the Foundation

HW Graph Theory SOLUTIONS (hbovik) - Q

Math 187 Sample Test II Questions

The Oberwolfach Problem in Graph Theory

Mathematics for Computer Scientists 2 (G52MC2)

MATH LEVEL 2 LESSON PLAN 5 DECIMAL FRACTIONS Copyright Vinay Agarwala, Checked: 1/22/18

Solutions to In Class Problems Week 9, Fri.

Unit 1 Calendar. 9/15 Review 1.1, 1.2, 1.3, 1.4, 1.6, 1.7 9/17 Unit 1 Test

a- As a special case, if there is only one symbol, no bits are required to specify it.

Linear Equations - Word Problems

THE UNIVERSITY OF MANITOBA

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.

MathWorks MATLAB download & installation instructions

Slides for Faculty Oxford University Press All rights reserved.

2. Functions, sets, countability and uncountability. Let A, B be sets (often, in this module, subsets of R).

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 7

4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning

Discrete Mathematics for CS Spring 2008 David Wagner Note 13. An Introduction to Graphs

Introduction to Counting, Some Basic Principles

Chapter 1: Foundations for Algebra

2.) From the set {A, B, C, D, E, F, G, H}, produce all of the four character combinations. Be sure that they are in lexicographic order.

Math.3336: Discrete Mathematics. Chapter 10 Graph Theory

Abstract Combinatorial Games

SETS. Sets are of two sorts: finite infinite A system of sets is a set, whose elements are again sets.

Technology Is For You!

Number System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value

Math Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.

In this lesson, we will use the order of operations to evaluate and simplify expressions that contain numbers and variables.

On total domination and support vertices of a tree

Math 778S Spectral Graph Theory Handout #2: Basic graph theory

Discrete mathematics , Fall Instructor: prof. János Pach

may be sent to:

Counting Pigeonhole principle

Introduction to GroupWise

1 Sets, Fields, and Events

Disjoint directed cycles

Common Core State Standards Mathematics (Subset K-5 Counting and Cardinality, Operations and Algebraic Thinking, Number and Operations in Base 10)

Transcription:

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule Examples, Examples, and Examples Tree Diagrams Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1 ways to do the first task and n 2 ways to do the second task. Then there are n 1 n 2 ways to do the procedure. Example: How many bit strings of length seven are there? Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters followed by three digits? Example (Counting Functions): How many functions are there from a set with m elements to a set with n elements? Page 1 of 7

Example (Counting One-to-One Functions): How many one-to-one functions are there from a set with m elements to one with n elements? Example: The North American numbering plan (NANP) specifies that a telephone number consists of 10 digits, consisting of a three-digit area code, a three-digit office code, and a four-digit station code. There are some restrictions on the digits. Let X denote a digit from 0 through 9. Let N denote a digit from 2 through 9. Let Y denote a digit that is 0 or 1. In the old plan (in use in the 1960s) the format was NYX-NNX-XXX. In the new plan, the format is NXX-NXX-XXX. How many different telephone numbers are possible under the old plan and the new plan? Page 2 of 7

Example (Counting Subsets of a Finite Set): Use the product rule to show that the number of different subsets of a finite set S is 2 S. (In Section 5.1, mathematical induction was used to prove this same result.) Basic Counting Principles: The Sum Rule The Sum Rule: If a task can be done either in one of n ways or in one of n, where none of 1 2 the set of n ways is the same as any of the n ways, then there are n + n ways to do the 1 2 1 2 task. Example: The mathematics department must choose either a student or a faculty member as a representative for a university committee. How many choices are there for this representative if there are 37 members of the mathematics faculty and 83 mathematics majors and no one is both a faculty member and a student? Combining the Sum and Product Rule Example: Suppose statement labels in a programming language can be either a single letter or a letter followed by a digit. Find the number of possible labels. Page 3 of 7

Example (Counting Passwords): Each user on a computer system has a password, which is six to eight characters long, where each character is an uppercase letter or a digit. Each password must contain at least one digit. How many possible passwords are there? Page 4 of 7

Basic Counting Principles: Subtraction Rule Subtraction Rule: If a task can be done either in one of n ways or in one of n ways, then 1 2 the total number of ways to do the task is n + n minus the number of ways to do the 1 2 task that are common to the two different ways. Example (Counting Bit Strings): How many bit strings of length eight either start with a 1 bit or end with the two bits 00? Page 5 of 7

Basic Counting Principles: Division Rule Division Rule: There are n/d ways to do a task if it can be done using a procedure that can be carried out in n ways, and for every way w, exactly d of the n ways correspond to way w. Restated in terms of sets: If the finite set A is the union of n pairwise disjoint subsets each with d elements, then n = A /d. In terms of functions: If f is a function from A to B, where both are finite sets, and for every value y B there are exactly d values x A such that f(x) = y, then B = A /d. Example: How many ways are there to seat four people around a circular table, where two seatings are considered the same when each person has the same left and right neighbor? Page 6 of 7

Tree Diagrams Tree Diagrams: We can solve many counting problems through the use of tree diagrams, where a branch represents a possible choice and the leaves represent possible outcomes. Example: Suppose that I Love Discrete Math T-shirts come in five different sizes: S, M, L, XL, and XXL. Each size comes in four colors (white, red, green, and black), except XL, which comes only in red, green, and black, and XXL, which comes only in green and black. What is the minimum number of shirts that the campus book store needs to stock to have one of each size and color available? Page 7 of 7