Java-Code

package a310;

import java.awt.List;

public class main {

	public static void main(String[] args) {
		//Primzahlzwillinge1
		List primes = getAllPrimes();
		//System.out.println(primes.getItemCount());
		for(int i = 0; i < primes.getItemCount()-1; i++) {
			int one = Integer.parseInt(primes.getItem(i));
			int two = Integer.parseInt(primes.getItem(i+1));
			if(arePairs(one, two))
				System.out.println(one + ":" + two);
		}
		
	}
	
	private static List getAllPrimes() {
		List primes = new List();
		for(int i = 0; i <= 2000; i++) {
			if(isPrime(i))
				primes.add(Integer.toString(i));
		}
		return primes;
	}
	private static boolean isPrime(int n) {
		   if (n <= 2) {
	            return (n == 2);
	        }
	        for (long i = 2; i * i <= n; i++) {
	            if (n % i == 0) {
	                return false;
	            }
	        }
	        return true;
	}
	private static boolean arePairs(int one, int two) {
		if(two - one == 2)
			return true;
		return false;
	}
}