Ask your own question, for FREE!
Geometry 27 Online
OpenStudy (anonymous):

Gansters in Geometry

OpenStudy (anonymous):

I don'y know about gangster but I'm in geometry :)

OpenStudy (anonymous):

don't*

OpenStudy (anonymous):

Ten gangsters are standing on a flat surface, and the distances between them are all distinct. At twelve o’clock, when the church bells start chiming, each of them fatally shoots the one among the other nine gangsters who is the nearest. At least how many gangsters will be killed?

OpenStudy (anonymous):

lol

OpenStudy (anonymous):

problem asked in IRAN 2000 MATH olympiad

OpenStudy (anonymous):

IMO

OpenStudy (anonymous):

HINT "the problem can be reapeted as" Given a set S of ten points in the plane such that the distances between them are all distinct, for each point P ∈ S we mark the point Q ∈ S \ {P} nearest to P. Find the least possible number of marked points.

OpenStudy (anonymous):

i there any one who wants to see the solution

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!