Like in the title, I have to check that Goldbach Conjecture holds for every even number between 900 and 1000.
It's worth to note that I'm not supposed to use computer, so writing e.g. Python code will not do the trick.
Only idea that's coming to my mind is to check every number manually, but it looks very inefficient and like a kind of non-sens.
Is there any better way to do that? (I doubt it to be honest, but hopes I'm wrong)
Let $p_1$ be the largest prime less than $900$. $p_1 = 887$. Let $Q_1$ be the list of all the (odd) primes between $900- p_1$ and $1000 - p_1$ $$ 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113 $$ and record which even numbers in $[900,1000]$ are covered by elements of $p_1 + Q_1$. $$ (p_1 + Q_1)\cap [900,1000] = 900, 904, 906, 910, 916, 918, 924, 928, 930, 934, 940, 946, 948, 954, 958, 960, 966, 970, 976, 984, 988, 990, 994, 996, 1000 \text{.} $$ That's one quarter of the problem solved. Now we only need to find representations for a subset of $[902,998]$.
Now let $p_2$ be the largest prime less than $p_1$. $p_2 = 883$. Let $Q_2$ be the list of all the (odd) primes between $902 - p_2$ and $998 - p_2$ $$ 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113 $$ and record which even numbers in $[900,1000]$ are covered by elements of $p_2 + Q_2$. $$ (p_2 + Q_2)\cap [900,1000] = 902^*, 906, 912^*, 914^*, 920^*, 924, 926^*, 930, 936^*, 942^*, 944^*, 950^*, 954, 956^*, 962^*, 966, 972^*, 980^*, 984, 986^*, 990, 992^*, 996 \text{,} $$ where we mark by asterisks those numbers not previously covered. This is 16 more, so we are 41% finished.
Continue until you have covered everything, although covering the last few cases can take a while. You might occasionally switch to directly trying to cover particular unresolved even numbers in the interval. (Happily, the following process can be stopped and continued easily.)