highest_prime.py

def is_prime(x):
  if x < 2:
		return False
	if x == 2:
		return True
	if x % 2 == 0:
		return False
	i = 3
	while i < x:
		if x % i == 0:
			return False
		i += 2
	return True

def generate_primes(limit):
	i = 1
	while i < limit:
		i += 1
		if not is_prime(i):
			continue
		yield i

def highest_prime_for(n):
	primes = generate_primes(n)
	current_prime = 2
	for x in range(n):
		if n % current_prime != 0:
			current_prime = primes.next()
			continue
		n = n / current_prime
		if is_prime(n):
			return n

def main():
	n = raw_input("Which number? ")

	print "Highest prime factor for", n, "is", highest_prime_for(int(n))

main()

oh ja en newline aan het eind van je bestand jonge, kom op melvin!