All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
A geometric gangster shooting (Posted on 2019-05-06) Difficulty: 3 of 5
Ten gangsters are standing on a flat surface, and the distances between them are all distinct. Suddenly, each of them fatally shoots the one among the other nine gangsters that is the nearest. What is the maximum possible number of surviving gangsters?

No Solution Yet Submitted by Danish Ahmed Khan    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): A guess (spoiler?) | Comment 4 of 6 |
(In reply to re: A guess (spoiler?) by Jer)

Oh, I see each of the three inner gangsters is necessary to be a target for either three or one of the outer gangsters, regardless of their shootings among themselves, so indeed only the outer 7 can survive.
  Posted by Charlie on 2019-05-06 18:21:38

Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information