逐步淘汰原则
定理7.1 设有N件事物，其中\(N_{\alpha}\)件有性质\(\alpha\)，\(N_{\beta}\)件有性质\(\beta,\cdots,N_{\alpha\beta}\)件兼有性质\(\alpha\mbox{及}\beta,\cdots,N_{\alpha\beta\gamma}\)件兼有性质\(\alpha,\beta\mbox{及}\gamma,\cdots\)，则此事物中之既无性质\(\alpha\)，又无性质\(\beta\)，又无性质\(\gamma,\cdots\)者之件数为
\[\begin{align}N-N_{\alpha}-N_{\beta}-\cdots\\ +N_{\alpha\beta}+\cdots\\ -N_{\alpha\beta\gamma}-\cdots\\ +\cdots-\cdots\end{align}\]定理7.2 若\(a,b,\cdots,k,l\)为任意非负之数，则
\[max(a,b,\cdots,k,l)=a+b+\cdots+k+l\\ -min(a,b)\cdots-min(k,l)\\ +min(a,b,c)+\cdots\\ -\cdots+\cdots\\ \pm min(a,b,\cdots,k,l)\]定理7.3 \([a_1,\cdots,a_n]=a_1\cdots a_n(a_1,a_2)^{-1}\cdots(a_{n-1},a_n)^{-1}(a_1,a_2,a_3)\cdots(a_1,\cdots,a_n)^{(-1)^{n+1}}\)
定理7.4 \((a_1,a_2,\cdots,a_n)=a_1\cdots a_n[a_1,a_2]^{-1}\cdots[a_{n-1}a_n]^{-1}[a_1,a_2,a_3]\cdots[a_1,\cdots,a_n]^{(-1)^{n+1}}\)
图片
流程图
graph TD;
A-->B;
A-->C;
B-->D;
C-->D;
时序图
sequenceDiagram
participant Alice
participant Bob
Alice->John: Hello John,how are you?
loop Healthcheck
John->John: Fight against hypochondria
end
Note right of John: Rational thoughts
prevail... John-->Alice: Great! John->Bob: How about you? Bob-->John: Jolly good!
prevail... John-->Alice: Great! John->Bob: How about you? Bob-->John: Jolly good!
甘特图
gantt
dateFormat YYYY-MM-DD
title Adding GANTT diagram functionality to mermaid
section A section
Completed task :done, des1, 2014-01-06,2014-01-08
Active task :active, des2, 2014-01-09, 3d
Future task : des3, after des2, 5d
Future task2 : des4, after des3, 5d
section Critical tasks
Completed task in the critical line :crit, done, 2014-01-06,24h
Implement parser and jison :crit, done, after des1, 2d
Create tests for parser :crit, active, 3d
Future task in critical line :crit, 5d
Create tests for renderer :2d
Add to mermaid :1d
本文共177单词
本文共1973字。