22 hours Goldbach's Conjecture

    // ab & 10 = A 
    B = 10% ab &
     IF ab & == (A + B) + (A * B):
         Print (ab &)
 Print ( ' *************************************** ' ) 
 for X in Range ( 10000 ): 
    n- = STR (x ** 2)    # is calculated within each product number 10000 
    m = STR (x)       # x to digital conversion of a string 
    C = len (m)       # calculates the length of the string m 
    IF x int == (n-[-C ::]):    # [] represents a string list 
    # by the character string into digital int, n-[start value: end value: step], the representative minus reverse 
        Print (X )