1.

10 beggars are sitting in a row. The number of ways in which a person having 4 one rupec coins (like), and 6 two rupee coins (like), can give away all coins to them so that each gets one coin and no two adjacent beggars will get one rupee coins. (Hint : By calling one rupee coin as A and two rupee coin as B, we have to arrange AAAABBBBBB so that no two A's are together)

Answer»


ANSWER :`("^7P_4)/(4!)`


Discussion

No Comment Found

Related InterviewSolutions