AutoHotkey Community

[11.00100100001111110110 ...] ... [ ]

_________________
rawr. be very afraid
*poke*
Note: My name is all lowercase for a reason.
"I think Bigfoot is blurry, that's the problem. It's not the photographer's fault, Bigfoot is blurry. So there's a large, out-of-focus monster roaming the countryside."

Nice picture, BoBo³!

Tidbit: you can use the AHK function PI posted here to compute 900 million digits of PI. It just takes a little time. 1000 digits will be printed faster than the web page loads.

nice.
i was going to post the link to 1,000,000 + digits of pi, but decided to go with 1,000.

_________________
rawr. be very afraid
*poke*
Note: My name is all lowercase for a reason.
"I think Bigfoot is blurry, that's the problem. It's not the photographer's fault, Bigfoot is blurry. So there's a large, out-of-focus monster roaming the countryside."

TBH, it's the Google Doodle of today (for those who didn't realize it!)

Looks like it coincided with Mothers Day in the UK

_________________
GitHub • Scripts • IronAHK • Contact by email not private message.

dang!
i wanted to generate 10,000,000 digits of of Pi with Laszlos functions above, but it takes forever on my machine!
I left my pc on for a few hours while I went out and it's wasn't done when I got back. i then waited another hour before terminating it.

1,000 = instant
10,000 = 1.6 seconds
100,000+ = takes to long, didn't want to wait.

ps: Laszlo: my name is all lowercase for these reasons: this and this.

_________________
rawr. be very afraid
*poke*
Note: My name is all lowercase for a reason.
"I think Bigfoot is blurry, that's the problem. It's not the photographer's fault, Bigfoot is blurry. So there's a large, out-of-focus monster roaming the countryside."

I know. It just looks weird in the beginning of a sentence. I'll try to remember to address you as TidbiT the next time. I am terribly sorry

The running time is proportional to the second power of the requested length. That is, for 10 times more bits you have to wait 100 times longer, or more. When your PC runs out of of memory, it starts to swap data to disk, and the computation would take forever.

In my 2.66GHz core i7 PC, with 6GB RAM I got the following running times (ms):1 million digits of pi could be computed under 3 hours (if the memory was enough - I have not checked). Note that this SW was optimized for code size and complexity, with keeping the computation speed reasonable. With more complicated code you could easily achieve 10 fold speedup at computing 1 million digits of pi. Also, only one of the 4 CPU cores are used in the computations, so another factor of 4 acceleration is possible.

TBH ?! I love these "weird" math-geeks Humanoid geniuses camouflaged as normal human beings