Difference between revisions of "The 2 foundational ways of counting/Statements"
From Maths
(Created page with "<noinclude> __TOC__ ==Foundations== </noinclude> Let us be given two decisions: * The first, {{M|A}}, for which we have {{M|m\in\mathbb{N}_{\ge 0} }} outcomes<ref group="Note"...") |
m |
||
Line 13: | Line 13: | ||
If we must choose once from {{M|A}} and once from {{M|B}}, then the number of outcomes, {{M|\mathcal{O}\in\mathbb{N}_{\ge 0} }} is: | If we must choose once from {{M|A}} and once from {{M|B}}, then the number of outcomes, {{M|\mathcal{O}\in\mathbb{N}_{\ge 0} }} is: | ||
* {{M|\mathcal{O}:\eq mn}} | * {{M|\mathcal{O}:\eq mn}} | ||
+ | {{Caveat|Assume we always choose from {{M|A}} first}}, this is poorly formulated. suppose if we choose {{M|B}} first from options 1 to 6 inclusive, then we choose {{M|A}} from 7 to 12 inclusive, if we choose {{M|A}} first from 1 to 6 inclusive then we choose {{M|B}} from 7-12 inclusive then we have: | ||
+ | * {{M|\underbrace{6\times 6}_{\text{B then A} }+\underbrace{6\times 6}_{\text{A then B} } \eq 72}} ways to choose, as the set of options changes depending on whether we do {{M|B}} or {{m|A}} first - any formalism must account for this. | ||
+ | * However we must allow for some freedom, suppose we must choose two numbers from 1 to 6 inclusive, ''without'' replacement. For the first choice we can choose from 6 things, no matter what we pick for the first, the second choice is left with only 5 options. A different 5 options for each outcome of {{M|A}}, for example if {{M|A\eq 1}} then the second choice has 2 to 6 as its options, if {{M|A\eq 6}} then the second choice has 1 to 5 as its options, different from 2 to 6 | ||
===Xor=== | ===Xor=== | ||
If we must choose from either {{M|A}} or {{M|B}} - but not both, then the number of outcomes, {{M|\mathcal{O}\in\mathbb{N}_{\ge 0} }} is: | If we must choose from either {{M|A}} or {{M|B}} - but not both, then the number of outcomes, {{M|\mathcal{O}\in\mathbb{N}_{\ge 0} }} is: |
Revision as of 08:35, 31 August 2018
Contents
[hide]Foundations
Let us be given two decisions:
- The first, A, for which we have m∈N≥0 outcomes[Note 1]
- The second, B, for which we have n∈N≥0 outcomes.
We require that:
- There always be m options for A and n options for B irrespective of which we decide first, and irrespective of what we decide first.
- This does not mean the options cannot be different depending on which we tackle first and what we select, just that there must always be m for A and n for B
Then:
And
If we must choose once from A and once from B, then the number of outcomes, O∈N≥0 is:
- O:=mn
Caveat:Assume we always choose from A first, this is poorly formulated. suppose if we choose B first from options 1 to 6 inclusive, then we choose A from 7 to 12 inclusive, if we choose A first from 1 to 6 inclusive then we choose B from 7-12 inclusive then we have:
- 6×6⏟B then A+6×6⏟A then B=72 ways to choose, as the set of options changes depending on whether we do B or A first - any formalism must account for this.
- However we must allow for some freedom, suppose we must choose two numbers from 1 to 6 inclusive, without replacement. For the first choice we can choose from 6 things, no matter what we pick for the first, the second choice is left with only 5 options. A different 5 options for each outcome of A, for example if A=1 then the second choice has 2 to 6 as its options, if A=6 then the second choice has 1 to 5 as its options, different from 2 to 6
Xor
If we must choose from either A or B - but not both, then the number of outcomes, O∈N≥0 is:
- O:=m+n
Notes
- Jump up ↑ Notice we allow m=0 to be, and later also for n=0. A choice with nothing to choose from is not a decision at all, so zero has meaning
References