How many different strings can be made from the letters in aardvark, using all the letters, if all three as must be consecutive?

AARDVARK has 3 A's, 2 R's, 1 D, 1 V, and 1 K. If all three A's have to be together, then treat them as one letter. So there are a total of 6 "letters" to arrange. There would be 6! ways to arrange them if the "letters" were all different, but you have to keep in mind that there are 2 R's which are the same, so you need to divide out the number of ways to arrange the R's if they were different, which is 2!. 

So, in total, there are 6!/2! = 360 ways to arrange the letters in AARDVARK if all three A's must be consecutive.