class Smorgasbord {
  static int n = 8;

  // compute the square of m
  static int square(int m) {
    System.out.println("The argument of square is " + m);
    return m * m;
  }

  /*
     precondition: n is an integer > 1
     return true if n is prime; return false otherwise
   */
  static boolean isPrime(int n) {
    return isPrime(n, 2);
  }

  // return true if no number between d and n-1 inclusive divides n
  // return false otherwise
  static boolean isPrime(int n, int d) {
    if (d < n)
      return (n % d != 0 && isPrime(n, d+1));
    else
      return true;
  }

  /*
   Precondition: n >= 2 is an integer
   Iteratively check whether  n is prime
  static boolean isPrime(int n) {
    int d = 2;
    while (d < n) {
      if (n % d == 0)
        return false;
      d++; // d = d + 1;
    }
    return true;
  }
  */

  public static void main(String[] args) {
    System.out.println("The original value of n is " + n);
    int result;
    result = square(n);
    System.out.println("The value of square(n) is " + result);
    System.out.println();

    // print a table of primes <= LIMIT, 10 per lines
    final int LIMIT = 1000;
    int count = 0;
    System.out.println("Table of primes <= " + LIMIT);
    for (int n = 2; n < LIMIT; n++) {
      if (isPrime(n)) {
        System.out.printf("%5d", n);
        count++;
        if (count % 10 == 0)
          System.out.println();
      }
    } 
    System.out.println();
  }
}