me@localhost:~> bc d=1; for(i=21; i < 41; i++){d *= i;}; print d; print "\n"; 33...

qsort · 2026-06-22T18:46:37 1782153997

You don't need space for 40!/20!, for example:

  let ans = 1
  for (let i=1; i<21; ++i) {
    ans *= (41 - i)
    ans /= i
  }

The same idea can be trivially tweaked to compute any binomial coefficient without ever storing an integer greater than the final result.

ogogmad · 2026-06-22T19:12:47 1782155567

Good point. But what if `i` does not divide `ans` evenly? I suppose you could use floats and then round.

qsort · 2026-06-22T19:22:52 1782156172

It always divides it evenly, that's why it works.

After the i-th iteration of the for loop, ans will contain n!/((n-i)!i!) which is exactly \binom{n}{i}, an integer.

Technically "ans" can grow above the final result in my example, but even that could be fixed if one really wants (e.g. i must divide either ans or n-i, you play a bit with divmod to figure out which division you do first.)

aesthesia · 2026-06-22T19:32:37 1782156757

Just noting that Python natively handles integers larger than the machine word size since version 2.5, so this would have worked in Python as well.

ogogmad · 2026-06-22T19:56:49 1782158209

I think BC's features are equivalent to:

- Python's native integer handling, which already has no size limit.

- PLUS part of the Decimal module in Python's stdlib: BC's floats are DECIMAL by default, not binary.

- PLUS an implementation of Bessel's J function, while neglecting Bessel's K.

- Some features for base conversion using `ibase` and `obase`. So, I suppose you can output numbers to base 60. [EDIT: Correction from earlier: ibase is allowed to be at most 16, while POSIX allows for the maximum value of obase to be at least 99, which therefore does allow for formatting output to base 60.]

Qem · 2026-06-22T21:07:22 1782162442

And does it quite fast too:

https://www.wilfred.me.uk/blog/2014/10/20/the-fastest-bigint...