Data Structure and Algorithm | Mathematics Knowledge Review

• Author: wugenqiang
• Personal blog: https://wugenqiang.gitee.io
• Study notes: https://wugenqiang.gitee.io/cs-notes

---

---

1 Review of mathematical knowledge

1.1 Index

1.2 Logarithm

In computer science, unless otherwise stated, all logarithms are based on 2

Remember: log 1 = 0, log 2 = 1, log 1024 = 10, log 1048576 = 20

1.3 series

1.4 Modular operation

If N divides A-B, then it is said that A and B are modulo N congruence, which is recorded as A ≡ B (mod N)

1.5 Proof method

The two most common methods for proving the conclusions in data structure analysis are induction and counter-proof. The best way to prove that a theorem is not true is to give a counter-example.

• Proof of induction

• Proof of counter-evidence