## 【Some Math】Pascal’s rule

Pascal’s rule 是说：

$$\pmatrix {n-1 \\ k } + \pmatrix{n-1 \\ k-1} = \pmatrix{n \\ k}$$

binomial公式（伯努利分布，二项分布）同样可以用这种递归的方式去写(事件一共重复N次，每次成功的概率为p，计算成功k次的概率)：

binomial(N, k, p) = (1-p

## 「Old Article」笔记：费马质数检验算法

### An Algorithm for detecting prime number (Primality Test)

##### 1. Fermat’s Little Theorem and its converse-negative proposition
• Fermat’s Little Theorem is introduced:If ​ is an integer, and ​ is a prime number, then ​ must be one of multiples of ​Which means that: ​Then we have:​ Then the commonly used format is:​
• If Fermat’s Little Theore

## 从马尔可夫不等式到弱大数定律

##### 首先是Markov不等式。

$$P(X \geq a) \leq \dfrac{E[X]}{a} (given \ X \geq 0)$$