Add `Goldbach's conjecture` Algorithm about algorithms

[lemorage]

There is already a prime_check function out of there, maybe using this would be better?

[lemorage]

Ya, quite reasonable, I agree.

[jaki729]

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def goldbach_conjecture(even_number):
    if even_number <= 2 or even_number % 2 != 0:
        print("Please provide an even number greater than 2.")
        return

    for i in range(2, even_number // 2 + 1):
        if is_prime(i) and is_prime(even_number - i):
            print(f"{even_number} = {i} + {even_number - i}")
            return

    print("Goldbach's conjecture is not applicable for this even number.")

# Example usage
even_number_to_check = 28  # Replace this with any even number greater than 2
goldbach_conjecture(even_number_to_check)

[jaki729]

Yes, thats correct but using square root method used for the calculations of prime numbers is the effecient and loogical way for doing it as it is also good for large numbers or big integer values. And Goldbach's conjecture algorithm is the unsolved art of mathematics.