Portal 2

Portal 2

Not enough ratings
Buton
   
Award
Favorite
Favorited
Unfavorite

Subscribe to download
Buton

Description
If n is the number of butons in this test chamber, n is greater than, or equal, to one. This is provable using induction. If n=1, then this statement is true. If we then assume that n=k, it can then be shown n=k+1 is true using algebra far more advanced than you can understand. As such there are infinitely many butons in this chamber.

Other than butons, there may be a non-zero number of buttons, jumping and deadly goo pits in these chamber