Difference between revisions of "Georgeooga-Harryooga Theorem"
Redfiretruck (talk | contribs) (→Proof 1) |
Redfiretruck (talk | contribs) (→Proof 1) |
||
Line 8: | Line 8: | ||
==Proof 1== | ==Proof 1== | ||
Let our group of <math>a</math> objects be represented like so <math>1</math>, <math>2</math>, <math>3</math>, ..., <math>a-1</math>, <math>a</math>. Let the last <math>b</math> objects be the ones we can't have together. | Let our group of <math>a</math> objects be represented like so <math>1</math>, <math>2</math>, <math>3</math>, ..., <math>a-1</math>, <math>a</math>. Let the last <math>b</math> objects be the ones we can't have together. | ||
− | |||
Then we can organize our objects like so <math>\square1\square2\square3\square...\square a-b-1\square a-b\square</math> | Then we can organize our objects like so <math>\square1\square2\square3\square...\square a-b-1\square a-b\square</math> | ||
− | |||
We have <math>(a-b)!</math> ways to arrange the objects in that list. | We have <math>(a-b)!</math> ways to arrange the objects in that list. | ||
− | |||
Now we have <math>a-b+1</math> blanks and <math>b</math> other objects so we have <math>_{a-b+1}P_{b}=\frac{(a-b+1)!}{(a-2b+1)!}</math> ways to arrange the objects we can't put together. | Now we have <math>a-b+1</math> blanks and <math>b</math> other objects so we have <math>_{a-b+1}P_{b}=\frac{(a-b+1)!}{(a-2b+1)!}</math> ways to arrange the objects we can't put together. | ||
− | |||
By fundamental counting principal our answer is <math>\frac{(a-b)!(a-b+1)!}{(a-2b+1)!}</math>. | By fundamental counting principal our answer is <math>\frac{(a-b)!(a-b+1)!}{(a-2b+1)!}</math>. | ||
Proof by RedFireTruck | Proof by RedFireTruck |
Revision as of 09:36, 18 November 2020
Definition
The Georgeooga-Harryooga Theorem states that if you have distinguishable objects and of them cannot be together, then there are ways to arrange the objects.
Created by George and Harry of The Ooga Booga Tribe of The Caveman Society
Proofs
Proof 1
Let our group of objects be represented like so , , , ..., , . Let the last objects be the ones we can't have together. Then we can organize our objects like so We have ways to arrange the objects in that list. Now we have blanks and other objects so we have ways to arrange the objects we can't put together. By fundamental counting principal our answer is .
Proof by RedFireTruck