Counting Elements of Disjoint Sets: The Addition Rule

Slides:



Advertisements
Similar presentations
The Fundamental Theorem of Arithmetic. Primes p > 1 is prime if the only positive factors are 1 and p if p is not prime it is composite The Fundamental.
Advertisements

366,84 m2 114,09 m2 220,84 m262,34 m2 Renaissance Premium have 2 underground parking floors which let 66 cars to park safely. 1 st Floor Bank Cafe Renaissance.
Recursively Defined Functions
Prime Factorization Section 2.5. Objectives Find the prime factorization of a counting number by repeated division Find the prime factorization of a counting.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Lecture 14: Oct 28 Inclusion-Exclusion Principle.
The Inclusion/Exclusion Rule for Two or Three Sets
Fundamental Theorem of Arithmetic. Euclid's Lemma If p is a prime that divides ab, then p divides a or p divides b.
Section 4.1 Finite Permutation Groups Permutation of a Set Let A be the set { 1, 2, …, n }. A permutation on A is a function f : A  A that is both one-to-one.
Patterns and Sequences
Estimating Square Roots and Cube Roots. Review of Perfect Square Roots.
Finding an Inverse Function with a Table. Inverse Notation Original function Inverse function “Inverse of f(x)”
Binomial Coefficients, Inclusion-exclusion principle
Chapter 3: Derivatives Section 3.3: Rules for Differentiation
1 Binomial Coefficients CS 202 Epp, section ??? Aaron Bloomfield.
Multiplying and Dividing Integers When you MULTIPLY: Two positives equal a positive Two negatives equal a positive One positive & one negative equal.
A Brief Review of Factoring Chapter ( ) x 2 2(x)(-6) = -12x GCF = x 2 = 3(x – 6) 2 36 = 2. Are the 1 st and 3 rd terms perfect squares 3. Is 2 nd.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
Counting Techniques. L172 Agenda Section 4.1: Counting Basics Sum Rule Product Rule Inclusion-Exclusion.
Section 4.4 Theorems about Zeros of Polynomial Functions Copyright ©2013, 2009, 2006, 2001 Pearson Education, Inc.
Lesson 1 Multiples and Factors At times you will be asked to determine the factors or multiples of various numbers in math problems in school and on the.
Systematic Sampling Lecture 9 – Part 1 Sections 2.8 Wed, Jan 30, 2008.
Application: Algorithms Lecture 20 Section 3.8 Wed, Feb 21, 2007.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Direct Proof and Counterexample III
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Basic Definitions of Set Theory Lecture 23 Section 5.1 Mon, Feb 21, 2005.
Set Operations Section 2.2.
160 as a product of its prime factors is 2 5 x 5 Use this information to show that 160 has 12 factors.
All standards and examples can be found at atics/2014-ias-mathematics-resources-grade_7_7-1-
Section P5 Factoring Polynomials. Factoring a polynomial containing the sum of monomials mean finding an equivalent expression that is a product. In this.
Patterns and Sequences Sequence: Numbers in a specific order that form a pattern are called a sequence. An example is 2, 4, 6, 8, 10 and 12. Polygon:
LCMLeastCommonMultiple A Multiple of a number is the product of that number and a nonzero whole number. 2 x 1 = 2 2 x 2 = 4 2 x 3 = 6 2, 4, 6 are multiples.
Objective: Students will subtract integers using rules (11-4).
EVEN NUMBERS EVEN NUMBERS 1 = prime 2 = prime1 3 = prime 4 = 2 x 22 5 = prime 6 = 2 x 33 7 = prime 8 = 2 x 2 x 24 9 = 3 x 3 10 = 2 x 55.
Principle of Inclusion and Exclusion
Multiplication and Division of Powers
Descartes’ Rule of Signs
Review of Factoring Unit R Lesson 2.
Aim: How Can We Add and Subtract Integers
Arithmetic and Geometric Means
CSE322 PUMPING LEMMA FOR REGULAR SETS AND ITS APPLICATIONS
Indices.
Warm Up Identify the slope and y-intercept of each equation. Then graph. 1. Y = -5X X + 5Y = X = Y = 12.
Great Theoretical Ideas In Computer Science
Factors, multiple, primes: Types of numbers from prime factors
Direct Proof and Counterexample I
Direct Proof and Counterexample I
Direct Proof and Counterexample III
Direct Proof and Counterexample IV
Count the number of dots and write down your answer
GCD and LCM relationship
Direct Proof and Counterexample III
Square root Prime factorization
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Types of Number © B. Taylor
More Applications of the Pumping Lemma
Subtracting Real Numbers
Direct Proof and Counterexample I
Direct Proof and Counterexample IV
Chapter 6 Section 3.
Counting Elements of Disjoint Sets: The Addition Rule
Which of the following is a prime number? Why?
Counting Elements of Disjoint Sets: The Addition Rule
Basic Definitions of Set Theory
Natural Numbers The first counting numbers Does NOT include zero
Counting Elements of Disjoint Sets: The Addition Rule
Dividing Radical Expressions
Multiplication and Division of Integers
Year Mathematics with Miss Hudson.
Presentation transcript:

Counting Elements of Disjoint Sets: The Addition Rule Lecture 27 Sections 6.3 – 6.4 Mon, Feb 28, 2005

Example: Inclusion/Exclusion How many primes are there between 1 and 100? The non-primes must be multiples of 2, 3, 5, or 7, since the square root of 100 is 10.

A Lemma Lemma: Let n and d be positive integers. There are n/d multiples of d between 1 and n, where x represents the “floor” of x.

Example: Inclusion/Exclusion Let A = {n | 1  n  100 and 2 divides n}. Let B = {n | 1  n  100 and 3 divides n}. Let C = {n | 1  n  100 and 5 divides n}. Let D = {n | 1  n  100 and 7 divides n}.

Example: Inclusion/Exclusion By the Inclusion/Exclusion Rule, |A  B  C  D| = |A| + |B| + |C| + |D| – |A  B| – |A  C| – |A  D| – |B  C| – |B  D| – |C  D| + |A  B  C| + |A  B  C| – |A  B  C  D|.

Example: Inclusion/Exclusion However, A  B = {n | 1  n  100 and 6 | n}. A  B  C = {n | 1  n  100 and 30 | n}. B  C  D = {n | 1  n  100 and 105 | n}. And so on.

Example: Inclusion/Exclusion Therefore, |A| = 100/2 = 50. |A  B| = 100/6 = 16. |A  B  C| = 100/30 = 3. |B  C  D| = 100/105 = 0. And so on.

Example: Inclusion/Exclusion The number of multiples of 2, 3, 5, and 7 is (50 + 33 + 20 + 14) – (16 + 10 + 7 + 6 + 4 + 2) + (3 + 2 + 1 + 0) – (0) = 78

Example: Inclusion/Exclusion This count includes 2, 3, 5, 7, which are prime. This count does not include 1, which is not prime. Therefore, the number of primes is 100 – 78 + 4 – 1 = 25.

Example: Inclusion/Exclusion How many integers from 1 to 1000 are multiples of 6, 10, or 15? Let A = {n | 1  n  100 and 6 divides n}. Let B = {n | 1  n  100 and 10 divides n}. Let C = {n | 1  n  100 and 15 divides n}. What is A  B? A  C? B  C? What is A  B  C?

Example: Inclusion/Exclusion |B| = 1000/10 = 100. |C| = 1000/15 = 66. |A  B| = 1000/30 = 33. |A  C| = 1000/30 = 33. |B  C| = 1000/30 = 33. |A  B  C| = 1000/30 = 33. Therefore, 266 numbers from 1 to 1000 are multiples of 6, 10, or 15.

Example: Inclusion/Exclusion How many 8-bit numbers have either 1 in the 1st and 2nd positions, or 0 in the 2nd and 3rd positions, or 1 in the 3rd and 4th positions?