//question 2:  Fibonacci numbers

int v1 = 1;
int v2 = 2;

System.out.println(v1);
System.out.println(v2);

int fn;
for(int i=3; i<=n; i++) {
  fn = v1 + v2;
  v1 = v2;
  v2 = fn;
  System.out.println(fn);
}


//question 3
/* = mean of a sequence of randomly generated integers in [1..U].
 * The sequence ends when U is generated.  Include U in the sequence.
 */
public static double mean(int U) {
  int sum = 0;
  int count = 0;
  int num = Math.ceil(Math.random()*U);
  while(num < U) {
    sum += num;
    count++;
    num = Math.ceil(Math.random()*U);
  }
  sum += num; //to get the last U encountered
  count++;

  return (double)sum/count;
}


//question 4
/* Print all prime numbers in [2..n]
 */
public static void printPrimes(int n) {
  for(int i=2; i<=n; i++) {
    boolean isPrime = true;
    for(int k=2; k<i; k++) {
      if(i%k == 0) {
        isPrime = false;
      }
    }
  
    if(isPrime == true) {
      System.out.println(i);
    }
  }
}