﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-richard-desktop-文章分类-数学</title><link>http://www.cppblog.com/rchard/category/12798.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 10 Jan 2010 09:04:12 GMT</lastBuildDate><pubDate>Sun, 10 Jan 2010 09:04:12 GMT</pubDate><ttl>60</ttl><item><title>求正整数集合使得元素之和等于元素之积</title><link>http://www.cppblog.com/rchard/articles/105339.html</link><dc:creator>Wentai ZHANG</dc:creator><author>Wentai ZHANG</author><pubDate>Sun, 10 Jan 2010 08:38:00 GMT</pubDate><guid>http://www.cppblog.com/rchard/articles/105339.html</guid><wfw:comment>http://www.cppblog.com/rchard/comments/105339.html</wfw:comment><comments>http://www.cppblog.com/rchard/articles/105339.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/rchard/comments/commentRss/105339.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/rchard/services/trackbacks/105339.html</trackback:ping><description><![CDATA[这是一个一个比较有意思的正整数性质的应用。我们应该可以迅速找到一个解{1,2,3}，但是要讨论所有的情况来说明这个解的唯一性，我们需要做出一些假设。<br>令这个集合为S={x<sub>1</sub>,...,x<sub>n</sub>}，这里n&gt;1，0&lt;x<sub>1</sub>&lt;...&lt;x<sub>n</sub>。我们得到nx<sub>1</sub>&lt;x<sub>1</sub>...x<sub>n</sub>&lt;nx<sub>n</sub>，于是x<sub>1</sub>...x<sub>n</sub>&lt;n，而x<sub>1</sub>...x<sub>n-1</sub>&gt;=(n-1)!，所以n&gt;(n-1)!&gt;(n-1)(n-2)，解得2-&#8730;x&lt;n&lt;2+&#8730;2，于是n=2或3。又x<sub>1</sub>+...+x<sub>n</sub>=x<sub>1</sub>...x<sub>n</sub>，解得n=2时x<sub>1</sub>=x<sub>2</sub>=2，舍弃，所以n=3，易解得x<sub>1</sub>=1,x<sub>2</sub>=2,x<sub>3</sub>=3。问题得解。<br><img src ="http://www.cppblog.com/rchard/aggbug/105339.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/rchard/" target="_blank">Wentai ZHANG</a> 2010-01-10 16:38 <a href="http://www.cppblog.com/rchard/articles/105339.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>