I have forgotten

• https://me.yahoo.com
COST (GBP)
0.05
0.00
0

# Rising Factorial

Calculates the rising factorial with arguments \e x and \e n.
Controller: CodeCogs

C++

## Rising Factorial

 doublerising_factorial( double x int n )
The rising factorial has the following formula



Note that the number of ways of arranging n objects in m ordered boxes is . (Here, the ordering in each box matters). Thus, 2 objects in 2 boxes have the following 6 possible arrangements:



Moreover, the number of non-decreasing maps from a set of n to a set of m ordered elements is . Thus the set of nondecreasing maps from  to  is the 20 elements:




## 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.html

### Parameters

 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.