What if 100 of our favorite YouTube channels faced sudden, total demonetization of their channels — and the only way to save them was to play a game of chance that required all 100 YouTubers to win what amounts to a coin flip?
If that sounds hopeless, that’s because it pretty much is.
The odds against 100 successful rounds are astronomical, but that’s the scenario in our version of a computer science problem with roots going back to 2004. Exploring the possibilities of combinatorics and the context of permutations allows us to vastly improve the odds of our 100 YouTubers’ overall success *without* improving their individual chances. By recognizing that the game actually contains a series of chains within each permutation, I develop a strategy for our 100 YouTube heroes that will vault their chances of keeping their channels from being demonetized all the way from impossible to… surprisingly good.
All 100 YouTubers
*** SOURCES ***
“The Cell Probe Complexity of Succinct Data Structures,” Anna Gál and Peter Bro Miltersen: :http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.85.4990&rep=rep1&type=pdf
DataGenetics, “100 Prisoners Escape Puzzle”: http://datagenetics.com/blog/december42014/index.html
Richard P. Stanley, “Algebraic Combinatorics: Walks, Trees, Tableaux, and More”: https://www.amazon.com/Algebraic-Combinatorics-Tableaux-Undergraduate-Mathematics/dp/146146997X
*** LINKS ***
Hosted and Produced by Kevin Lieber
Research And Writing by Matthew Tabor
Tweets by TaborTCU
Editing by Aspect Science
Huge Thanks To Paula Lieber
Get Vsauce’s favorite science and math toys delivered to your door!
Select Music By Jake Chudnow: http://www.youtube.com/user/JakeChudnow
Montage Song: https://www.youtube.com/watch?v=KV6XksdotX8