<jupyter_start><jupyter_text>Project Euler: Problem 4 https://projecteuler.net/problem=4A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.Find the largest palindrome made from the product of two 3-digit numbers.<jupyter_code>#assign x and y to all 3-digit variables
for x in range(100,999):
    for y in range(100,999):
        #create product
        z = x * y
        #put z in a string
        a = str(z)
        #got the idea of testing if number is palindrome from this link: http://stackoverflow.com/questions/6037973/project-euler-problem-number-4
        if a == a[::-1]:
            print (z)
#My code prints all of the palindromes.  I cannot figure out how to just print the largest one.
            
# This cell will be used for grading, leave it at the end of the notebook.<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.0779510022271715, 'fraction_numerical': 0.0378619153674833, 'mean_word_length': 2.9955555555555557, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '290875', 'license': 'MIT', 'n_tokens_mistral': 298, 'n_tokens_neox': 265, 'n_words': 118, 'path': 'assignments/assignment02/ProjectEuler4.ipynb', 'repo_name': 'AaronCWong/phys202-2015-work', 'size': '898'}