1.1
- Prove that there are N! distinct ways to arrange a sequence of N distinct symbols.
ans: a n = n ∗ a n − 1 a_n=n*a_{n-1} an=n∗an−1 - How many nontrivial recreational cipher keys on an alphabet of size 26 are there?
ans: N!-1 - How many recreational cipher keys are there satisfying the requirement that no letter is represented by itself?
思路：
ans:
N ! − ( C N 1 ( N − 1 ) ! − C N 2 ( N − 2 ) ! + C N 3 ( N − 3 ) ! − . . . + . . . ) = N ! 2 ! − N ! 3 ! + N ! 4 ! − N ! 5 ! + . . . − . . . N!-(C_{N}^{1}(N-1)!-C_{N}^{2}(N-2)!+C_{N}^{3}(N-3)!-...+...) \\ = \frac{N!}{2!}-\frac{N!}{3!}+\frac{N!}{4!}-\frac{N!}{5!}+...-... N!−(CN1(N−1)!−CN2(N−2)!+CN3(N−3)!−...+...)=2!N!−3!N!+4!N!−5!N!+...−...
当N足够大时，根据泰勒展开得到：
上 式 ≈ N ! e 上式\approx \frac{N!}{e} 上式≈eN!
1.2
- Estimate the value of l o g 2 ( 256 ! ) log_2(256!) log2
最低0.47元/天 解锁文章
3075
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
