# Back to project All releases of Calculating Pi

•  23 Jan 2004 13:38

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.

•  21 Jun 2003 16:20

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.

•  14 May 2003 00:33

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.

•  29 Jan 2003 13:17

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.

•  08 Jan 2003 12:55

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.

•  05 Jan 2003 15:48

Release Notes: A bad method that was previously used to make the program sleep for a while has been replaced with a version that uses usleep() for timing.

•  03 Jan 2003 19:05

Release Notes:

•  30 Sep 2002 14:22

Release Notes: In this branch, the distances between many consecutive points on the circumference are added for the first quadrant, and the sum is multiplied by 4 to get the approximate value of the circumference of the circle. The obtained value is divided by twice the radius, and the approximate value of Pi is obtained as the output.

•  04 Sep 2002 07:46

Release Notes: This version is the visual simulator for the Pi calculator using SHM. It simulates SHM without using trigonometric functions, and displays it as #s on the screen. It does not calculate the value of Pi.

•  30 Jul 2002 23:00

Release Notes:

## Project Spotlight

### episoder

A tool to tell you about new episodes of your favourite TV shows.

## Project Spotlight

### BalanceNG

A modern software IP load balancer.