阶乘
n
!
=
1
×
2
×
3
×
.
.
.
×
(
n
−
1
)
×
n
n! =1\times2\times3\times...\times(n - 1)\times n
n!=1×2×3×...×(n−1)×n
或
n
!
=
n
×
(
n
−
1
)
!
n!=n\times(n-1)!
n!=n×(n−1)!
排列
A
n
m
=
n
(
n
−
1
)
(
n
−
2
)
.
.
.
(
n
−
m
+
1
)
=
n
!
(
n
−
m
)
!
A_n^m=n(n-1)(n-2)...(n-m+1) =\frac{n!}{(n-m)!}
Anm=n(n−1)(n−2)...(n−m+1)=(n−m)!n!
组合
C
n
m
=
n
(
n
−
1
)
(
n
−
2
)
.
.
.
(
n
−
m
+
1
)
m
!
=
n
!
m
!
(
n
−
m
)
!
C_n^m=\frac{n(n-1)(n-2)...(n-m+1)}{m!} =\frac{n!}{m!(n-m)!}
Cnm=m!n(n−1)(n−2)...(n−m+1)=m!(n−m)!n!
<script>
//for循环实现阶乘
function factorial(n)
{
var sum = 1;
for(i = n;i >= 1;i--)
{
sum *= i;
}
return sum;
}
//while循环实现阶乘
function factorial2(n)
{
var s = 1;
while(n)
{
s *= n;
n--;
}
return s;
}
//递归实现阶乘
function factorial3(n)
{
if(n <= 1){
return 1;
}else{
return n * factorial3(n - 1);
}
}
n1 = 3;
n2 = 3;
n3 = 3;
console.log(factorial(n1));
console.log(factorial2(n2));
console.log(factorial3(n3));
//在阶乘函数的基础上实现排列函数
function arrangement(n,m)
{
return factorial(n) / factorial(n - m);
}
console.log(arrangement(3,2));
//在阶乘函数的基础上实现组合函数
function combination(n,m)
{
return factorial(n) / (factorial(m) * factorial(n - m));
}
console.log(combination(3,2));
</script>