Question: Need to use maple to solve goldbach's conjecture.

I have no idea how to start to answer this question. Please help Thanks!

Let G(x) denote the no. of ways of representing n as the sum of two prime numbers.

For eg, G(10)=2: where 10=3+7=5+5

           G(20)=2: where 20=3+17=7+13

           G(30)=3: where 30=7+23=11+19=13+17

How do you find G(10 000 000)?

Please Wait...