Writing a program in c++ that provides an exhaustive proof of the following conjecture on a limited domain.The program will write the results of each instance of the domain in a file; and then, if the conjecture evaluates to true for the entire domain, the program will display a message that states that conjecture is true on the limited domain; otherwise, the program will display the message that states that the conjecture is false. The results of each instance of the domain must be on its own line and it must be written as a relational expression. The conjecture is

A. Goldbachs Conjecture Every even number greater than 2 can be written as a sum of two positive primes. Prove that this is true for every even numbers less than or equal to 1000.

Please give a sort of explanation because I'm not exactly sure how to go about this one. Thank you