On the numerical evaluation of factorials XIII

Rising Factorial

We have

{\displaystyle{ x^{(n)} = {(x + n - 1)}_n }}

That gives

int mp_rising_factorial(unsigned long n, unsigned long k, mp_int * c)
{
  int e;
  if ((e = mp_falling_factorial(n - k + 1, k, c)) != MP_OKAY) {
    return e;
  }
  return MP_OKAY;
}

hth bye

đŸ˜‰

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s