Question 8

Code:

	# Set i variable
	i=0
	n = 1000000000
	# 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:
	                # Add 1 to i
	                i+=1
	                # If i is 10001st prime
	                if i==10001:
	                    # Print x
	                    print(x)