I don't know where to post this question, so I am posting it here.
Take any n points in a plane and let D and d be the greatest and least distances determined by points of this set. Prove that 2D > sqrt(3) [sqrt(n)-1]d.
If it is easy, give hint.
I don't know where to post this question, so I am posting it here.
Take any n points in a plane and let D and d be the greatest and least distances determined by points of this set. Prove that 2D > sqrt(3) [sqrt(n)-1]d.
If it is easy, give hint.
malaygoel.
Please do not make begging posts, everyone can see your question.
---
I was not able to find a way, but I was thinking maybe you can use induction. Assume it works for then it must work for . The first case with is clearly true because it leads to,
Which is clearly true because,
But for I was having difficulty.
---
How do you know that this inequality is true?
Is it a known theorem?