Probability and Random Processes ECS 315

Size: px
Start display at page:

Download "Probability and Random Processes ECS 315"

Transcription

1 Probability and Random Processes ECS 315 Asst. Prof. Dr. Prapun Suksompong 4 Combinatorics 1 Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 9:00-10:00 Wednesday 14:20-15:20 Thursday 9:00-10:00

2 Supplementary References Mathematics of Choice How to count without counting By Ivan Niven permutations, combinations, binomial coefficients, the inclusion-exclusion principle, combinatorial probability, partitions of numbers, generating polynomials, the pigeonhole principle, and much more A Course in Combinatorics By J. H. van Lint and R. M. Wilson 2

3 Cartesian product The Cartesian product A B is the set of all ordered pairs where and. Named after René Descartes His best known philosophical statement is Cogito ergo sum (French: Je pense, donc je suis; I think, therefore I am) 3 [

4 4 Heads, Bodies and Legs flip-book

5 5 Heads, Bodies and Legs flip-book (2)

6 Interactive flipbook: Miximal 6 [

7 One Hundred Thousand Billion Poems 7 [

8 One Hundred Thousand Billion Poems Cent mille milliards de poèmes 8

9 Pokemon Go: Designing how your avatar looks 9

10 How many chess games are possible? 10 [

11 An Estimate: The Shannon Number 11 [

12 An Estimate: The Shannon Number 12 [

13 An Estimate: The Shannon Number 13 [

14 The Shannon Number: Just an Estimate 14 [

15 15 Example: Sock It Two Me

16 [Greenes, 1977] Example: Sock It Two Me Jack is so busy that he's always throwing his socks into his top drawer without pairing them. One morning Jack oversleeps. In his haste to get ready for school, (and still a bit sleepy), he reaches into his drawer and pulls out 2 socks. Jack knows that 4 blue socks, 3 green socks, and 2 tan socks are in his drawer. 1. What are Jack's chances that he pulls out 2 blue socks to match his blue slacks? 2. What are the chances that he pulls out a pair of matching socks? 16

17 Origin of Probability Theory Probability theory was originally inspired by gambling problems. [ In 1654, Chevalier de Mere invented a gambling system which bet even money on case B. When he began losing money, he asked his mathematician friend Blaise Pascal to analyze his gambling system. Pascal discovered that the Chevalier's system would lose about 51 percent of the time. Pascal became so interested in probability and together with another famous mathematician, Pierre de Fermat, they laid the foundation of probability theory. 17 best known for Fermat's Last Theorem

18 Example: The Seven Card Hustle Take five red cards and two black cards from a pack. Ask your friend to shuffle them and then, without looking at the faces, lay them out in a row. 18 Bet that them can t turn over three red cards. The probability that they CAN do it is ! 3! 7 3! 2! 4! ! [Lovell, 2006]

19 Permutation 19 [

20 Permutation There are 11! = 39,916,800 ways to permute 11 persons. 20 [

21 Finger-Smudge on Touch-Screen Devices Fingers oily smear on the screen Different apps gives different finger-smudges. Latent smudges may be usable to infer recently and frequently touched areas of the screen--a form of information leakage. [ 21

22 For sale Andre Woolery Art 22 [

23 Andre Woolery Art Fruit Ninja Facebook 23 Angry Bird Mail

24 Lockscreen PIN / Passcode 24 [

25 Smudge Attack Touchscreen smudge may give away your password/passcode Four distinct fingerprints reveals the four numbers used for passcode lock. 25 [

26 Suggestion: Repeat One Digit Unknown numbers: The number of 4-digit different passcodes = 10 4 Exactly four different but known numbers: The number of 4-digit different passcodes = 4! = 24 Exactly three different but known numbers: The number of 4-digit different passcodes = 2 50% improvement 26 Choose the number that will be repeated Choose the locations of the two nonrepeated numbers.

27 News: Most Common Lockscreen PINs Passcodes of users of Big Brother Camera Security iphone app 15% of all passcode sets were represented by only 10 different passcodes 27 [ (2011)] out of 204,508 recorded passcodes

28 Even easier in Splinter Cell Decipher the keypad's code by the heat left on the buttons. Here's the keypad viewed with your thermal goggles. (Numbers added for emphasis.) Again, the stronger the signature, the more recent the keypress. The code is

29 Actual Research University of California San Diego The researchers have shown that codes can be easily discerned from quite a distance (at least seven metres away) and imageanalysis software can automatically find the correct code in more than half of cases even one minute after the code has been entered. This figure rose to more than eighty percent if the thermal camera was used immediately after the code was entered. K. Mowery, S. Meiklejohn, and S. Savage Heat of the Moment: Characterizing the Efficacy of Thermal-Camera Based Attacks. Proceedings of WOOT

30 Alternative Solution Scramble PIN Layout in CyanogenMod (a modified version of Android ) 30 Scramble the keypad when you unlock your phone so that people can't peek at your keystrokes and learn your PIN.

31 The Birthday Problem (Paradox) How many people do you need to assemble before the probability is greater than 1/2 that some two of them have the same birthday (month and day)? Birthdays consist of a month and a day with no year attached. Ignore February 29 which only comes in leap years Assume that every day is as likely as any other to be someone s birthday In a group of r people, what is the probability that two or more people have the same birthday? 31

32 The Birthday Problem (con t) With 88 people, the probability is greater than 1/2 of having three people with the same birthday. 187 people gives a probability greater than1/2 of four people having the same birthday [Rosenhouse, 2009, p 7] [E. H. McKinney, Generalized Birthday Problem : American Mathematical Monthly, Vol. 73, No.4, 1966, pp ] 32

33 Birthday Coincidence: 2 nd Version How many people do you need to assemble before the probability is greater than 1/2 that at least one of them have the same birthday (month and day) as you? In a group of r people, what is the probability that at least one of them have the same birthday (month and day) as you? 33

34 Permuting four distinct letters: A,B,C,D DCBA CDBA BCDA ACBD DCAB CDAB BCAD ACDB DBCA CBDA BDCA ABCD DBAC CBAD BDAC ABDC DABC CABD BADC ADBC DACB CADB BACD ADCB 34

35 Permuting four letters: A,A,B,C D ACBA CABA BCAA ACBA ACAB CAAB BCAA ACAB ABCA CBAA BACA ABCA ABAC CBAA BAAC ABAC AABC CABA BAAC AABC AACB CAAB BACA AACB 35

36 Permuting four letters: A,A,B,C D ACBA CABA BCAA ACBA ACAB CAAB BCAA ACAB ABCA CBAA BACA ABCA ABAC CBAA BAAC ABAC AABC CABA BAAC AABC AACB CAAB BACA AACB 36

37 Permuting four letters: A,A,B,C D DCBA CDBA BCDA ACBD DCAB CDAB BCAD ACDB DBCA CBDA BDCA ABCD DBAC CBAD BDAC ABDC DABC CABD BADC ADBC DACB CADB BACD ADCB 37

38 Permuting four letters: A,A,B,C Group 1 D DCBA CDBA BCDA ACBD DCAB CDAB BCAD ACDB DBCA CBDA BDCA ABCD DBAC CBAD BDAC ABDC DABC CABD BADC ADBC DACB CADB BACD ADCB Group 2 38

39 Distinct Passcodes (revisit) Unknown numbers: The number of 4-digit different passcodes = 10 4 Exactly four different numbers: The number of 4-digit different passcodes = 4! = 24 Exactly three different numbers: The number of 4-digit different passcodes = Exactly two different numbers: The number of 4-digit different passcodes = Exactly one number: The number of 4-digit different passcodes = 1 Check: ,000

40 Need more practice? [ ] Ex: Poker Probability 40

41 [ Ex: Poker Probability 41

42 [ Ex: Poker Probability 42

43 [ Ex: Poker Probability 43

44 Binomial Theorem ( x y ) ( x y ) x1x2 x1y2 y1x2 yy 1 2 ( x y ) ( x y ) ( x y ) x1xx 2 3 xxy x1y 2x3 x1yy 2 3 yxx y1x2y3 y1y2x3 yyy x1 x2 x3 x y y y y ( x y) ( x y) xx xy yx yy x 2xy y ( x y) ( x y) ( x y) xxx xxy xyx xyy yxx yxy yyx yyy x xy 3 3xy y 2 2

45 How many chess games are possible?: A Revisit 53 [

46 Sequence A (16 pawn moves and 4 knight moves) Number of possible chess games at the end of the n-th ply (move). Often called perft(n) The name perft comes from a command in the chess playing program Crafty [

47 It all began at Cornell 55 [

48 [ IEEE Richard W. Hamming Medal Richard W. Hamming Irving S. Reed Dennis M. Ritchie and Kenneth L. Thompson Elwyn R. Berlekamp Lotfi A. Zadeh Jorma J. Rissanen Gottfried Ungerboeck Jacob Ziv Mark S. Pinsker Thomas M. Cover David D. Clark David A. Huffman Solomon W. Golomb A. G. Fraser Peter Elias Claude Berrou and Alain Glavieux Jack K. Wolf Neil J.A. Sloane Vladimir I. Levenshtein Abraham Lempel Sergio Verdú Peter Franaszek Whitfield Diffie, Martin Hellman and Ralph Merkle Toby Berger Michael Luby, Amin Shokrollahi Arthur Robert Calderbank Thomas Richardson and Rüdiger L. Urbanke 56 For contributions to coding theory and its applications to communications, computer science, mathematics and statistics.

49 57 Neil J.A. Sloane British-U.S. mathematician. Received his Ph.D. in 1967 at Cornell University. Joined AT&T Bell Labs in 1968 and retired from AT&T Labs in Major contributions are in the fields of combinatorics, errorcorrecting codes, and sphere packing. Best known for being the creator and maintainer of the On-Line Encyclopedia of Integer Sequences. [

50 How good was the Shannon s estimation? Actual number of possible games Shannon's estimates #moves

51 It is quite easy to get a better approximation Actual number of possible games Shannon's estimates Prapun's estimates #moves

Applications of Probability Theory

Applications of Probability Theory Applications of Probability Theory The subject of probability can be traced back to the 17th century when it arose out of the study of gambling games. The range of applications extends beyond games into

More information

Applications of Probability Theory

Applications of Probability Theory Applications of Probability Theory The subject of probability can be traced back to the 17th century when it arose out of the study of gambling games. The range of applications extends beyond games into

More information

elements in S. It can tricky counting up the numbers of

elements in S. It can tricky counting up the numbers of STAT-UB.003 Notes for Wednesday, 0.FEB.0. For many problems, we need to do a little counting. We try to construct a sample space S for which the elements are equally likely. Then for any event E, we will

More information

Permutations 5/5/2010. Lesson Objectives. Fundamental Counting Theorem. Fundamental Counting Theorem EXAMPLE 1 EXAMPLE 1

Permutations 5/5/2010. Lesson Objectives. Fundamental Counting Theorem. Fundamental Counting Theorem EXAMPLE 1 EXAMPLE 1 1 2 Lesson Objectives S10.2 Use the Fundamental Counting Principle to determine the number of outcomes in a problem. Use the idea of permutations to count the number of possible outcomes in a problem.

More information

S10.2 Math 2 Honors - Santowski 6/1/2011 1

S10.2 Math 2 Honors - Santowski 6/1/2011 1 S10.2 1 Use the Fundamental Counting Principle to determine the number of outcomes in a problem. Use the idea of permutations to count the number of possible outcomes in a problem. 2 It will allow us to

More information

Organization in Mathematics

Organization in Mathematics Organization in Mathematics Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November 17, 2015 1 Introduction When faced with a difficult mathematical problem, one good strategy is

More information

Ch 9.6 Counting, Permutations, and Combinations LESSONS

Ch 9.6 Counting, Permutations, and Combinations LESSONS Ch 9.6 Counting, Permutations, and Combinations SKILLS OBJECTIVES Apply the fundamental counting principle to solve counting problems. Apply permutations to solve counting problems. Apply combinations

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพ นธ ส ขสมปอง) prapun@siit.tu.ac.th 1. Intro to Digital Communication Systems 1 Office Hours: BKD, 6th floor of Sirindhralai

More information

Date Topic Notes Questions 4-8

Date Topic Notes Questions 4-8 These Combinatorics NOTES Belong to: Date Topic Notes Questions 1. Chapter Summary 2,3 2. Fundamental Counting Principle 4-8 3. Permutations 9-13 4. Permutations 14-17 5. Combinations 18-22 6. Combinations

More information

Chapter Possibilities: goes to bank, gets money from parent, gets paid; buys lunch, goes shopping, pays a bill,

Chapter Possibilities: goes to bank, gets money from parent, gets paid; buys lunch, goes shopping, pays a bill, 1.1.1: Chapter 1 1-3. Shapes (a), (c), (d), and (e) are rectangles. 1-4. a: 40 b: 6 c: 7 d: 59 1-5. a: y = x + 3 b: y =!x 2 c: y = x 2 + 3 d: y = 3x! 1 1-6. a: 22a + 28 b:!23x! 17 c: x 2 + 5x d: x 2 +

More information

Combinatorial Choreography

Combinatorial Choreography Bridges 2012: Mathematics, Music, Art, Architecture, Culture Combinatorial Choreography Tom Verhoeff Department of Mathematics and Computer Science Eindhoven University of Technology Den Dolech 2, 5612

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพ นธ ส ขสมปอง) prapun@siit.tu.ac.th 1. Intro to Digital Communication Systems 1 Office Hours: BKD, 6th floor of Sirindhralai

More information

About Permutations and Combinations: Examples

About Permutations and Combinations: Examples About Permutations and Combinations: Examples TABLE OF CONTENTS Basics... 1 Product Rule...1-2 Sum Rule...2 Permutations... 2-3 Combinations... 3-4 Pascal s Triangle... 4 Binomial Theorem.. 4 Pascal s

More information

P R O B A B I L I T Y M A T H E M A T I C S

P R O B A B I L I T Y M A T H E M A T I C S P R O B A B I L I T Y M A T H E M A T I C S A total of 15 cricketers comprised the Indian team for the ICC 2011 Cricket World Cup. Of these, 11 could play in the finals against Sri Lanka. How many different

More information

Book 9: Puzzles and Games

Book 9: Puzzles and Games Math 11 Recreation and Wellness Book 9: Puzzles and Games Name: Start Date: Completion Date: Year Overview: Earning and Spending Money Home Travel and Transportation Recreation and Wellness 1. Earning

More information

Book 9: Puzzles and Games

Book 9: Puzzles and Games Math 11 Recreation and Wellness Book 9: Puzzles and Games Teacher Version Assessments and Answers Included Year Overview: Earning and Spending Money Home Travel and Transportation Recreation and Wellness

More information

Math 167 Ch 9 Review 1 (c) Janice Epstein

Math 167 Ch 9 Review 1 (c) Janice Epstein Math 167 Ch 9 Review 1 (c) Janice Epstein CHAPTER 9 VOTING Plurality Method: Each voter votes for one candidate. The candidate with the most votes is the winner. Majority Rule: Each voter votes for one

More information

NINJA CHALLENGE INSTRUCTIONS CONTENTS

NINJA CHALLENGE INSTRUCTIONS CONTENTS 6+ COMPLIANCE WITH FCC REGULATIONS (VALID IN U.S. ONLY) This device complies with part 15 of the FCC Rules. Operation is subject to the following two conditions: (1) This device may not cause harmful interference,

More information

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that

More information

CS1800: Permutations & Combinations. Professor Kevin Gold

CS1800: Permutations & Combinations. Professor Kevin Gold CS1800: Permutations & Combinations Professor Kevin Gold Permutations A permutation is a reordering of something. In the context of counting, we re interested in the number of ways to rearrange some items.

More information

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

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

More information

Foundations of Probability Worksheet Pascal

Foundations of Probability Worksheet Pascal Foundations of Probability Worksheet Pascal The basis of probability theory can be traced back to a small set of major events that set the stage for the development of the field as a branch of mathematics.

More information

Introduction to Combinatorial Mathematics

Introduction to Combinatorial Mathematics Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 97

More information

Sixth Grade Mental Math Test #1

Sixth Grade Mental Math Test #1 Sixth Grade Mental Math Test #1 Question #1: What is the product of 0.1 times 0.2 times 0.3 times 0.4 times 0.5? Question #2: Zayn s age is twice Yolanda s age, and Yolanda s age is twice Xander s age.

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 5. Channel Coding 1 Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 14:20-15:20 Wednesday 14:20-15:20

More information

1 of 5 7/16/2009 6:57 AM Virtual Laboratories > 13. Games of Chance > 1 2 3 4 5 6 7 8 9 10 11 3. Simple Dice Games In this section, we will analyze several simple games played with dice--poker dice, chuck-a-luck,

More information

School of Electrical, Electronic & Computer Engineering

School of Electrical, Electronic & Computer Engineering School of Electrical, Electronic & Computer Engineering Fault Tolerant Techniques to Minimise the Impact of Crosstalk on Phase Basel Halak, Alex Yakovlev Technical Report Series NCL-EECE-MSD-TR-2006-115

More information

Counting integral solutions

Counting integral solutions Thought exercise 2.2 20 Counting integral solutions Question: How many non-negative integer solutions are there of x 1 +x 2 +x 3 +x 4 = 10? Thought exercise 2.2 20 Counting integral solutions Question:

More information

With Question/Answer Animations. Chapter 6

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

More information

Staircase Rook Polynomials and Cayley s Game of Mousetrap

Staircase Rook Polynomials and Cayley s Game of Mousetrap Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:

More information

CS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6

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

More information

Probability. 13 February Math 210G 13 February /21

Probability. 13 February Math 210G 13 February /21 Probability 13 February 2012 Math 210G 13 February 2012 1/21 Homework Assignment (forgot to mention last time) Assignment 3 is on the course website. Since I forgot to mention it on Friday I m pushing

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 2. Source Coding 1 Office Hours: BKD, 6th floor of Sirindhralai building Monday 10:00-10:40 Tuesday 12:00-12:40

More information

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap

European Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap European Journal of Combinatorics 30 (2009) 532 539 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Staircase rook polynomials

More information

GAME THEORY, COMPLEXITY AND SIMPLICITY

GAME THEORY, COMPLEXITY AND SIMPLICITY 1 July 8, 1997 GAME THEORY, COMPLEXITY AND SIMPLICITY Part I: A Tutorial The theory of games is now over 50 years old. Its applications and misapplications abound. It is now "respectable". Bright young

More information

Probability Theory. POLI Mathematical and Statistical Foundations. Sebastian M. Saiegh

Probability Theory. POLI Mathematical and Statistical Foundations. Sebastian M. Saiegh POLI 270 - Mathematical and Statistical Foundations Department of Political Science University California, San Diego November 11, 2010 Introduction to 1 Probability Some Background 2 3 Conditional and

More information

Topics to be covered

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

More information

4.2.4 What if both events happen?

4.2.4 What if both events happen? 4.2.4 What if both events happen? Unions, Intersections, and Complements In the mid 1600 s, a French nobleman, the Chevalier de Mere, was wondering why he was losing money on a bet that he thought was

More information

Towards temporal logic computation using DNA strand displacement reactions

Towards temporal logic computation using DNA strand displacement reactions Towards temporal logic computation using DNA strand displacement reactions Matthew R. Lakin 1,2,3 and Darko Stefanovic 2,3 1 Department of Chemical & Biological Engineering, University of New Mexico, NM,

More information

Counting in Algorithms

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

More information

Digital Communication Systems ECS 452

Digital Communication Systems ECS 452 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th Source Coding 1 Office Hours: BKD 3601-7 Monday 14:00-16:00 Wednesday 14:40-16:00 Noise & Interference Elements

More information

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

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

More information

CMath 55 PROFESSOR KENNETH A. RIBET. Final Examination May 11, :30AM 2:30PM, 100 Lewis Hall

CMath 55 PROFESSOR KENNETH A. RIBET. Final Examination May 11, :30AM 2:30PM, 100 Lewis Hall CMath 55 PROFESSOR KENNETH A. RIBET Final Examination May 11, 015 11:30AM :30PM, 100 Lewis Hall Please put away all books, calculators, cell phones and other devices. You may consult a single two-sided

More information

Lecture 18 - Counting

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

More information

Circular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo

Circular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo Circular Nim Games S. Heubach 1 M. Dufour 2 1 Dept. of Mathematics, California State University Los Angeles 2 Dept. of Mathematics, University of Quebeq, Montreal May 7, 2010 Math Colloquium, Cal Poly

More information

Combinatorial Proofs

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

More information

INDIAN STATISTICAL INSTITUTE

INDIAN STATISTICAL INSTITUTE INDIAN STATISTICAL INSTITUTE B1/BVR Probability Home Assignment 1 20-07-07 1. A poker hand means a set of five cards selected at random from usual deck of playing cards. (a) Find the probability that it

More information

PROBABILITY AND STATISTICS

PROBABILITY AND STATISTICS SOLUTIONS TO PROBABILITY AND STATISTICS WITH APPLICATIONS: A PROBLEM SOLVING TEXT SECOND EDITION Leonard A. Asimow, Ph.D., ASA Mark M. Maxwell, Ph.D., ASA ACTEX PUBLICATIONS, INC. WINSTED, CONNECTICUT

More information

LAMC Junior Circle February 3, Oleg Gleizer. Warm-up

LAMC Junior Circle February 3, Oleg Gleizer. Warm-up LAMC Junior Circle February 3, 2013 Oleg Gleizer oleg1140@gmail.com Warm-up Problem 1 Compute the following. 2 3 ( 4) + 6 2 Problem 2 Can the value of a fraction increase, if we add one to the numerator

More information

Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding

Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding Performance Evaluation of Low Density Parity Check codes with Hard and Soft decision Decoding Shalini Bahel, Jasdeep Singh Abstract The Low Density Parity Check (LDPC) codes have received a considerable

More information

ITEC 2600 Introduction to Analytical Programming. Instructor: Prof. Z. Yang Office: DB3049

ITEC 2600 Introduction to Analytical Programming. Instructor: Prof. Z. Yang Office: DB3049 ITEC 2600 Introduction to Analytical Programming Instructor: Prof. Z. Yang Office: DB3049 Lecture Eleven Monte Carlo Simulation Monte Carlo Simulation Monte Carlo simulation is a computerized mathematical

More information

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology

MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally

More information

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

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

More information

Sec.on Summary. The Product Rule The Sum Rule The Subtraction Rule (Principle of Inclusion- Exclusion)

Sec.on Summary. The Product Rule The Sum Rule The Subtraction Rule (Principle of Inclusion- Exclusion) Chapter 6 1 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and Combinations 2 Section 6.1 3

More information

Honors Precalculus Chapter 9 Summary Basic Combinatorics

Honors Precalculus Chapter 9 Summary Basic Combinatorics Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each

More information

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

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

More information

02. Probability: Intuition - Ambiguity - Absurdity - Puzzles

02. Probability: Intuition - Ambiguity - Absurdity - Puzzles University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 10-19-2015 02. Probability: Intuition - Ambiguity - Absurdity - Puzzles Gerhard Müller University

More information

Gale s Vingt-et-en. Ng P.T. 1 and Tay T.S. 2. Department of Mathematics, National University of Singapore 2, Science Drive 2, Singapore (117543)

Gale s Vingt-et-en. Ng P.T. 1 and Tay T.S. 2. Department of Mathematics, National University of Singapore 2, Science Drive 2, Singapore (117543) ABSTRACT Gale s Vingt-et-en Ng P.T. 1 and Tay T.S. 2 Department of Mathematics, National University of Singapore 2, Science Drive 2, Singapore (117543) David Gale is a professor emeritus of mathematics

More information

Counting. Chapter 6. With Question/Answer Animations

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

More information

CHAPTER 7 Probability

CHAPTER 7 Probability CHAPTER 7 Probability 7.1. Sets A set is a well-defined collection of distinct objects. Welldefined means that we can determine whether an object is an element of a set or not. Distinct means that we can

More information

Lecture Start

Lecture Start Lecture -- 4 -- Start Outline 1. Science, Method & Measurement 2. On Building An Index 3. Correlation & Causality 4. Probability & Statistics 5. Samples & Surveys 6. Experimental & Quasi-experimental Designs

More information

Poker: Probabilities of the Various Hands

Poker: Probabilities of the Various Hands Poker: Probabilities of the Various Hands 19 February 2014 Poker II 19 February 2014 1/27 Some Review from Monday There are 4 suits and 13 values. The suits are Spades Hearts Diamonds Clubs There are 13

More information

Poker: Probabilities of the Various Hands

Poker: Probabilities of the Various Hands Poker: Probabilities of the Various Hands 22 February 2012 Poker II 22 February 2012 1/27 Some Review from Monday There are 4 suits and 13 values. The suits are Spades Hearts Diamonds Clubs There are 13

More information

COMPSCI 575/MATH 513 Combinatorics and Graph Theory. Lecture #30: The Cycle Index (Tucker Section 9.3) David Mix Barrington 30 November 2016

COMPSCI 575/MATH 513 Combinatorics and Graph Theory. Lecture #30: The Cycle Index (Tucker Section 9.3) David Mix Barrington 30 November 2016 COMPSCI 575/MATH 513 Combinatorics and Graph Theory Lecture #30: The Cycle Index (Tucker Section 9.3) David Mix Barrington 30 November 2016 The Cycle Index Review Burnside s Theorem Colorings of Squares

More information

The Product Rule can be viewed as counting the number of elements in the Cartesian product of the finite sets

The Product Rule can be viewed as counting the number of elements in the Cartesian product of the finite sets Chapter 6 - Counting 6.1 - The Basics of Counting Theorem 1 (The Product Rule). If every task in a set of k tasks must be done, where the first task can be done in n 1 ways, the second in n 2 ways, and

More information

The Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you $5 that if you give me $10, I ll give you $20.)

The Teachers Circle Mar. 20, 2012 HOW TO GAMBLE IF YOU MUST (I ll bet you $5 that if you give me $10, I ll give you $20.) The Teachers Circle Mar. 2, 22 HOW TO GAMBLE IF YOU MUST (I ll bet you $ that if you give me $, I ll give you $2.) Instructor: Paul Zeitz (zeitzp@usfca.edu) Basic Laws and Definitions of Probability If

More information

Sec 5.1 The Basics of Counting

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

More information

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

UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 7 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 7 Notes Goals for this week: Unit FN Functions

More information

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

November 11, Chapter 8: Probability: The Mathematics of Chance Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.

More information

DISCRETE STRUCTURES COUNTING

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

More information

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

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

More information

Before giving a formal definition of probability, we explain some terms related to probability.

Before giving a formal definition of probability, we explain some terms related to probability. probability 22 INTRODUCTION In our day-to-day life, we come across statements such as: (i) It may rain today. (ii) Probably Rajesh will top his class. (iii) I doubt she will pass the test. (iv) It is unlikely

More information

Games in the View of Mathematics

Games in the View of Mathematics Games in the View of Mathematics Opening Training School for the UTOPIAE University of Strathclyde, Glasgow 23/11/2017 Jörg Bewersdorff http://www.bewersdorff-online.de Curriculum vitae 1975-1982 Study

More information

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY

Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY Advanced Intermediate Algebra Chapter 12 Summary INTRO TO PROBABILITY 1. Jack and Jill do not like washing dishes. They decide to use a random method to select whose turn it is. They put some red and blue

More information

1. How many diagonals does a regular pentagon have? A diagonal is a 1. diagonals line segment that joins two non-adjacent vertices.

1. How many diagonals does a regular pentagon have? A diagonal is a 1. diagonals line segment that joins two non-adjacent vertices. Blitz, Page 1 1. How many diagonals does a regular pentagon have? A diagonal is a 1. diagonals line segment that joins two non-adjacent vertices. 2. Let N = 6. Evaluate N 2 + 6N + 9. 2. 3. How many different

More information

Chapter 1. Probability

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

More information

Reading 14 : Counting

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

More information

Combined Games. Block, Alexander Huang, Boao. icamp Summer Research Program University of California, Irvine Irvine, CA

Combined Games. Block, Alexander Huang, Boao. icamp Summer Research Program University of California, Irvine Irvine, CA Combined Games Block, Alexander Huang, Boao icamp Summer Research Program University of California, Irvine Irvine, CA 92697 August 17, 2013 Abstract What happens when you play Chess and Tic-Tac-Toe at

More information

Y8 & Y9 Number Starters A Spire Maths Activity

Y8 & Y9 Number Starters A Spire Maths Activity Y8 & Y9 Number Starters A Spire Maths Activity https://spiremaths.co.uk/ia/ There are 21 Number Interactives: each with three levels. The titles of the interactives are given below. Brief teacher notes

More information

Discrete Structures Lecture Permutations and Combinations

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

More information

CSC/MTH 231 Discrete Structures II Spring, Homework 5

CSC/MTH 231 Discrete Structures II Spring, Homework 5 CSC/MTH 231 Discrete Structures II Spring, 2010 Homework 5 Name 1. A six sided die D (with sides numbered 1, 2, 3, 4, 5, 6) is thrown once. a. What is the probability that a 3 is thrown? b. What is the

More information

DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics

DISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics DISCUSSION #8 FRIDAY MAY 25 TH 2007 Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics 2 Homework 8 Hints and Examples 3 Section 5.4 Binomial Coefficients Binomial Theorem 4 Example: j j n n

More information

Section 14.3 Partial Derivatives

Section 14.3 Partial Derivatives Section 14.3 Partial Derivatives Ruipeng Shen March 20 1 Basic Conceptions If f(x, y) is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant.

More information

1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.

1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000. CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today

More information

Part I. First Notions

Part I. First Notions Part I First Notions 1 Introduction In their great variety, from contests of global significance such as a championship match or the election of a president down to a coin flip or a show of hands, games

More information

S Coding Methods (5 cr) P. Prerequisites. Literature (1) Contents

S Coding Methods (5 cr) P. Prerequisites. Literature (1) Contents S-72.3410 Introduction 1 S-72.3410 Introduction 3 S-72.3410 Coding Methods (5 cr) P Lectures: Mondays 9 12, room E110, and Wednesdays 9 12, hall S4 (on January 30th this lecture will be held in E111!)

More information

Week 1: Probability models and counting

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

More information

Contents of this Document [ntc2]

Contents of this Document [ntc2] Contents of this Document [ntc2] 2. Probability: Intuition - Ambiguity - Absurdity - Puzzles Regular versus random schedules [nln40] Pick the winning die [nex2] Educated guess [nex4] Coincident birthdays

More information

QUESTION 4(1) 4(F) 5(1) 5(F) 6(1) 6(F) 7(1) 7(F) VRAAG

QUESTION 4(1) 4(F) 5(1) 5(F) 6(1) 6(F) 7(1) 7(F) VRAAG MEMORANDUM 20 QUESTION () (F) 5() 5(F) 6() 6(F) 7() 7(F) VRAAG D E C A B B B A 2 B B B B A B C D 2 A B C A E C B B E C C B E E A C 5 C C C E E D A B 5 6 E B D B D C D D 6 7 D C B B D A A B 7 8 B B E A

More information

Discrete probability and the laws of chance

Discrete probability and the laws of chance Chapter 8 Discrete probability and the laws of chance 8.1 Multiple Events and Combined Probabilities 1 Determine the probability of each of the following events assuming that the die has equal probability

More information

Midterm practice super-problems

Midterm practice super-problems Midterm practice super-problems These problems are definitely harder than the midterm (even the ones without ), so if you solve them you should have no problem at all with the exam. However be aware that

More information

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)

CSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n

More information

Chapter 1. Probability

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

More information

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 Today: Introductory comments Some example problems Announcements course information sheet online (from my personal homepage: Rogaway ) first HW due Wednesday

More information

IEEE C /02R1. IEEE Mobile Broadband Wireless Access <http://grouper.ieee.org/groups/802/mbwa>

IEEE C /02R1. IEEE Mobile Broadband Wireless Access <http://grouper.ieee.org/groups/802/mbwa> 23--29 IEEE C82.2-3/2R Project Title Date Submitted IEEE 82.2 Mobile Broadband Wireless Access Soft Iterative Decoding for Mobile Wireless Communications 23--29

More information

Elementary Combinatorics

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

More information

COUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen

COUNTING TECHNIQUES. Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen COUNTING TECHNIQUES Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen COMBINATORICS the study of arrangements of objects, is an important part of discrete mathematics. Counting Introduction

More information

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

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

More information

Grade 7/8 Math Circles November 8 & 9, Combinatorial Counting

Grade 7/8 Math Circles November 8 & 9, Combinatorial Counting Faculty of Mathematics Waterloo, Ontario NL G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 8 & 9, 016 Combinatorial Counting Learning How to Count (In a New Way!)

More information

6. Methods of Experimental Control. Chapter 6: Control Problems in Experimental Research

6. Methods of Experimental Control. Chapter 6: Control Problems in Experimental Research 6. Methods of Experimental Control Chapter 6: Control Problems in Experimental Research 1 Goals Understand: Advantages/disadvantages of within- and between-subjects experimental designs Methods of controlling

More information