public static int findPreviousPrimeNumber(int number) {
		int previous = 0;
		int next = 0;

		for (int i = 0; i < 10; i++) {
			previous = i;
			next = i + 1;

			if (PRIME_NUMBERS[0] == number)
				break;

			if (PRIME_NUMBERS[previous] == number)
				previous--;

			if (PRIME_NUMBERS[next] == number)
				next++;

			if (next != PRIME_NUMBERS.length - 1) {
				if (PRIME_NUMBERS[previous] < number
						&& PRIME_NUMBERS[next] > number) {
					return PRIME_NUMBERS[previous];
				}
			} else
				break;

		}

		return number;
	}