Discrete Mathematics and its Applications Counting (2) Xiaocong ZHOU


 Robert Harrington
 2 years ago
 Views:
Transcription
1 Discrete Mathematics and its Applications Counting (2) Xiaocong ZHOU Department of Computer Science Sun Yatsen University Feb zxc Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
2 OUTLINE 1 Permutation 2 Combinations 3 The Binomial Theorem 4 Pascal s Identity and Triangle 5 Some Other Identities for Binomial Coefficients Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
3 Introduction Permutation 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 elements matters Many other counting problems can be solved by finding the number of ways to select a particular number of elements from a set of a particular size where the order of the elements selected does not matter In how many ways can we select three students from a group of five students to stand in line for a picture? In how many ways can we arrange all five of these students in a line for a picture? Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
4 Permutation Permutation A permutation( 排列 ) of a set of distinct objects is an ordered arrangement of these objects An ordered arrangement of r elements of a set is called an rpermutation Let S = {1, 2, 3} The ordered arrangement 3, 1, 2 is a permutation of S The ordered arrangement 3, 2, is a 2permutation of S Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
5 Permutation The number of rpermutations of a set with n elements is denoted by P(n, r) We can find P(n, r) using the product rule Let S = {a, b, c} The 2permutations of S are the ordered arrangements a, b; a, c; b, a; b, c; c, a; and c, b. There are always six 2permutations of a set with three elements there are three ways to choose the first element of the arrangement and two ways to choose the second element of the arrangement because it must be different from the first element Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
6 Permutation Theorem Corollary If n is a positive integer and r is an integer with 1 r n, then there are P(n, r) = n(n 1)(n 2) (n r + 1) rpermutations of a set with n distinct elements If n and r are integers with 0 r n, then n! P(n, r) = (n r)! How many ways are there to select a firstprize winner, a secondprize winner, and a thirdprize winner from 100 different people who have entered a context? Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
7 Permutation Suppose that there are eight runners in race The winner receives a gold medal, the second;lace finisher receives a silver medal, and the thirdplace finisher receives a bronze medal How many different ways are there to award these medals, if all possible outcomes of the race can occur and there are no ties? Suppose that a saleswoman has to visit eight different cities She must begin her trip in a specified city, but she can visit the other seven cities in any order she wishes How many possible orders can the saleswoman use when visiting these cities? How many permutations of the letters ABCDEFGH contain the string ABC? Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
8 Combinations Combinations How many different committees of three students can be formed from a group of four students? An rcombination( 组合 ) of elements of a set is an unordered selection of r elements from the set Thus, an rcombination is simply a subset of the set with r elements Let S be the set {1, 2, 3, 4} Then {1, 3, 4} is a 3combination from S Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
9 Combinations Theorem The number of rcombinations of a set with n distinct elements is denoted by C(n, r) C(n, r) is also denoted by ( n r) and is called a binomial coefficient The number of rcombinations of a set with n elements equals n! n(n 1) (n r + 1) C(n, r) = = r!(n r)! r! where n is a nonnegative integer and r is an integer with 0 r n The rpermutations of the set can be obtained by forming the C(n, r) rcombinations of the set, and then ordering the elements in each rcombination, which can be done in P(r, r) ways P(n, r) = C(n, r) P(r, r) Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
10 Combinations Corollary How many poker hands of five cards can be dealt from a standard deck of 52 card? How many ways are there to select 47 cards from a standard deck of 52 cards? Let n and r be nonnegative integers with r n. Then C(n, r) = C(n, n r) A combinatorial proof( 组合证明 ) of an identity is a proof uses counting arguments to prove that both sides of the identity count the same objects but in different ways Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
11 Combinations How many ways are there to select five players from a 10member tennis team to make a trip to a match at another school? How many bit strings of length n contain exactly r1s? Suppose that there are 9 faculty members in the mathematics department and 11 in the computer science department How many ways are there to select a committee to develop a discrete mathematics course at a school if the committee is to consist of three faculty members from the mathematics department and four from the computer science department? Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
12 The Binomial Theorem The Binomial Theorem The Binomial Theorem gives the coefficients of the expansion of powers of binomial expressions A binomial expression is simply the sum of two terms, such as x + y The expansion of (x + y) 3 = (x + y)(x + y)(x + y) can be found using combinatorial reasoning To obtain a term of the form x 3 an x must be chosen in each of the sums, and this can be done in only one way Thus, the x 3 term in the product has a coefficient of 1 To obtain a term of the form x 2 y an x must be chosen in two of the three sums (and consequently a y in the other sum) Hence, the number of such terms is the number of 2combinations of three objects, namely, ( 3) 2 Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
13 The Binomial Theorem The Binomial Theorem Theorem (The Binomial Theorem) Let x and y be variables, and let n be a nonnegative integer. Then (x + y) n n ( n = j j=0 ( ) n = x n + 0 ) x n j y j ( ) n x n 1 y + 1 ( ) ( ) n n x n 2 y xy n n 1 ( ) n y n n What is the expansion of (x + y) 4? What is the coefficient of x 12 y 13 in the expansion of (2x 3y) 2 5? Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
14 The Binomial Theorem Corollary Let n be a nonnegative integer. Then n ( ) n = 2 n k k=0 Let n be a nonnegative integer. Then ( ) n k = 0 n ( 1) k k = 0 This implies ( ) n 0 ( ) ( ) ( ) ( ) ( ) n n n n n = Let n be a nonnegative integer. Then n ( ) n 2 k = 3 n k k=0 Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
15 Pascal s identity Pascal s Identity and Triangle Theorem (Pascal s Identity) Let n and k be positive ( integers ) with ( n ) k. ( Then ) n + 1 n n = + k k 1 k Suppose that T is a set containing n + 1 elements. Let a T and S = T {a}. there are ( n+1) k subsets of T containing k elements a subset of T with k elements either contains a together with k 1 elements of S, or contains k elements of S and does not contain a Pascal s Identity, together with the initial conditions ( n 0) = ( n n) = 1 for all integers n, can be used to recursively define binomial coefficients This is useful in the computation of binomial coefficients because only addition, and not multiplication, of integers is needed to use this recursive definition Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
16 Pascal s triangle Pascal s Identity and Triangle Pascal s Identity is the basis for a geometric arrangement of the binomial coefficients in a triangle This triangle is known as Pascal s triangle( 中国 : 贾宪三角 ) Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
17 Some Other Identities for Binomial Coefficients Vandermonde s Identity Theorem (Vandermonde s Identity) Let m, n, and r be nonnegative integers with r m and r n. Then ( ) m + n r ( )( ) m n = r r k k k=0 Suppose that there are m items in one set and n items in a second set the total number of ways to pick r elements from the union is ( m+n) r Another way to pick r elements is to pick k elements from the first set and then r k elements from the second set, where k is an integer with 0 k r Corollary If n is a nonnegative integer, then ( ) 2n = n n k=0 ( ) 2 n k Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
18 Some Other Identities for Binomial Coefficients Theorem Let n and r be nonnegative integers with r n. Then ( ) n + 1 n ( ) j = r + 1 r the lefthand side counts the bit strings of length n + 1 containing r + 1 ones the righthand side counts the same objects by considering the cases corresponding to the possible locations of the final 1 in a string with r + 1 ones This final one must occur at position r + 1, r + 2,, or n + 1 j=r If the last one is the kth bit there must be r ones among the first k 1 positions, there are ( k 1) r such bit strings Summing over k with r + 1 k n + 1, we find that there are ( k 1 ) n ( j n + 1 = r r) k=r+1 j=r bit strings of length n containing exactly r + 1 ones Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
19 Some Other Identities for Binomial Coefficients Assignment: Exercises after 6.3, No. 20, 30, and Exercises after 6.4, No. 16, 22 Further reading: Exercises after 6.4, No. 17, 21 Xiaocong ZHOU (SYSU) Discrete Mathematics Feb / 19
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
More informationSection 6.4: Counting Subsets of a Set: Combinations
Section 6.4: Counting Subsets of a Set: Combinations In section 6.2, we learnt how to count the number of rpermutations from an nelement set (recall that an rpermutation is an ordered selection of r
More information4. Binomial Expansions
4. Binomial Expansions 4.. Pascal's Triangle The expansion of (a + x) 2 is (a + x) 2 = a 2 + 2ax + x 2 Hence, (a + x) 3 = (a + x)(a + x) 2 = (a + x)(a 2 + 2ax + x 2 ) = a 3 + ( + 2)a 2 x + (2 + )ax 2 +
More informationMATH 105: Finite Mathematics 65: Combinations
MATH 105: Finite Mathematics 65: Combinations Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2006 Outline 1 Developing Combinations 2 s of Combinations 3 Combinations vs. Permutations 4 Conclusion
More informationSection 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
More informationMA3059 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
More informationCOUNTING SUBSETS OF A SET: COMBINATIONS
COUNTING SUBSETS OF A SET: COMBINATIONS DEFINITION 1: Let n, r be nonnegative integers with r n. An rcombination of a set of n elements is a subset of r of the n elements. EXAMPLE 1: Let S {a, b, c, d}.
More informationChapter 7: Section 73 Permutations
Chapter 7: Section 73 Permutations D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE ()Chapter 7: Section 73 Permutations 1 / 13 Permutations Suppose that you are
More informationSECTION 105 Multiplication Principle, Permutations, and Combinations
105 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
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 4702301/01, Winter term 2015/2016 About this file This file is meant to be a guideline for the lecturer. Many
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationNotes 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......................................
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 7, due Wedneday, March 14 Happy Pi Day! (If any errors are spotted, please email them to morrison at math dot berkeley dot edu..5.10 A croissant
More informationMathematics 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
More informationSpring 2007 Math 510 Hints for practice problems
Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an chessboard There are doors between all adjacent cells A prisoner in one
More information35 Permutations, Combinations and Probability
35 Permutations, Combinations and Probability Thus far we have been able to list the elements of a sample space by drawing a tree diagram. For large sample spaces tree diagrams become very complex to construct.
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationCombinatorial 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
More informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationQuestion: What is the probability that a fivecard poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twentyfold 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 pingpong balls)
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More information1.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
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationAn Introduction to Combinatorics and Graph Theory. David Guichard
An Introduction to Combinatorics and Graph Theory David Guichard This work is licensed under the Creative Commons AttributionNonCommercialShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/byncsa/3.0/
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationMath 2001 Homework #10 Solutions
Math 00 Homework #0 Solutions. Section.: ab. For each map below, determine the number of southerly paths from point to point. Solution: We just have to use the same process as we did in building Pascal
More informationDiscrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
More informationThe thing that started it 8.6 THE BINOMIAL THEOREM
476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of moves required if you start with an arbitrary number of n disks.
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationCombinatorial Probability
Chapter 2 Combinatorial Probability 2.1 Permutations and combinations As usual we begin with a question: Example 2.1. The New York State Lottery picks 6 numbers out of 54, or more precisely, a machine
More informationSCORE SETS IN ORIENTED GRAPHS
Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationHomework 6 (due November 4, 2009)
Homework 6 (due November 4, 2009 Problem 1. On average, how many independent games of poker are required until a preassigned player is dealt a straight? Here we define a straight to be cards of consecutive
More informationProbability. Section 9. Probability. Probability of A = Number of outcomes for which A happens Total number of outcomes (sample space)
Probability Section 9 Probability Probability of A = Number of outcomes for which A happens Total number of outcomes (sample space) In this section we summarise the key issues in the basic probability
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationSection 64 Multiplication Principle, Permutations, and Combinations
78 SEQUENCES, SERIES, ND PROBBILITY (B) Find the cycles per second for C, three notes higher than. 91. Puzzle. If you place 1 on the first square of a chessboard, on the second square, on the third, and
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More information0018 DATA ANALYSIS, PROBABILITY and STATISTICS
008 DATA ANALYSIS, PROBABILITY and STATISTICS A permutation tells us the number of ways we can combine a set where {a, b, c} is different from {c, b, a} and without repetition. r is the size of of the
More informationSets 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
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationJan 17 Homework Solutions Math 151, Winter 2012. Chapter 2 Problems (pages 5054)
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
More informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationDiscrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.
Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square
More information8.3 Probability Applications of Counting Principles
8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationHomework 5 Solutions
Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which
More informationPigeonhole 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
More informationTopic 1 Probability spaces
CSE 103: Probability and statistics Fall 2010 Topic 1 Probability spaces 1.1 Definition In order to properly understand a statement like the chance of getting a flush in fivecard poker is about 0.2%,
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More information1. 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 MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationChapter 3 Joint Distributions
Chapter 3 Joint Distributions 3.6 Functions of Jointly Distributed Random Variables Discrete Random Variables: Let f(x, y) denote the joint pdf of random variables X and Y with A denoting the twodimensional
More informationSolutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationWorked examples Basic Concepts of Probability Theory
Worked examples Basic Concepts of Probability Theory Example 1 A regular tetrahedron is a body that has four faces and, if is tossed, the probability that it lands on any face is 1/4. Suppose that one
More informationNotes: Chapter 2 Section 2.2: Proof by Induction
Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case  S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example
More informationLESSON 6.2 POLYNOMIAL OPERATIONS I
LESSON 6.2 POLYNOMIAL OPERATIONS I Overview In business, people use algebra everyday to find unknown quantities. For example, a manufacturer may use algebra to determine a product s selling price in order
More informationChapter 3: The basic concepts of probability
Chapter 3: The basic concepts of probability Experiment: a measurement process that produces quantifiable results (e.g. throwing two dice, dealing cards, at poker, measuring heights of people, recording
More informationCombinatorics. Chapter 1. 1.1 Factorials
Chapter 1 Combinatorics Copyright 2009 by David Morin, morin@physics.harvard.edu (Version 4, August 30, 2009) This file contains the first three chapters (plus some appendices) of a potential book on Probability
More informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
More informationLecture 13  Basic Number Theory.
Lecture 13  Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are nonnegative integers. We say that A divides B, denoted
More informationMathematical Induction. Lecture 1011
Mathematical Induction Lecture 1011 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationINCIDENCEBETWEENNESS GEOMETRY
INCIDENCEBETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More information4. Joint Distributions
Virtual Laboratories > 2. Distributions > 1 2 3 4 5 6 7 8 4. Joint Distributions Basic Theory As usual, we start with a random experiment with probability measure P on an underlying sample space. Suppose
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBINCAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its wellknown properties Volumes of parallelepipeds are
More informationMODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.
MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on
More informationTexas Hold em. From highest to lowest, the possible five card hands in poker are ranked as follows:
Texas Hold em Poker is one of the most popular card games, especially among betting games. While poker is played in a multitude of variations, Texas Hold em is the version played most often at casinos
More informationLinear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.
Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a subvector space of V[n,q]. If the subspace of V[n,q]
More informationThe Story. Probability  I. Plan. Example. A Probability Tree. Draw a probability tree.
Great Theoretical Ideas In Computer Science Victor Adamchi CS 55 Carnegie Mellon University Probability  I The Story The theory of probability was originally developed by a French mathematician Blaise
More informationSection 62 Mathematical Induction
6 Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationNotes on Probability and Statistics
Notes on Probability and Statistics Andrew Forrester January 28, 2009 Contents 1 The Big Picture 1 2 Counting with Combinatorics 2 2.1 Possibly Useful Notation...................................... 2 2.2
More informationDiscrete Math in Computer Science Homework 7 Solutions (Max Points: 80)
Discrete Math in Computer Science Homework 7 Solutions (Max Points: 80) CS 30, Winter 2016 by Prasad Jayanti 1. (10 points) Here is the famous Monty Hall Puzzle. Suppose you are on a game show, and you
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationDiscrete Mathematics
Discrete Mathematics Lecture Notes, Yale University, Spring 1999 L. Lovász and K. Vesztergombi Parts of these lecture notes are based on L. Lovász J. Pelikán K. Vesztergombi: Kombinatorika (Tankönyvkiadó,
More informationA characterization of trace zero symmetric nonnegative 5x5 matrices
A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationJacobi s four squares identity Martin Klazar
Jacobi s four squares identity Martin Klazar (lecture on the 7th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationFactoring Trinomials of the Form x 2 bx c
4.2 Factoring Trinomials of the Form x 2 bx c 4.2 OBJECTIVES 1. Factor a trinomial of the form x 2 bx c 2. Factor a trinomial containing a common factor NOTE The process used to factor here is frequently
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationMATHEMATICS 154, SPRING 2010 PROBABILITY THEORY Outline #3 (Combinatorics, bridge, poker)
Last modified: February, 00 References: MATHEMATICS 5, SPRING 00 PROBABILITY THEORY Outline # (Combinatorics, bridge, poker) PRP(Probability and Random Processes, by Grimmett and Stirzaker), Section.7.
More informationOnline 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
More informationP. Jeyanthi and N. Angel Benseera
Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONEPOINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel
More informationLecture 18: Applications of Dynamic Programming Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY 11794 4400
Lecture 18: Applications of Dynamic Programming Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Problem of the Day
More informationMaths class 11 Chapter 7. Permutations and Combinations
1 P a g e Maths class 11 Chapter 7. Permutations and Combinations Fundamental Principles of Counting 1. Multiplication Principle If first operation can be performed in m ways and then a second operation
More informationFactoring Special Polynomials
6.6 Factoring Special Polynomials 6.6 OBJECTIVES 1. Factor the difference of two squares 2. Factor the sum or difference of two cubes In this section, we will look at several special polynomials. These
More informationPolynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range
THEORY OF COMPUTING, Volume 1 (2005), pp. 37 46 http://theoryofcomputing.org Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range Andris Ambainis
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information