experchange > fortran

Arjen Markus (03-06-19, 09:48 AM)
On Wednesday, March 6, 2019 at 1:12:42 AM UTC+1, ga...@u.washington.edu wrote:
> On Tuesday, March 5, 2019 at 4:16:53 AM UTC-8, robin....@gmail.com wrote:
> (snip)
> For those not following such things, there is an algorithm for
> computing individual hexadecimal digits of pi, without computing
> all the digits in between. (None for decimal, as far as I know.)
> This is used to help validate the results of binary calculations.
> Then you only need to validate the binary to decimal conversion.


That is what I understand as well - no such formula for decimal digits. Of course if you want to go from hexadecimal to decimal, you need all of the intervening digits.

(So far I have not found a convenient, fast converging series - perhaps something like is the way to go)

Regards,

Arjen
David Duffy (03-09-19, 10:35 AM)
A nice fortran version of the spigot algorithm is at



I was going to post my implementation

%% (digits 5)
31415 5

%% (digits 6)
314150 6

but I won't bother...

Similar Threads