Is there an elementary proof for Fermat's last theorem? I wonder is there an elementary proof for Fermat's last theorem. Why it's so difficult to prove this theorem by elementary method? 
Thanks,  
 A: As far as I know, the only proof there is, is Wiles's proof. And that is not an elementary proof. There is an article about his proof on wikipedia, if you're interested. There is also this video documentary about it that I would highly recommend.
A: It is a common false hunch that shortly-stated theorems should have short proofs. This hunch is easily falsified by employing basic results in logic. For any formal system that has nontrivial power (e.g. Peano arithmetic) there is no recursive algorithm that decides theoremhood.  Now if  there existed a recursive bound $\rm\ L(n)\ $ on the length of proofs of a statement of length $\rm\:n\:,\:$ then we could test for theoremhood simply be enumerating and testing all possible proofs of length $\rm\le L(n)\ $. Hence there can be no such recursive bound on the length of proofs. It follows that there exist short stated theorems with proofs so long that they are probably not amenable to human comprehension (these results date back to Goedel's 1936 paper on speedup theorems). 
It remains to be seen whether or not there exists mathematically interesting theorems like this. There may be examples in Collatz-like congruential iterations (similar to the difficult open $\rm\: 3\ x + 1\: $ problem) that were discovered in the wild while analyzing Busy-beaver holdout machines (while attempting to find the smallest universal Turing machines). John Conway has shown that there exists such congruential iterations with undecidable halting problem. That such undecidable problems may be encoded so succinctly in programs for tiny Turing machines should not come as a surprise to anyone familiar with the above simple results from logic. They are a testament to the power of ingenuity - whether it be human (in powerful mathematical theories) or nature (the DNA-based programs designed by evolution).
For a chess-theoretic analog see my post here, which discusses some massive brute-force computated chess endgame databases revealing optimal move sequences that are completely incomprehensible to human experts. 
Returning to the specific topic at hand, it is known that Fermat's Last Theorem cannot be proved by certain types of descent proofs similar to the classical simple proofs known for small exponents. References to such work can probably be located by Googling "Tate Shafarevich obstruction".
A: Fermat's Last Theorem, although elementary to state, is a very subtle problem.
The general $ABC$ conjecture (still unproved) states (roughly) that if $C = A + B$ (with $A, B, C$ coprime integers), then it is not possible for $A$, $B$, and $C$ to be simultaneously divisible by high powers of integers. 
Fermat's equation considers the special case when $A$, $B$, and $C$ are all taken to be perfect $n$th powers.
The $ABC$ conjecture in general, and Fermat in particular, are then subtle problems relating the additive and multiplicative nature of the integers, and so
there it is perhaps not too surprising that they are difficult to prove (or, in 
the case of $ABC$, that it remains unproved!).
Another famous conjecture relating the additive and multiplicative nature of the
integers is the Goldbach conjecture.  This is, if you like, the "opposite" of $ABC$; it states that for an even integer $N$, we may write $N = p_1 + p_2,$ where $p_1$ and $p_2$ are prime (which is a kind of "opposite" to being divisible by a high perfect power).  It also resists proof.
At a technical level, the tools that have been brought to bear on Fermat, and on $ABC$, are quite different from the tools that have been brought to bear on Goldbach, so perhaps one shouldn't take a comparison between them too seriously.
But they do share the common element of getting at something quite deep about the interrelationship between the additive and mutliplicative structure of the integers, and this is what makes them difficult (or so it seems to me). 
[Added September 2012:] Shinichi Mochizuki has very recently claimed a proof of the ABC conjecture.
