Fast Pochhammer

66 Views Asked by At

I was wondering if there is a fast algorithm for the Pochhammer symbol?

$$(x)_n$$

...where n is very large? e.g. $$n = 2^{160}$$

The implementations I've seen so far seem to use n additions/multiplies, which is out of the question with huge numbers.