Pick three of the following.
mapfunction using a fold.
filterfunction using a fold.
Write code to compute the smallest positive number that is evenly divisible by all the numbers from 1 to \(n\). Provide an answer for \(n = 20\).
Write code to compute the \(n\)th prime number. Provide an answer for \(n = 10001\).
- Problem 3 is from Real World Haskell.
- Problems 4 and 5 are from Project Euler.