# Algorithm to find prime number of a specific even number in Goldbach's conjecture [closed]

According to Goldbach's conjecture:

Every even integer greater than 2 can be expressed as the sum of two primes.

What is the most efficient algorithm which takes an even number and gives the two prime?