Algorithms

public static void e1(int n) {
   double sum = 0.0;
   for (int i = 0; i < n; i++) {
      sum = sum + 1.0 / factorial(i);
   }
   System.out.println("e is approximately " + sum);
}

public static int factorial(int k) {
   int product = 1;
   for (int i = 1; i <= k; i++) {
      product = product * i;
   }
   return product;...