It takes a semester to prove it. Here's an outline. It may not mean much to you, but it should give you some idea of what you have to learn.
Let $p$ be an irreducible polynomial of degree 5 with rational coefficients.
Let $a,b,c,d,e$ be the roots of $p$ (in, say, the complex numbers).
Let $K$ be the smallest field containing the rationals and those five roots (so $K$ contains all results of the four arithmetic operations carried out on rationals and on those five roots).
An automorphism of $K$ is a function $g:K\to K$ such that $g(x+y)=g(x)+g(y)$ and $g(xy)=g(x)g(y)$ for all $x,y$ in $K$, and such that if $g(x)=0$ then $x=0$. The set of all automorphisms of $K$ is finite and forms a group under composition. Let $G$ be the group of all automorphisms of $K$.
There is a one-one correspondence between the subgroups of $G$ and the subfields of $K$. What's more, this correspondence converts useful information about subgroups into useful information about subfields, and vice versa. In particular, radical extensions (roughly speaking, subfields where you can write all the elements in terms of square roots, cube roots, fifth roots, etc., and the four arithmetic operations) correspond to solvable groups (roughly, groups $H$ such that you can find a chain of subgroups $1\subset H_1\subset H_2\subset\cdots\subset H$ with $H_{k+1}/H_k$ commutative for all $k$).
Back to our polynomial $p$. For some such $p$, $G$ turns out to be $S_5$, the group of permutations on five letters. That group turns out not to be solvable; its only non-trivial normal subgroup is $A_5$, the alternating group on five letters, and $A_5$ is non-commutative and has no normal subgroups at all (other than itself and the one-element group) so you can't find the chain of subgroups you need for solvability. So $G$ is not solvable, so $K$ is not radical, so there is no expression for $a,b,c,d,e$ in terms of square roots, cube roots, etc., and arithemtic operations.