OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
35101c0
)
extra math display fix
author
CJSoft
<egwcyh@qq.com>
Sun, 19 Aug 2018 10:57:26 +0000
(18:57 +0800)
committer
CJSoft
<egwcyh@qq.com>
Sun, 19 Aug 2018 10:57:26 +0000
(18:57 +0800)
docs/math/combination.md
patch
|
blob
|
history
diff --git
a/docs/math/combination.md
b/docs/math/combination.md
index
432f0d3
..
b499900
100644
(file)
--- a/
docs/math/combination.md
+++ b/
docs/math/combination.md
@@
-89,7
+89,7
@@
$n$ 种不一样的球,每种球的个数是无限的,从中选$k$个出来,
中间还是 $k$ 个数!不过已经不是 $b$ 系列,而是 $c$ 系列,**假设 $c[i]=b[i]+i-1$,所以**
-$$1 \le c_1 < c_2 < c_3 < c_4 < \cdots <c_k \le n+k-1$$
+$$1 \le c_1 < c_2 < c_3 < c_4 < \cdots <
c_k \le n+k-1$$
所以问题就开始转换为无重复组合问题,即在 $n+k-1$ 个元素中选中 $k$ 个的组合数$C_{n+k-1}^{k}$。