Rising Factorial
Calculates the rising factorial with arguments \e x and \e n.
Controller: CodeCogs 
Interface
C++
Rising Factorial
doublerising_factorial( | double | x | |
int | n | ) |
![[m]^n](http://latex.codecogs.com/eq/58/b2/58b2b97e3647a76a48815a4fe72ac384_1f1.gif)
![[m]^n / n!](http://latex.codecogs.com/eq/5a/c9/5ac983f1eaa9511d213de01b4e2533b4_2ef.gif)


Example:
#include <codecogs/maths/discrete/combinatorics/arithmetic/rising_factorial.h> #include <iostream> int main() { std::cout << Maths::Combinatorics::Arithmetic::rising_factorial(5, 3) << std::endl; return 0; }
Output:
210
References:
SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.htmlParameters
x the first rising factorial argument n the second falling factorial argument
Returns
- the rising factorial of the pair of values x and n
Authors
- Lucian Bentea (August 2005)
Source Code
Source code is available when you agree to a GP Licence or buy a Commercial Licence.
Not a member, then Register with CodeCogs. Already a Member, then Login.