Release Notes: This release works on OpenMosix clusters by testing the number of nodes and spawning a proportional number of processes, each of which computes a certain portion of the decimal representation of PI.
Release Notes: If y=1/((a^2)*(x^2)), then integral (y)dx=arctan(x/a)+c, where 'a' is a constant and 'c' is the integration constant. When the y vs. x curve is drawn, the area under the curve from x=0 to x=a is [arctan(a/a)-arctan(0/a)]=pi/4. In this program, the area under the above mentioned curve from x=0 to x=a is calculated by dividing the area into a number of thin strips. The width of each strip along the x-axis is unity. The value of 'a' should be input by the user. The sum of the area of all the strips is multiplied by 4 to calculate the approximate value of pi.
Release Notes: This branch computes decimal digits of PI using the Plouffe and Bellard Algorithm. It outputs the results to several temporary files and compiles a .txt file from them.
Release Notes: This program calculates pi by using infinite series developed by Ramanujan. This formula has 8 digits of precision per iteration. This version of the also program uses GMP.
Release Notes: In this solving method, a regular polygon having "n" sides is inscribed within a circle of known radius and another regular polygon with the same number of sides is circumscribed around the circle. As the value of "n" is increased, the average value of the perimeters of the two regular polygons approach the circumference of the circle. The average when divided by the diameter of the circle gives the approximate value of Pi.