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: A guess (spoiler?) | Comment 2 of 6 |
(In reply to A guess (spoiler?) by Steve Herman)

I agree with everything you say except 7 survivors is not difficult.


Place 7 gangsters at the vertices of a regular heptagon.  Draw a circle from each to his neighbors.  This gives 7 regions (skinny footballs) that the remaining gangsters go.  They do need to be placed close to the center.  

Then move the outer gangsters by epsilons so the distances are unique. 

  Posted by Jer on 2019-05-06 12:25:03
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information