public static Set<Integer> findDivisors(int a) {
		Set<Integer> factors = new HashSet<Integer>();
		factors.add(1);
		for (int x = 2; x < a; x++) {
			if (a % x == 0) {
				factors.add(x);
			}
		}
		return factors;
	}