Re: exercise in double number arithmetic

On 7/7/24 21:00, Ahmed wrote:

On Mon, 8 Jul 2024 1:02:37 (UTC), Krishna Myneni wrote:
..

130 65 binom d.
95067625827960698145584333020095113100  ok

..

Krishna

 And it works for n=131, k=65
131 65 binom ud. 188694833082770476622296176145946360850  ok (correct,
see WolframAlpha)
But for n>=132 it gives uncorrect results.

I reproduce the same results for those cases here.

 Good work. This thread was fruitful.
 

All of the different solutions have utility, particularly the Pascal triangle method when a number of binomial coefficients must be available. I recall that modern Fortran has ways to specify non-rectangular arrays. We should be able to define a triangle array structure in Forth as well, to reduce the storage required for n = 1 to nmax array of coefficients.
--
Krishna