How to verify Eulers Theory
显示 更早的评论
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
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
2013-6-10
Walter Roberson
2013-6-10
Providing complete homework solutions is not advised.
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Programming 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
