55 gangsters shoot the nearest gangster to them, where all the distances between them are different. Prove that at least one gangster will survive. – math.stackexchange.com

55 gangsters shoot the nearest gangster to them, where all the distances between them are different. Prove that at least one gangster will survive. – math.stackexchange.com

17:14 No Comments
My thinking was that if gangster A shoots gangster B, then gangster B will also shoot gangster A since they are the closest together, forming a pair. Since 55 is odd, then one must survive since 55 is ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Unknown

0 Comment to "55 gangsters shoot the nearest gangster to them, where all the distances between them are different. Prove that at least one gangster will survive. – math.stackexchange.com"

Post a Comment

Subscribe to: Post Comments (Atom)