珍珠湾ART

标题: 组合问题 by 乱弹 [打印本页]

作者: fzy 时间: 2005-2-24 22:22
标题: 组合问题 by 乱弹

n!/1个1，n!/2个2，。。。，n!/n个n
这些数能否分成n!组，使每组的和是n
证明或反证

This problem was first posted at WXC by 乱弹 several months ago. It was ignored then and later caused some problems, as stated by himself recently, about "谁是中文网第一数学论坛". It reappeared there three days ago, but still no answer as of now.

作者: 乱弹 时间: 2005-2-24 23:06
标题: Hehe.. I know you've solved it. [@};-][@};-]

That is a beautiful solution. I am glad that somebody still remembers this problem and reposted it at WXC.

Hope people from here, QQSH and WXC can find some general rules for this kind of problem.

作者: fzy 时间: 2005-2-24 23:43
标题: 回复：Hehe.. I know you've solved it. [@};-][@};-]

That kind of solution does not come very often. And one has to say something after having one. That caused all the problems. I have become much more careful after that.

作者: fzy 时间: 2005-2-25 18:49
标题: There's still time

Some hints came out at WXC, but still no solution yet.

作者: 乱弹 时间: 2005-2-25 20:58
标题: 哈哈. With the hint, one solution can come

out easily.

I wrote the problem to meet the CMO problem and did not expect it to hae a contact with group theory.

As for the problems you mentioned in the other post, I think some person was too sensitive. Whoever solved the problem should get excited. So there should have been no problems.

You might generalize your solution to solve a generalized problem. I have not had deep thought about it though.

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