happy Pi day everyone - PeachParts Mercedes-Benz Forum

TheDon · #1 03-14-2008, 03:14 PM

and Einstein's Birthday as well

3.1415926 (thats as much as I can remember)

Jordan G · #2 03-14-2008, 03:19 PM

5359....that's all the further I can go.

I memorized it off my ol' TI-85 graphing calculator.

SwampYankee · #3 03-14-2008, 03:29 PM

Cool! I'm going to celebrate by figuring out the circumference of the top of some beer cans as their volumes decrease.

Pete Geither · #4 03-14-2008, 03:37 PM

My granddaughter knows it 200 digits out. BTW,,, pie aren't square,,, pie are round. Cake are square.

Crazy_Nate · #5 03-14-2008, 05:25 PM

Try this on for size...

You might even notice that I'm sitting in an airport and very bored...

Code:

count = 0
max = 1e5
for i = 0:max
     x = rand;
     y = rand;
     if x^2+y^2 > 1
          %do nothing
     else
          count = count+1;
     end
end
pi = 4*count/max;
disp(pi)

\end{nerdy grad student randomness}

miljohnj5 · #6 03-14-2008, 06:05 PM

I'm not very good in math, in fact I'm a complete idiot when it comes to numbers. I do however, like the idea that math is a language, especially with the concept of Phi and the golden ratio. Check out this site, it's actually pretty cool;
http://goldennumber.net/
Sorry pi, it may be your birthday (you little transcendental number) but you're not consistently apparent in natures design, loser... Hail Phi!!! x 1.618

Hogweed · #7 03-14-2008, 06:08 PM

Quote:

Originally Posted by Crazy_Nate

Try this on for size...

You might even notice that I'm sitting in an airport and very bored...

Code:

count = 0
max = 1e5
for i = 0:max
     x = rand;
     y = rand;
     if x^2+y^2 > 1
          %do nothing
     else
          count = count+1;
     end
end
pi = 4*count/max;
disp(pi)

\end{nerdy grad student randomness}

ouch. anybody got some 'cyber' aspirin?

Matt L · #8 03-14-2008, 08:54 PM

Aye, the "Monte Carlo" method for computing pi. Works fairly well. However, I recall reading about a closed-form solution a year or two ago. It only worked in binary (or another power of two, like hex) but that's good enough.

The point of the "Monte Carlo" algorithm is to throw dart at a 2x2 square, and of those darts that hit the square, count the number that are within a circle of radius 1. The area of the circle is pi, the area of the square is 4.

We must assume that "rand" returns a value between -1 and 1. Between 0 and 1 works too (I leave that as an exercise for the reader).

SwampYankee · #9 03-15-2008, 08:23 AM

Quote:

Originally Posted by Matt L

Aye, the "Monte Carlo" method for computing pi. Works fairly well. However, I recall reading about a closed-form solution a year or two ago. It only worked in binary (or another power of two, like hex) but that's good enough.

The point of the "Monte Carlo" algorithm is to throw dart at a 2x2 square, and of those darts that hit the square, count the number that are within a circle of radius 1. The area of the circle is pi, the area of the square is 4.

We must assume that "rand" returns a value between -1 and 1. Between 0 and 1 works too (I leave that as an exercise for the reader).

Yeah, that!