I'm having problems with the first implication. I already know how to prove that $|G| \leq 2$ implies $Aut(G) = \{id\}$. But how can I prove the converse? I found it kind of simple but also a little hard to write. I did this:
Because $Aut(G) = \{id\}$ then there is only one way to rearrange all the elements, and by definition of $Aut(G)$, then $|G| \leq 2$, because you have to fix the neuter and the other element should be fixed if $|G| = 2$.
But I'm not very convinced myself. Anny help would be appreciated.