Here is a simpler explanation.
A group is a collection of elements with a multiplication such that multiplication is associative, there is an identity, and every element has an inverse. Multiplication is generally NOT commutative.
The classic example is the set of all permutations of a set using function composition as multiplication. "Multiplication" is associative because (f o (g o h))(x) and ((f o g) o h)(x) works out to be f(g(h(x))) for any x. The identity permutation is "leave everything where it was". The inverse of a permutation is simply "map everything in reverse".
They spend time talking about S3. That is just the permutations of 3 objects. (Which they visualized as the corners of a triangle.)
Another classic example is the set of invertible nxn matrices using multiplication as multiplication.
A representation is just a function from a group to some set of invertible matrices such that F(x * y) = F(x) * F(y). Note that a representation does NOT have to be one-to-one - you can always just map everything to the identity matrix.
OK, so representations exist. Why would we care? The answer is that each representation of a group shows something about the structure of that group. And says it in a language that we have a lot of tools to work with. Admittedly, the identity representation doesn't say much useful. But the others do. And representations have provided ways to reduce a lot of hard problems to easier ones that we have a better chance to solve.
There are a lot of examples, but the most widely known example of a hard problem that used this idea as part of the solution was Andrew Wiles' solution of Fermat's Last Theorem.