How to verify Eulers Theory

2 visualizaciones (últimos 30 días)
Chris
Chris el 10 de Jun. de 2013
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!

Respuesta aceptada

Julius
Julius el 10 de Jun. de 2013
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 comentarios
Chris
Chris el 10 de Jun. de 2013
could you explain what you did there? what exactly is the threshold and what did you do in line 5?
Walter Roberson
Walter Roberson el 10 de Jun. de 2013
Providing complete homework solutions is not advised.

Iniciar sesión para comentar.

Más respuestas (0)

Categorías

Más información sobre Loops and Conditional Statements en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by