Memory and time efficient PI algorithm (binary)

Question

just a very simple question. I would like to efficiently and SEQUENTIALLY compute binary digits of pi on an Arduino microprocessor. There is no actual computing purpose in this project, it is for an artistic installation for a friend, with a light pulsing the digits of pi as they are generated. Therefore I'd need an algorithm sequentially generating binary digits of PI with the following requirements: - Low memory requirement - Speed is not really important since the pulsing light frequency will be of the order of a second - Good asymptotic time complexity, on exampl the BBP algorithm grows linearly in time with the digits computed and it soon gets to be slow on an Arduino board, and I can compute the previous digits since I want to show them.

Any ideas? Thank you very much indeed!

Matteo

Answer 1

Well you may easily find billions of binary digits of pi online, just copy them, put into a file, and ......

I really think it's the best way to solve your problem.