Calculating PI ax far as possible? (Mathametical Question)

Question

1.00/5 (1 vote)

See more:

Hello everyone,

I am wondering if there is any way of calculating PI as far as possible?

Today on school I heard that PI has a million numbers after the 3.14.
So, I thought why not try and calculate all those numbers?

I was planning on using a void that will use itself inside it,
a little bit like so:

C#

public void CalculatePI(int Start)
{
 int Write = Start + (Calculate PI here).
 Console.WriteLine(Write.ToString());
 CalculatePI(Write);
}

Does anyone know where to start?

Posted 28-Mar-13 10:47am

Yvar Birx

Add a Solution

Comments

Richard C Bishop 28-Mar-13 16:54pm

Pi is infinite in its decimal representation. You will never write Pi to the end.

Yvar Birx 28-Mar-13 16:54pm

Yes, I understand, that's why I am interested into calculating it as far as possible. I have no clue where to start though.

Richard C Bishop 28-Mar-13 16:56pm

I see, you want to get as mush as possible. Well, that could be tricky and I do not know where to start either.

Yvar Birx 28-Mar-13 16:56pm

Yes, exactly, yeah it is, I'm not sure too. :P

Sergey Alexandrovich Kryukov 28-Mar-13 17:18pm

I cannot believe that someone can think that π can have finite number of digits? Or it was a joke? :-)
—SA

Yvar Birx 28-Mar-13 17:20pm

Yeah, I kinda wrote the question wrong. Well, I am just hoping I can get as many numbers as possible. Zoltan just answered it for me. :P

Sergey Alexandrovich Kryukov 28-Mar-13 17:24pm

Sure. Right, it's a good answer...
—SA

Zoltán Zörgő 28-Mar-13 17:24pm

On the link with the record you will find a downloadable program to try. But be aware, that the record took a year on a really good hardware!

Zoltán Zörgő 28-Mar-13 17:22pm

"Today on school I heard that PI has a million numbers after the 3.14.". I am wondering is it the teacher or the student to blame for such questions?

Sergey Alexandrovich Kryukov 28-Mar-13 17:25pm

OP said it was just bad wording. That explains it... :-)
—SA

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

**Zoltán Zörgő** · Accepted Answer · 2013-03-28T10:59:00

Solution 1

You are wrong. PI has infinite number of "numbers after 3.14". Do you have that much memory... or time? I doubt.
Please read this article: http://en.wikipedia.org/wiki/Approximations_of_%CF%80[^], before you try to calculate all those numbers. Be aware that highly qualified mathematicians and high performance computers are working on beating the current record[^].

Posted 28-Mar-13 10:59am

Zoltán Zörgő

Comments

Sergey Alexandrovich Kryukov 28-Mar-13 17:19pm

5ed :-)
I just would like to note that it does not look like an interesting exercise for "qualified mathematicians".
Years ago, I heard that for the numbers π^e and e^π, one was proven to be a transcendental number, but it wasn't proven for another one (I don't remember which is the two). This is more interesting. As to the calculations, I don't think any considerable mathematical background needs to be involved... :-)
—SA

Zoltán Zörgő 28-Mar-13 17:29pm

Thanks.
You'r right, but compare the level of the question with the level of the knowledge needed. I was using this expression more as an illustration. But still: the algorithms are not complicated but not so easy to implement in an efficient way.

Sergey Alexandrovich Kryukov 28-Mar-13 17:31pm

Oh, yes... :-)
—SA