陆昱宽

Sources:

1. Elements of Information Theory
2. An Introduction to Single-User Information Theory

We now show that the entropy of a collection of random variables is the sum of the conditional entropies.

Note: 本文的证明还比较粗糙, 后面会改进.

Ref: Elements of Information Theory

在不同的统计学(包括概率论, 信息论, 随机过程)教材中常常会见到不同的符号约定, 这里整理一下并作出说明.

Sources:

1. NOTES ON PROBABILITY by Greg Lawler

Ref:

1. NOTES ON PROBABILITY by Greg Lawler
2. Probability_Theory by Kyle Siegrist
3. The Book of Statistical Proofs

Sources:

1. NOTES ON PROBABILITY by Greg Lawler

《道是什么》演讲稿.

Ref:

• Beancount documentation
• How to manage your finances with Beancount -- CoolByte

A trie (pronounced as "try") or prefix tree is a tree data structure used for storing and searching a specific key from a set, usually a string set.

Using Trie, search complexities can be brought to O(n)(n = key length).

208. Implement Trie (Prefix Tree)

204. Count Primes

Given an integer n, return the number of prime numbers that are strictly less than n.