private boolean setPrime(long n) {
		t.add(2L);
		double sqrt = Math.sqrt(n);
		M: for (long k = 3; k < sqrt; k++) {
			for (Long l : t) {
				if (n % l == 0) {
					continue M;
				}
			}
			t.add(k);
		}
		return true;

	}