TITLE: Why do statements which appear elementary have complicated proofs?
QUESTION [16 upvotes]: The motivation for this question is : Rationals of the form $\frac{p}{q}$ where $p,q$ are primes in $[a,b]$ and some other problems in Mathematics which looks as if they are elementary but their proofs are very much sophisticated.
I would like to consider two famous questions: First the "Fermat's Last Theorem" and next the unproven "Goldbach conjecture". These questions appear elementary in nature, but require a lot of Mathematics for even comprehending the solution. Even the problem, which I posed in the link is so elementary but I don't see anyone even giving a proof without using the prime number theorem. 
Now the question is: Why is this happening? If I am able to understand the question, then I should be able to comprehend the solution as well. A Mathematician once quoted: Mathematics is the understanding of how nature works. Is nature so complicated that a common person can't understand as to how it works, or is it we are making it complicated. 
At the same time, I appreciate the beauty of Mathematics also: Paul Erdős' proof of Bertrand's postulate is something which I admire so much because, of its elementary nature. But at the same time i have my skepticism about FLT and other theorems.

I have stated 2 examples of questions which appear elementary, but the proofs are intricate. I know some other problems, in number theory which are of this type. Are there any other problems of this type, which are not Number Theoretical? If yes, I would like to see some of them.

REPLY [2 votes]: Statements containing the word "every" are really much more complicated than they appear. For example the question "is every even integer n >= 4 the sum of two primes" looks easy, but if I ask "is 329872923459897823598798789723452396862359798797234597972798352 the sum of two primes", that's not really an easy question. Answering with "yes" in the obvious way would require to verify that some huge number is not composite, which isn't really easy. Or you'd have to show that one out of the possibly large set of huge numbers must be a prime number. Answering with "no" if that was the correct answer (which is unlikely but not impossible) would be a lot harder.