(odd, p)
return odd == (p + 2 * int(((odd - p) / 2) ** 0.5) ** 2)
check if some odd composite can be equal with p prime
    whose follow the equation: odd_composite == prime + 2 * x²
check if some odd composite can be equal with p prime
    whose follow the equation: odd_composite == prime + 2 * x²
check if some odd composite can be equal with p prime whose follow the equation : odd_composite == prime + 2 * x²
def goldbach(odd, p):
    """check if some odd composite can be equal with p prime
    whose follow the equation: odd_composite == prime + 2 * x²
    """
    # that part is a analytical solution for get the x num:
    # the possible numbers to odd composite (not prime odd) is:
    # :: odd = prime  + 2 * x²
    # so, x = sqrt((odd - prime) / 2), whose prime + 2 < odd.

    # simplification can be done yet, but I will keep that way
    return odd == (p + 2 * int(((odd - p) / 2) ** 0.5) ** 2)
def goldbach ( odd , p ) : # that part is a analytical solution for get the x num: # the possible numbers to odd composite (not prime odd) is: # :: odd = prime  + 2 * x² # so, x = sqrt((odd - prime) / 2), whose prime + 2 < odd. # simplification can be done yet, but I will keep that way return odd == ( p + 2 * int ( ( ( odd - p ) / 2 ) ** 0.5 ) ** 2 )