Difference between revisions of "Cooga Georgeooga-Harryooga Theorem"
Redfiretruck (talk | contribs) |
Redfiretruck (talk | contribs) (→Proof 1) |
||
Line 11: | Line 11: | ||
Then we can organize our objects like so <asy> | Then we can organize our objects like so <asy> | ||
label("$1$", dir(90)); | label("$1$", dir(90)); | ||
− | label(" | + | label("_", dir(60)); |
label("$2$", dir(30)); | label("$2$", dir(30)); | ||
− | label(" | + | label("_", dir(0)); |
label("$3$", dir(-30)); | label("$3$", dir(-30)); | ||
− | label(" | + | label("_", dir(-60)); |
label("$\dots$", dir(-90)); | label("$\dots$", dir(-90)); | ||
− | label(" | + | label("_", dir(-120)); |
label("$a-b-1$", dir(-150)); | label("$a-b-1$", dir(-150)); | ||
− | label(" | + | label("_", dir(-180)); |
label("$a-b$", dir(-210)); | label("$a-b$", dir(-210)); | ||
− | label(" | + | label("_", dir(-240)); |
</asy> | </asy> | ||
Revision as of 18:34, 31 January 2021
Contents
Definition
The Cooga Georgeooga-Harryooga Theorem (Circular Georgeooga-Harryooga Theorem) states that if you have distinguishable objects and objects are kept away from each other, then there are ways to arrange the objects in a circle.
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
label("$1$", dir(90)); label("_", dir(60)); label("$2$", dir(30)); label("_", dir(0)); label("$3$", dir(-30)); label("_", dir(-60)); label("$\dots$", dir(-90)); label("_", dir(-120)); label("$a-b-1$", dir(-150)); label("_", dir(-180)); label("$a-b$", dir(-210)); label("_", dir(-240)); (Error making remote request. Unknown error_msg)
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