How to verify Eulers Theory

3 次查看（过去 30 天）
Chris
Chris 2013-6-10
The mathematician Euler proved the following:
pi^2/6= 1+1/4+1/9+1/16 ...
Rather than finding a mathematical proof for this, verify whether the conjecture seems to be true or not by writing a loop until the sum is close to pi^2/6
I have trouble understanding loops. help please!

请先登录，再回答此问题。

采纳的回答

Julius
Julius 2013-6-10
sum = 0;
threshold = 1e-6;
for ii = 1 : 1 : 100000
sum = sum + 1/ii^2;
if abs(sum - pi^2/6) <= threshold
break;
end
end
disp(sprintf('%s iterations needed to approach pi^2/6',num2str(ii)));
  2 个评论
Chris
Chris 2013-6-10
could you explain what you did there? what exactly is the threshold and what did you do in line 5?
Walter Roberson
Walter Roberson 2013-6-10
Providing complete homework solutions is not advised.

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Loops and Conditional Statements 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by