Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tootie
on July 9, 2017
|
parent
|
context
|
favorite
| on:
Counterintuitive problem: People in a room keep gi...
Put another way, the key is that for n people and n dollars, you can receive up to n-1 dollars in a given turn, but you can only ever lose 1. Therefore, whoever is lucky early will accumulate faster than they can distribute.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: