3 ms·
Extending that to all known digits would be a fun technical challenge. I once wrote a code to calculate positions where k subsequent decimal digits equal to the
by lifthrasiir 2y ago
Extending that to all known digits would be a fun technical challenge. I once wrote a code to calculate positions where k subsequent decimal digits equal to the position index itself [1], but I had no storage to spare so I instead used a stream of digits from the public GCP dataset [2]. You would eventually want to try this approach if you are like me (i.e. don't want to pay for two-digit-TB storage).
[1] https://github.com/lifthrasiir/remote-pi-reader/ https://github.com/lifthrasiir/remote-pi-reader/
[2] https://storage.googleapis.com/pi100t/index.html https://storage.googleapis.com/pi100t/index.html (used to be `pi50t` back then)
- sponaugle 2y agoNice... I did that same problem as it was a numberphile episode. Very cool! Fortunately I have over a PB of local storage at home which helps out.