If n <= 65535, the detection of whether a number is prime can always get the correct answer (based on a prime number list).
If n > 65535, the detection of whether a number is prime is based on the Fermat's little theorem.
Update `README.md'.
Add `TODO.md'.