On the equation $3x^3 + 4y^3 + 5z^3 = 0$ How can I show that the equation $$3x^3 + 4y^3 + 5z^3 = 0$$ has nonzero solutions modulo every integer but not in $\mathbb{Z}$?
 A: This is, of course, Selmer's famous example that the Hasse principle breaks down for cubic (or higher) forms.
It is easy to come up with solutions modulo any power of $2$, any power of $3$, and any power of $5$. For larger primes, if $p\equiv 2\pmod{3}$ then every nonzero element modulo $p$ is a cube, so picking your favorite values for $x$ and $y$ yields a solution $z$, and then you can use Hensel's Lemma to lift that solution (as a cubic polynomial in $z$) modulo $p^n$ for any $n$. If $p\equiv 1\pmod{3}$, then you just need to find a pair $x$ and $y$, not both zero, such that $3x^3+4y^3$ and $-5$ have the same cubic character modulo $p$, and that gives a solution for $z$; Hensel's Lemma again lets you lift it modulo $p^n$ for all $n$.
From knowing that it has nonzero solutions modulo every prime power you conclude using the Chinese Remainder Theorem that it has solutions modulo every integer.
Showing that it has no integer solutions is, as far as I know, a bit harder. One method I seem to recall relies on multiplying through by $2$, and factoring $6X^3 + Y^3 = 10Z^3$ over $\mathbb{Q}(\sqrt[3]{6})$ to show there are no solutions in $\mathbb{Z}$. 
Added. A web search reveals a handout by Keith Conrad that contains the proof in detail, using $p$-adic numbers and arithmetic in $\mathbb{Q}(\sqrt[3]{6})$.  
