Premutations problem help

[RedSunflowers32]

In how many ways can 5 distinct Martians, ten distinct Vesuvians and eight distinct Jovians wait together in line if no two Martains stand together>



2. 10_p_5 = 10! & 5! but what about 8? and 2?



3. 10! = 10*9*8*7*6*5*4*3*2*1
8! = 8*7*6*5*4*3*2*1
5! = 5*4*3*2*1
10*9 = 90/2 = 45?



I am so lost.. I am not a programmer..but required to take this class for my major! Please anyone help me out??

 

[f(x)]

consider a line of vesuvians and jovians and fill the martians into the gaps. That'll be the total possible ways of fitting in Martians so that no two matians stay together.

 

[RedSunflowers32]

hummm

I did that one already and I didn't like the answer. But thanks.

 

[f(x)]

I did that one already and I didn't like the answer.

what does that mean

 

[RedSunflowers32]

It means I did the chain with every 3rd position there is a Martian, but that does not tell me how to write the equation to present the proper answer. If I factor out each element 5! = 120 * 10! = 3628800 *8! =40320
which gives me an answer of 1.5801827328E15.
Since we are working with combinations and Premutations I'm lost on which way to do the problem.