Question 4

Largest palindrome product

Code:

	# Define the range (goes down each time by 1)
	D=range(999,99,-1)

	# For loop
	for i in range(998000,0,-1):
	    # Convert s into a string
	    s=str(i)
	    # If s equals s backwards
	    if s==s[::-1]:
	        for t in D:
	            # If no remainder and 3 digit number
	            if not i % t and len(str(i/t))==3:
	                # Print s
	                print(s)
	
Charlie M-S