Darius Liddell

Fixed broken link for Amazon "mathematical maturity grad school" list

I wrote two functions for the famous Goldbach's [conjecture](https://en.wikipedia.org/wiki/Goldbach%27s_conjecture), which basically says that for every natural number greater than 2, it can be rewritten as the sum of two primes....

`preorder` gets the preorder traversal of a binary search tree `postorder` gets the postorder traversal of a binary search tree `foldTree` is an exercise from haskellbook.com that folds/accumulates a binary...

`isPrime` returns true if a positive integer is prime, false otherwise. 'isCoprime` returns true if the GCD of two positive integers is 1, false otherwise. `totient` returns the value of...