<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>big = 0

# loop through all 3-digit numbers for first value defined as q
for q in range (100, 999):
    #loop through all 3-digit numbers for secon value defined as s
    for p in range(100, 999):
        #multiply q and p and define it as s and turn it in to a string
        s = str(q * p)
        # reverse the string s and define the reverse as t
        t = s[::-1]
        #loop through all s and t and for those that are equal turn the string in to an intager called s
        while s == t:
            s = int(s)
            #loop throug all s from the previous loop and return the largest in an intager called big
            while s > big:
                big = s

#print largest value
print (big)

# This cell will be used for grading, leave it at the end of the notebook.<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.058876003568242644, 'fraction_numerical': 0.024977698483496878, 'mean_word_length': 2.642857142857143, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 6, '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': '408827', 'license': 'MIT', 'n_tokens_mistral': 349, 'n_tokens_neox': 316, 'n_words': 172, 'path': 'assignments/assignment02/ProjectEuler4.ipynb', 'repo_name': 'sraejones/phys202-2015-work', 'size': '1121'}