Lesson 51.notebook 1 December 18, 2015 100 200 10,000 Yes ? ? ?
Lesson 51.notebook
1
December 18, 2015
100200
10,000Yes
??
?
Lesson 51.notebook
2
December 18, 2015
***Just discuss this; you don’t have to write anything.
Lesson 51.notebook
3
December 18, 2015
Lesson 51.notebook
4
December 18, 2015
Lesson 51.notebook
5
December 18, 2015
Lesson 51.notebook
6
December 18, 2015
Lesson 51.notebook
7
December 18, 2015
Vocabulary:Multiplication Principle of CountingIf you want to count all the outcomes from a sequence of tasks, count how many outcomes there are from each task and multiply those numbers together. More precisely, suppose the first task in a sequence has n1 outcomes; for each of these, the second task has n2 outcomes; for each of these, the third task has n3 outcomes; and so on. Then the number of possible combined outcomes from the whole sequence of tasks is n1 × n2 × n3 × … .
Addition Principle of CountingThe total number of outcomes among two tasks is the sum of the number of outcomes from each task ﴾minus the number of outcomes that are common to both tasks, if there are any﴿.
Lesson 51.notebook
8
December 18, 2015
George BooleEnglish Mathematician & Philosopher
Logic"Founder of the Field of Computer Science"
1815 1864
Lesson 51.notebook
9
December 18, 2015
Lesson 51.notebook
10
December 18, 2015
Lesson 51.notebook
11
December 18, 2015
Lesson 51 Homework Answers: 1, 2, 3, 5, 6, 13, 14, 17
http://www.youtube.com/watch?v=ETsfylK7kzMBinary?
128 64 32 16 8 4 2 1 27 26 25 24 23 22 21 20
Look . . .
Lesson 51.notebook
12
December 18, 2015
Lesson 51.notebook
13
December 18, 2015
Lesson 51.notebook
14
December 18, 2015