The 6 primitives of counting

From Maths
Jump to: navigation, search
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
The 4 primitives are choosing with replacement, without replacement [ilmath]\times[/ilmath] where order matters, or does not matter. Also:
  • I need to define formally some (suitable) notion of decision or choice, to then back with set theory, as the caveats below make clear we need Alec (talk) 08:46, 31 August 2018 (UTC)


Let us be given two decisions:

  • The first, [ilmath]A[/ilmath], for which we have [ilmath]m\in\mathbb{N}_{\ge 0} [/ilmath] outcomes[Note 1]
  • The second, [ilmath]B[/ilmath], for which we have [ilmath]n\in\mathbb{N}_{\ge 0} [/ilmath] outcomes.

We require that:

  • There always be [ilmath]m[/ilmath] options for [ilmath]A[/ilmath] and [ilmath]n[/ilmath] options for [ilmath]B[/ilmath] 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 [ilmath]m[/ilmath] for [ilmath]A[/ilmath] and [ilmath]n[/ilmath] for [ilmath]B[/ilmath]



If we must choose once from [ilmath]A[/ilmath] and once from [ilmath]B[/ilmath], then the number of outcomes, [ilmath]\mathcal{O}\in\mathbb{N}_{\ge 0} [/ilmath] is:

  • [ilmath]\mathcal{O}:\eq mn[/ilmath]

Caveat:Assume we always choose from [ilmath]A[/ilmath] first, this is poorly formulated. suppose if we choose [ilmath]B[/ilmath] first from options 1 to 6 inclusive, then we choose [ilmath]A[/ilmath] from 7 to 12 inclusive, if we choose [ilmath]A[/ilmath] first from 1 to 6 inclusive then we choose [ilmath]B[/ilmath] from 7-12 inclusive then we have:

  • [ilmath]\underbrace{6\times 6}_{\text{B then A} }+\underbrace{6\times 6}_{\text{A then B} } \eq 72[/ilmath] ways to choose, as the set of options changes depending on whether we do [ilmath]B[/ilmath] or [ilmath]A[/ilmath] 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 [ilmath]A[/ilmath], for example if [ilmath]A\eq 1[/ilmath] then the second choice has 2 to 6 as its options, if [ilmath]A\eq 6[/ilmath] then the second choice has 1 to 5 as its options, different from 2 to 6


If we must choose from either [ilmath]A[/ilmath] or [ilmath]B[/ilmath] - but not both, then the number of outcomes, [ilmath]\mathcal{O}\in\mathbb{N}_{\ge 0} [/ilmath] is:

  • [ilmath]\mathcal{O}:\eq m+n[/ilmath]
  • Caveat:Consider the case where: [ilmath]A[/ilmath] is a choice from 1 to 5 inclusive, and [ilmath]B[/ilmath] is a choice from 5 to 10 (note the 6 outcomes, 5,6,7,8,9 or 10) inclusive, if we use the disjoint union for the set of outcomes, we get 11 outcomes, which correspond to [ilmath](A,1),\ldots,(A,5),(B,5),(B,6),\ldots,(B,10)[/ilmath], if we use just the union then the outcomes are 1,2,3,4,5,6,7,8,9,10 - 10 outcomes. So again this needs to be defined better.


The 4 primitive ways of counting/Statements


  1. Notice we allow [ilmath]m\eq 0[/ilmath] to be, and later also for [ilmath]n\eq 0[/ilmath]. A choice with nothing to choose from is not a decision at all, so zero has meaning