![]() |
BragGame |
|
( c ) base case trivial. For induction, suppose it holds for N players and Alice is The One and an arrow means "win"
A player Bob enters. Break down all the cases. Case 1, . Then Alice is still The One Case 2, and , then Alice is still The One Case 3, and . Because , it must be Bob wins some y who wins x. Then Bob is The One (b) Not sure what is being asked (just show an example or describe all the cases). A only one The One set up is like this. For N players are and set up .Then is the only The One. A new N+1 player Bob enters. If the new arrows introduced by Bob are and and others arrows related to Bob are arbitrary, then still only one The One which is
|
|