TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Feynman on Fermat's Last Theorem (2016)

101 点作者 balele超过 6 年前

5 条评论

ColinWright超过 6 年前
Previously discussed:<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=16041560" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=16041560</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14940636" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14940636</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14355834" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=14355834</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=12018221" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=12018221</a><p>... and previously submitted without discussion:<p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=17581023" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=17581023</a><p><a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=15904199" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=15904199</a>
评论 #19135708 未加载
x3tm超过 6 年前
&gt; Feynman concluded: “for my money Fermat’s theorem is true”. &gt; &quot;the main job of theoretical physics is to prove yourself wrong as soon as possible.&quot;<p>Great example of the main difference between mathematicians and theoretical physicists .<p>This reminds me of another magician, Enrico Fermi, who was also an extremely good mathematician but didn&#x27;t pursue rigor or precision for the sake of it: 20% was good enough precision for him for most cases.
评论 #19134439 未加载
评论 #19137409 未加载
jordigh超过 6 年前
This proof (or &quot;plausibility argument&quot;) bugs me so much. Just because something thins out and becomes rare doesn&#x27;t mean it doesn&#x27;t exist.<p>As n gets bigger, the probability of n being a perfect square gets smaller and smaller. In the limit, the probability is zero.<p>Does this mean square numbers don&#x27;t exist?
评论 #19134538 未加载
评论 #19134977 未加载
评论 #19135879 未加载
评论 #19134448 未加载
syn0byte超过 6 年前
Is anyone still trying to come up with Fermat&#x27;s original &quot;truly marvelous proof&quot;? Or have math folk talked themselves out of its possible existence?
评论 #19134876 未加载
评论 #19134904 未加载
评论 #19134879 未加载
评论 #19135724 未加载
ox_n超过 6 年前
_DON&#x27;T DOWN VOTE JUST BECAUSE YOU CAN&#x27;T DO MATH_<p>The proof Fermat hinted to was about the difference between squares. All whole numbers taken to a power greater than two (n^3) can be represented as the difference between two whole squares (x^2 - y^2). These differences can then be shown as the sum of consecutive odd numbers:<p><pre><code> 2^3 = 3^2 - 1^2 = (1+3+5) - (1) = 8, 3^3 = 6^2 - 3^2 = (1+3+5+7+9+11) - (1+3+5) = 27, 4^3 = 10^2 - 6^2 = (1+3+5+7+9+11+13+15+17+19) - (1+3+5+7+9+11) = 64 5^3 = 15^2 - 10^2 = (21+23+25+27+29) = 125 </code></pre> When you examine the odd number series that results from each base, you&#x27;ll discover that there will always be a gap if you try and combine two odd number series together, which explains Fermat&#x27;s little joke about margins. The same trick works for higher powers.<p>It&#x27;s not that hard people. Stop believing everything you&#x27;re told about how &quot;hard&quot; something is.<p><i></i><i>HINT:</i><i></i> The number of odd numbers in the series exactly matches the starting square base number
评论 #19134690 未加载
评论 #19134602 未加载
评论 #19134462 未加载
评论 #19139879 未加载
评论 #19134447 未加载
评论 #19134441 未加载
评论 #19134403 未加载
评论 #19134489 未加载