I felt that the explanation for this problem was a bit lacking and it took me a while to really understand the combinatorics strategy that we learned in our Word Translations Strategy Guide - Combinatorics Chapter.
The explanation reads:
"Ignoring Frankie's requirement for a moment, observe that the six mobsters can be arranged 6! or 6 x 5 x 4 x 3 x 2 x 1 = 720 different ways in the concession stand line. In each of those 720 arrangements, Frankie must be either ahead of or behind Joey. Logically, since the combinations favor neither Frankie nor Joey, each would be behind the other in precisely half of the arrangements. Therefore, in order to satisfy Frankie's requirement, the six mobsters could be arranged in 720/2 = 360 different ways."
For someone who is not great at math, "logically, the combinations not favoring a person" are not clear in an algebraic manner. I am certainly not a qualified MGMAT instructor/representative, so if anyone with MGMAT authority sees this, and feels I have used improper logic, please correct me if I misstate anything.
In this problem, Joey would only be able to stand in line in positions 1 through 5, of 6 (he cannot stand in 6, or Frankie cannot stand behind him). If Joey were to occupy the first spot in line, there are 5 spots behind him that Frankie may elect to stand in (as Frankie must stand behind him, but not necessarily directly behind him), and the other 4 mobsters can stand in any order they want (use 4!), so you get 5*4! = 120. If Joey occupies the second spot in line, Frankie can now only select from 4 spots to stand behind him (because he cannot stand in front of him), and the other 4 mobsters still have freedom of choice, (use 4!), so you get 4*4! = 96. Thus, when Joey takes up spot 3, Frankie now has 3 places to choose from and you get 3*4! = 72. When Joey gets to the 4th spot in line, Frankie now only has 2 options, and you get 2*4! = 48. Lastly, if Joey elects to stand in the 5th spot in line, Frankie only has one option - the 6th spot, so you get 1*4! = 24. Adding up all these different scenarios, you get 120 + 96 + 72 + 48 + 24 = 360 different scenarios that Frankie will satisfy his requirement of being behind Joey.
Alternatively, I also felt MGMAT's strategy/my instructor's "Glue Method" suggestion for combinatorics problems with constraints is somewhat helpful in understanding this problem. The only reason it may be a little misleading is because the question stem specifies that Frankie must stand behind Joey, BUT NOT NECESSARILY BEHIND HIM. If they travel together as JF, (but not FJ, because Joey must PRECEDE Frankie in line), there are now effectively 5 "people". There are 5 scenarios, similar to those mentioned in the previous paragraph, but this time they are stuck together. In the first scenario, JF has 5 options of where they choose to stand, and to make things easier, why not the first spot in line, and the other 4 mobsters have freedom in arrangement (we use 4!) and the first scenario works with 5*4!, then in the second through fifth scenario, refer to above paragraph and add up the totals, giving you the 360 arrangements that satisfy the constraint.