C # Implementation Goldbach conjecture

usingSystem;usingSystem.Collections.Generic;usingSystem.Linq;usingSystem.Text;namespacegoetheofarithmetic{classProgram {Static voidMain (string[] args) {Console.WriteLine ("Please enter an even number greater than 6:"); intIntnum =Convert.ToInt32 (Console.ReadLine ()); BOOLBlflag =Isgdbharith (Intnum); if(Blflag) {Console.WriteLine ("{0} can be written as a sum of two primes, so it conforms to Goldbach conjecture. ", Intnum); }            Else{Console.WriteLine ("conjecture Error");        } console.readline (); }        Static BOOLIsgdbharith (intintnum) {            BOOLBlflag =false; if(Intnum%2==0&& intnum >6)            {                 for(inti =0; I < Intnum/2; i++)                {                    BOOLBL1 =Isprimenumber (i); BOOLBL2 = Isprimenumber (Intnum-i); if(BL1 &bl2) {Console.WriteLine ("{0}={1}+{2}", Intnum, I, Intnum-i); Blflag=true; }                }            }                       returnBlflag; }        Static BOOLIsprimenumber (intintnum) {            BOOLBlflag =true; if(Intnum = =1|| Intnum = =2) {Blflag=true; }            Else            {                intSQR =Convert.ToInt32 (Math.sqrt (intnum));  for(inti = SQR; I >=2; i--)                {                    if(intnum% i = =0) {Blflag=false; }                }            }            returnBlflag; }    }}

C # Implementation Goldbach conjecture