Prove that a group is infinite and nonabelian. I'm trying to solve a question of Hungerford's Algebra:

Show that the group defined by generators $a,b$ and relations
  $a^2=b^3=e$ is infinite and nonabelian.

I guess a good approach would be to find an infinite and nonabelian group with two generators satisfying the same conditions and let Van Dyck do all the work. I've been thinking about the group of permutations $S_{\mathbb N}$, some groups of matrices, but I couldn't get it. Could anyone give me a hint? Thanks in advance!
 A: Your approach works out, although I don't think its the best route, here is what I tried:
Consider the group $S_\mathbb N$ and consider the permutation $b$ with cycles $(0,1,2),(3,4,5),(6,7,8)\dots$ and the permutation $a$ with cycles $(2,3),(5,6),(8,9)\dots, (3n-1,3n)\dots$. ( the permutation $a$ "connects" the cycles of $b$)
We can see by inspection that $a$ and $b$ do not commute.
We can also see that $ab$ has infinite order (Notice that $(ab)^2$ sends $3n$ to $3(n+1)$ )
A: There is a simple geometric way to produce an infinite nonabelian quotient of this group: let $a$ and $b$ be $180^{\circ}$ resp. $120^{\circ}$ rotations in appropriate planes in $\mathbb{R}^3$. Explicitly, we can let
$$a = \left[ \begin{array}{cc} 1 & 0 & 0 \\ 0 & -1 & 0 \\ 0 & 0 & -1 \end{array} \right], b = \left[ \begin{array}{cc} - \frac{1}{2} & - \frac{\sqrt{3}}{2} & 0 \\ \frac{\sqrt{3}}{2} & - \frac{1}{2} & 0 \\ 0 & 0 & 1 \end{array} \right].$$

Incidentally, the original group is very well-known: it's the modular group $\Gamma = PSL_2(\mathbb{Z})$. 
A: Here's an argument based on something I learned as "van der Waerden's trick" in the context of free groups: let $X$ be the set of (possibly empty) words in $a,b$ with no substring of $aa$ or $bbb$.  Now, consider the group $S(X)$ and the two elements $\phi_1$ and $\phi_2$ defined as follows: $\phi_1$ prepends $a$ to a word, except if it began with $a$, in which case it deletes the $a$.  Similarly, $\phi_2$ prepends $b$ to a word, except if it began with $bb$, in which case it deletes the leading $bb$.  It is straightforward to check that $\phi_1^2$ and $\phi_2^3$ are the identity, and therefore in fact $\phi_1$ and $\phi_2$ are permutations of $X$.  However, $\phi_1 \circ \phi_2 \ne \phi_2 \circ \phi_1$ since the first takes the empty word to $ab$, and the second takes the empty word to $ba$ - which implies the original group is nonabelian.  Similarly, $(\phi_1 \circ \phi_2)^n$ are all distinct since the $n$th term takes the empty word to $(ab)^n = abab \cdots ab$ - which implies the original group is infinite.
(And in fact, it is easy to see based on this that the interpretation of any "reduced" word in $X$ gives a nontrivial element of the original group - and with some more work that's not very hard, you can prove that group is isomorphic to $X$ with the multiplication operation being "concatenate and reduce", and the proof that this operation is associative reduces to the associativity of composition in $S(X)$.)
A: Hint: consider the set $G$ of strings of symbols $a$ and $b$ that contain no substrings of the form $aa$ or $bbb$. Can you define a group operation on $G$ that satisfies your requirements?
A: This group is isomorphic to $\mathbb Z_2\ast \mathbb Z_3$ (for example see Showing $\mathbb{Z}_{2} * \mathbb{Z}_{3} \cong\ (a, b\ |\ a^2 = b^3 = e)$). Also, the free product of two nontrivial groups is infinite as you can readily check. It is as well nonabelian. 
(This answer is mentioned in Hungerford’s algebra book.)
