I'm doing lists and logic in maths.
So I'm reading about subsets and their combinations.
S = {a, b, c}
Subsets are:
{}, {a}, {b}, {c}, {ab}, {ac}, {bc}, {a, b, c}
So I figure, who wants to count combinations?
Why not factorialise this?
S = {a, b, c}, count conversion {1st element, 2nd element, 3rd element}
countS = e! + 2
The "+2" comes from the null set and the total number of elements.
I know how to apply math. Isn't this cool?
Next time I'll brag about knowing the alphabet.
So I'm reading about subsets and their combinations.
S = {a, b, c}
Subsets are:
{}, {a}, {b}, {c}, {ab}, {ac}, {bc}, {a, b, c}
So I figure, who wants to count combinations?
Why not factorialise this?
S = {a, b, c}, count conversion {1st element, 2nd element, 3rd element}
countS = e! + 2
The "+2" comes from the null set and the total number of elements.
I know how to apply math. Isn't this cool?
Next time I'll brag about knowing the alphabet.