Java Problems - University of Cambridge

[Pages:20]Java Problems

1. The Fibonacci Series Problem Find the first term greater than 1000 in the sequence:

1 1 2 3 5 8 13 . . . Also find the sum of all the values up to that term.

2. The Greenfly Problem Greenfly can reproduce asexually. After one week of life a lone female can produce eight offspring a day. Starting at the beginning of day 1 with a single mature female, how many greenfly could there be by the end of day 28? It may be assumed that:

? There are no deaths ? All offspring are females Note that at the end of day 1 there will be 9 greenfly (original + 8 offspring). At the end of day 7 there will be 57 greenfly (original + 8 ? 7 offspring). At the end of day 8 there will be 129 greenfly (original + 8 ? 8 offspring + 64 offspring from the daughters produced on day 1).

3. All Prime Numbers less than 600 Write a program to print a table of all prime numbers less than 600. Use the sieve method; take the first 600 integers and cross out all those that are multiples of 2, 3, 5, etc. until only primes remain, then print out the table. The table must be organised so that there are ten prime numbers on each line. The start of the program should resemble the following: public class Primes

{ private static final int SIZE=600, SQRTSIZE=25;

public static void main(String[] args) { int[] primes = new int[SIZE]; for (int i=2; i ................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download