Find the next prime number function

Find the next prime number

import unittest

def find_next_prime(n):
	n += 1
	while not is_prime(n):
		n += 1
	return n

def is_prime(n):
	# Not necessary to iterate through entire number, only half gets the job done.
	# Should be further optimized if 'n' gets too huge
	if n % 2 == 0 and n != 2:
		return False	
	else:
		test_range = n / 2
		for i in range(test_range, 1, -1):
			if n % i == 0:
				return False
	return True



# ######################################################################
# Some tests. Not terribly thorough but it's late and I'm sleepy
class TestFindNextPrime(unittest.TestCase):

	def test_isPrime(self):
		self.assertEqual(is_prime(2), True)
		self.assertEqual(is_prime(3), True)
		self.assertEqual(is_prime(5), True)
		self.assertEqual(is_prime(7), True)
		self.assertEqual(is_prime(11), True)
		self.assertEqual(is_prime(13), True)
		self.assertEqual(is_prime(4), False)
		self.assertEqual(is_prime(6), False)
		self.assertEqual(is_prime(8), False)
		self.assertEqual(is_prime(9), False)
		self.assertEqual(is_prime(10), False)

	def test_nextPrime(self):
		self.assertEqual(find_next_prime(6), 7)
		self.assertEqual(find_next_prime(10), 11)
		self.assertEqual(find_next_prime(11), 13)

unittest.main()