把“一个城市住着8位朋友”这题
http://www.ddhw.com/listo.aspx?topic_id=9&msg_id=8461&level_string=0&page=1
简化并且特殊化后,看哪位高手能给出解来。
平面上有三个点:(0, 0),(0, 1),(1, 0)。在这平面上找一点,使它到这三点的距离总和尽可能地小。
(x2+y2+ax+b)0.5+(x2+y2+cx+d)0.5+……=最小 难道要求导数? |
For easy calculation, consider the problem with triangle of vertices (-1,0) (1,0), (0,1). By symmetry, we can argue (might not be straightforward to prove), the solution lies on the Y axis. The sum of distance from (0,y) to the vertices is f(y) = (1-y) + 2sqrt(y^2+1) set the derivative to 0 to get y = 1/sqrt(3). Then do a rotation and scale (with factor 1/sqrt(2)) to get solution to the original problem: (1/2(1-1/sqrt(3)), 1/2(1-1/sqrt(3))) |
欢迎光临 珍珠湾ART (http://zzwav.com/) | Powered by Discuz! X3 |