Question 3

Code:

	# Define n
	n=600851475143

	# For each prime
	for i in range(2,n):
	    # Check if prime
	    if n > 1:
	            for y in range(2, n):
	                if (n % y) == 0:
	                    break
	            else:
	                # If n is divisible by i
	                if not n % i:
	                    n = n / i
	                # If n = 1
	                if n==1:
	                    # Print i
	                    print(i)