Adjusted a function comment.

funclang-taddeus/series3/ass7.ml

@@ -66,7 +66,7 @@ let rec lookup l key =
 let rec coin_permutation l n =
     (* Reduce the list using the fact that the the total number of coin
      * permutations is equal to the number of permutations given a single coin,
-     * added to the number of permutations without that coin *)
+     * combined with the number of permutations without that coin *)
     match l with
     | [] -> 0
     | h::t -> (if h > n then 0 else 1 + (coin_permutation t (n - h)))