No. What about A before I, A before O, A before U, E before O, E before U, I before U? In any case, this is the wrong way of counting the permutations of the vowels. Now, you know that the number of ways the vowels can be permuted is . Hence the number of solutions the problem requires is as in your first method.