The most accurate integral for the value of pi

stef.grob
Messages
1
Reaction score
0
Hey all we doing some work with integrals and Our lecturar mentioned that one can get a answer for pi using integrating, my question is what would that integral be, and wot is the most accurate? I've gotten it till 3 decimal places.
 
Physics news on Phys.org
Floating-point algorithms for computing pi are usually infinitely accurate and precise -- if you give the algorithm a tolerance a, it will give you a floating-point number within the interval (pi-a, pi+a).

It's just that if the tolerance is small, it takes a lot of work.

This is actually one of the things you learn in calculus class. You know, for example:
\int_0^1 \sqrt{1 - x^2} \, dx = \frac{\pi}{4}

If you wanted to apply Simpson's rule to this integral to compute, say, 5 decimal digits of pi, there's a theorem you can invoke that will tell you how many terms you need to use. You have to take extra care, because you will probably introduce extra error in your calculation -- your calculus class only gives you a brief introduction to the field of numerical calculation.



I don't know of any integral-based approximations that are efficient, though. The fastest algorithms tend to be based on infinite sums.
 
Hurkyl said:
I don't know of any integral-based approximations that are efficient, though. The fastest algorithms tend to be based on infinite sums.

On the other hand, I don't know a proof that pi is irrational based on a sum for pi, only a proof based on an integral.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top