珍珠湾ART

标题: n (n>2) points on the plane, [打印本页]

作者: yma16 时间: 2005-9-12 00:04
标题: n (n>2) points on the plane,

no three are colinear. Can they always form a polygon (meaning the polygon uses them as the vertices)?

作者: husonghu 时间: 2005-9-12 00:38
标题: I would guess so. Are there any exceptions?

I would guess so. Are there any exceptions?

作者: yma16 时间: 2005-9-12 03:22
标题: Me too. How to prove it? -eom

Me too. How to prove it? -eom

作者: husonghu 时间: 2005-9-12 03:39
标题: I don't know. See if 野菜花or其他高手 can help.[:P][:)]

I don't know. See if 野菜花or其他高手 can help.

作者: 乱弹 时间: 2005-9-12 04:32
标题: Hasn't it been solved at WXC?[;)]

作者: yma16 时间: 2005-9-12 06:38
标题: Yes - I posted it here so this board can try it.

Yes - I posted it here so this board can try it.

欢迎光临珍珠湾ART (http://zzwav.com/)